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


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


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race.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 1bbc2abca80ddd6a98ab00d82fa3e4d9128e7e046281b4c3d9fef79785ec022d
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-02-28 21:39:09,097 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 21:39:09,134 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 21:39:09,137 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-28 21:39:09,138 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-28 21:39:09,152 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 21:39:09,153 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 21:39:09,153 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 21:39:09,153 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 21:39:09,154 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 21:39:09,154 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 21:39:09,154 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 21:39:09,155 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-28 21:39:09,155 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 21:39:09,155 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 21:39:09,155 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-28 21:39:09,156 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 21:39:09,156 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 21:39:09,156 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 21:39:09,157 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 21:39:09,157 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 21:39:09,157 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 21:39:09,158 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 21:39:09,158 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-28 21:39:09,158 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-28 21:39:09,158 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 21:39:09,158 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-28 21:39:09,159 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 21:39:09,159 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 21:39:09,159 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 21:39:09,159 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 21:39:09,160 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 21:39:09,160 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 21:39:09,160 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-02-28 21:39:09,160 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 21:39:09,160 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 21:39:09,161 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-28 21:39:09,161 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 21:39:09,161 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 21:39:09,161 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 21:39:09,161 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 21:39:09,162 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 -> 1bbc2abca80ddd6a98ab00d82fa3e4d9128e7e046281b4c3d9fef79785ec022d
[2024-02-28 21:39:09,339 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 21:39:09,372 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 21:39:09,374 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 21:39:09,375 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-02-28 21:39:09,375 INFO  L274        PluginConnector]: CDTParser initialized
[2024-02-28 21:39:09,377 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race.i
[2024-02-28 21:39:10,393 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 21:39:10,610 INFO  L384              CDTParser]: Found 1 translation units.
[2024-02-28 21:39:10,610 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race.i
[2024-02-28 21:39:10,621 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/f75d9f9b3/006bc652404c44bca1b19d818998b6c1/FLAG5012765d2
[2024-02-28 21:39:10,636 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/f75d9f9b3/006bc652404c44bca1b19d818998b6c1
[2024-02-28 21:39:10,638 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 21:39:10,639 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 21:39:10,640 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 21:39:10,641 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 21:39:10,645 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 21:39:10,646 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:10,647 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d90d472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10, skipping insertion in model container
[2024-02-28 21:39:10,647 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:10,683 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-02-28 21:39:10,908 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 21:39:10,918 INFO  L202         MainTranslator]: Completed pre-run
[2024-02-28 21:39:10,946 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 21:39:10,964 WARN  L675               CHandler]: The function pthread_detach is called, but not defined or handled by StandardFunctionHandler.
[2024-02-28 21:39:10,970 INFO  L206         MainTranslator]: Completed translation
[2024-02-28 21:39:10,970 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10 WrapperNode
[2024-02-28 21:39:10,970 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 21:39:10,971 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 21:39:10,971 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 21:39:10,971 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 21:39:10,976 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:10,986 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:11,002 INFO  L138                Inliner]: procedures = 160, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68
[2024-02-28 21:39:11,002 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 21:39:11,003 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 21:39:11,003 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 21:39:11,003 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 21:39:11,010 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:11,010 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:11,012 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:11,012 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:11,016 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:11,018 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:11,019 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:11,020 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:11,022 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 21:39:11,023 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 21:39:11,023 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 21:39:11,023 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-28 21:39:11,024 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (1/1) ...
[2024-02-28 21:39:11,028 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 21:39:11,036 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:39:11,050 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-02-28 21:39:11,057 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-02-28 21:39:11,082 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 21:39:11,082 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 21:39:11,082 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-02-28 21:39:11,082 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-02-28 21:39:11,082 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 21:39:11,083 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 21:39:11,083 INFO  L130     BoogieDeclarations]: Found specification of procedure pthread_detach
[2024-02-28 21:39:11,083 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-02-28 21:39:11,083 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 21:39:11,083 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 21:39:11,083 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-02-28 21:39:11,104 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 21:39:11,105 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 21:39:11,108 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-02-28 21:39:11,243 INFO  L241             CfgBuilder]: Building ICFG
[2024-02-28 21:39:11,245 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 21:39:11,375 INFO  L282             CfgBuilder]: Performing block encoding
[2024-02-28 21:39:11,389 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 21:39:11,389 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 21:39:11,390 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 09:39:11 BoogieIcfgContainer
[2024-02-28 21:39:11,391 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 21:39:11,393 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 21:39:11,393 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 21:39:11,395 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-02-28 21:39:11,395 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 09:39:10" (1/3) ...
[2024-02-28 21:39:11,396 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c39dd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 09:39:11, skipping insertion in model container
[2024-02-28 21:39:11,396 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 09:39:10" (2/3) ...
[2024-02-28 21:39:11,396 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c39dd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 09:39:11, skipping insertion in model container
[2024-02-28 21:39:11,396 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 09:39:11" (3/3) ...
[2024-02-28 21:39:11,397 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race.i
[2024-02-28 21:39:11,403 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 21:39:11,411 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 21:39:11,411 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-02-28 21:39:11,411 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 21:39:11,448 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-02-28 21:39:11,475 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 104 places, 105 transitions, 214 flow
[2024-02-28 21:39:11,516 INFO  L124   PetriNetUnfolderBase]: 7/137 cut-off events.
[2024-02-28 21:39:11,516 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 21:39:11,520 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 141 conditions, 137 events. 7/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. 
[2024-02-28 21:39:11,520 INFO  L82        GeneralOperation]: Start removeDead. Operand has 104 places, 105 transitions, 214 flow
[2024-02-28 21:39:11,523 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 104 places, 105 transitions, 214 flow
[2024-02-28 21:39:11,531 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 21:39:11,537 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;@2921361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 21:39:11,537 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2024-02-28 21:39:11,543 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 21:39:11,543 INFO  L124   PetriNetUnfolderBase]: 2/31 cut-off events.
[2024-02-28 21:39:11,543 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 21:39:11,543 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:11,544 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]
[2024-02-28 21:39:11,544 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:39:11,548 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:11,548 INFO  L85        PathProgramCache]: Analyzing trace with hash 1040195272, now seen corresponding path program 1 times
[2024-02-28 21:39:11,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:11,555 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581236165]
[2024-02-28 21:39:11,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:11,556 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:11,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:11,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:11,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:11,704 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581236165]
[2024-02-28 21:39:11,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581236165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:11,704 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:11,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:39:11,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435247230]
[2024-02-28 21:39:11,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:11,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:39:11,716 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:11,733 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:39:11,734 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:39:11,760 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 105
[2024-02-28 21:39:11,762 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 105 transitions, 214 flow. Second operand  has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:11,762 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:11,762 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 105
[2024-02-28 21:39:11,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:11,830 INFO  L124   PetriNetUnfolderBase]: 32/303 cut-off events.
[2024-02-28 21:39:11,830 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-02-28 21:39:11,831 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 390 conditions, 303 events. 32/303 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1194 event pairs, 7 based on Foata normal form. 5/272 useless extension candidates. Maximal degree in co-relation 320. Up to 59 conditions per place. 
[2024-02-28 21:39:11,833 INFO  L140   encePairwiseOnDemand]: 91/105 looper letters, 16 selfloop transitions, 8 changer transitions 1/112 dead transitions.
[2024-02-28 21:39:11,833 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 112 transitions, 276 flow
[2024-02-28 21:39:11,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:39:11,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:39:11,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions.
[2024-02-28 21:39:11,843 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9396825396825397
[2024-02-28 21:39:11,844 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 296 transitions.
[2024-02-28 21:39:11,844 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions.
[2024-02-28 21:39:11,845 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:11,847 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions.
[2024-02-28 21:39:11,849 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:11,853 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:11,853 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:11,854 INFO  L175             Difference]: Start difference. First operand has 104 places, 105 transitions, 214 flow. Second operand 3 states and 296 transitions.
[2024-02-28 21:39:11,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 112 transitions, 276 flow
[2024-02-28 21:39:11,857 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 112 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 21:39:11,859 INFO  L231             Difference]: Finished difference. Result has 108 places, 109 transitions, 276 flow
[2024-02-28 21:39:11,861 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=108, PETRI_TRANSITIONS=109}
[2024-02-28 21:39:11,863 INFO  L281   CegarLoopForPetriNet]: 104 programPoint places, 4 predicate places.
[2024-02-28 21:39:11,863 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 276 flow
[2024-02-28 21:39:11,864 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:11,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:11,864 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:11,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 21:39:11,864 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:39:11,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:11,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 1678005024, now seen corresponding path program 1 times
[2024-02-28 21:39:11,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:11,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609841965]
[2024-02-28 21:39:11,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:11,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:11,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:11,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:11,910 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:11,910 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609841965]
[2024-02-28 21:39:11,910 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609841965] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:11,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:11,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:39:11,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575992008]
[2024-02-28 21:39:11,911 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:11,912 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:39:11,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:11,912 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:39:11,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:39:11,920 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 105
[2024-02-28 21:39:11,921 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 276 flow. Second operand  has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:11,921 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:11,921 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 105
[2024-02-28 21:39:11,921 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:11,961 INFO  L124   PetriNetUnfolderBase]: 27/307 cut-off events.
[2024-02-28 21:39:11,961 INFO  L125   PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES.
[2024-02-28 21:39:11,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 431 conditions, 307 events. 27/307 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1337 event pairs, 6 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 356. Up to 45 conditions per place. 
[2024-02-28 21:39:11,963 INFO  L140   encePairwiseOnDemand]: 101/105 looper letters, 8 selfloop transitions, 3 changer transitions 0/113 dead transitions.
[2024-02-28 21:39:11,963 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 113 transitions, 306 flow
[2024-02-28 21:39:11,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:39:11,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:39:11,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions.
[2024-02-28 21:39:11,965 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9428571428571428
[2024-02-28 21:39:11,965 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 297 transitions.
[2024-02-28 21:39:11,965 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions.
[2024-02-28 21:39:11,965 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:11,965 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions.
[2024-02-28 21:39:11,966 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-02-28 21:39:11,968 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:11,968 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:11,968 INFO  L175             Difference]: Start difference. First operand has 108 places, 109 transitions, 276 flow. Second operand 3 states and 297 transitions.
[2024-02-28 21:39:11,968 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 113 transitions, 306 flow
[2024-02-28 21:39:11,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 113 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:39:11,971 INFO  L231             Difference]: Finished difference. Result has 109 places, 111 transitions, 282 flow
[2024-02-28 21:39:11,971 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=109, PETRI_TRANSITIONS=111}
[2024-02-28 21:39:11,972 INFO  L281   CegarLoopForPetriNet]: 104 programPoint places, 5 predicate places.
[2024-02-28 21:39:11,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 282 flow
[2024-02-28 21:39:11,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:11,973 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:11,973 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-02-28 21:39:11,973 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 21:39:11,973 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:39:11,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:11,974 INFO  L85        PathProgramCache]: Analyzing trace with hash 322058874, now seen corresponding path program 1 times
[2024-02-28 21:39:11,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:11,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370510319]
[2024-02-28 21:39:11,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:11,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:11,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:12,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:12,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:12,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370510319]
[2024-02-28 21:39:12,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370510319] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:12,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:12,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:39:12,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691521710]
[2024-02-28 21:39:12,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:12,012 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:39:12,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:12,013 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:39:12,013 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:39:12,039 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 105
[2024-02-28 21:39:12,039 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 282 flow. Second operand  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,039 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:12,039 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 105
[2024-02-28 21:39:12,039 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:12,090 INFO  L124   PetriNetUnfolderBase]: 54/466 cut-off events.
[2024-02-28 21:39:12,090 INFO  L125   PetriNetUnfolderBase]: For 65/87 co-relation queries the response was YES.
[2024-02-28 21:39:12,091 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 719 conditions, 466 events. 54/466 cut-off events. For 65/87 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2515 event pairs, 23 based on Foata normal form. 4/421 useless extension candidates. Maximal degree in co-relation 637. Up to 104 conditions per place. 
[2024-02-28 21:39:12,092 INFO  L140   encePairwiseOnDemand]: 99/105 looper letters, 19 selfloop transitions, 7 changer transitions 0/118 dead transitions.
[2024-02-28 21:39:12,093 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 118 transitions, 354 flow
[2024-02-28 21:39:12,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:39:12,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:39:12,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions.
[2024-02-28 21:39:12,095 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9047619047619048
[2024-02-28 21:39:12,095 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 285 transitions.
[2024-02-28 21:39:12,095 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions.
[2024-02-28 21:39:12,095 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:12,095 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions.
[2024-02-28 21:39:12,096 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,097 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,098 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,098 INFO  L175             Difference]: Start difference. First operand has 109 places, 111 transitions, 282 flow. Second operand 3 states and 285 transitions.
[2024-02-28 21:39:12,098 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 118 transitions, 354 flow
[2024-02-28 21:39:12,099 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 118 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:39:12,101 INFO  L231             Difference]: Finished difference. Result has 111 places, 116 transitions, 332 flow
[2024-02-28 21:39:12,101 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=111, PETRI_TRANSITIONS=116}
[2024-02-28 21:39:12,102 INFO  L281   CegarLoopForPetriNet]: 104 programPoint places, 7 predicate places.
[2024-02-28 21:39:12,102 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 116 transitions, 332 flow
[2024-02-28 21:39:12,102 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,102 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:12,102 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:12,102 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 21:39:12,103 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:39:12,103 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:12,103 INFO  L85        PathProgramCache]: Analyzing trace with hash 595096263, now seen corresponding path program 1 times
[2024-02-28 21:39:12,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:12,103 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828042457]
[2024-02-28 21:39:12,103 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:12,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:12,130 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:12,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:12,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:12,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828042457]
[2024-02-28 21:39:12,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828042457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:12,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:12,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 21:39:12,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383129793]
[2024-02-28 21:39:12,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:12,416 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 21:39:12,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:12,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 21:39:12,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 21:39:12,464 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 105
[2024-02-28 21:39:12,465 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 116 transitions, 332 flow. Second operand  has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,465 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:12,465 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 105
[2024-02-28 21:39:12,465 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:12,555 INFO  L124   PetriNetUnfolderBase]: 51/499 cut-off events.
[2024-02-28 21:39:12,556 INFO  L125   PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES.
[2024-02-28 21:39:12,557 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 759 conditions, 499 events. 51/499 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2606 event pairs, 12 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 676. Up to 62 conditions per place. 
[2024-02-28 21:39:12,558 INFO  L140   encePairwiseOnDemand]: 99/105 looper letters, 16 selfloop transitions, 5 changer transitions 0/123 dead transitions.
[2024-02-28 21:39:12,558 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 123 transitions, 388 flow
[2024-02-28 21:39:12,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 21:39:12,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 21:39:12,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions.
[2024-02-28 21:39:12,560 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.873015873015873
[2024-02-28 21:39:12,560 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 550 transitions.
[2024-02-28 21:39:12,560 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 550 transitions.
[2024-02-28 21:39:12,561 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:12,561 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 550 transitions.
[2024-02-28 21:39:12,562 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,564 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,564 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,565 INFO  L175             Difference]: Start difference. First operand has 111 places, 116 transitions, 332 flow. Second operand 6 states and 550 transitions.
[2024-02-28 21:39:12,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 123 transitions, 388 flow
[2024-02-28 21:39:12,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:39:12,569 INFO  L231             Difference]: Finished difference. Result has 113 places, 115 transitions, 326 flow
[2024-02-28 21:39:12,569 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=113, PETRI_TRANSITIONS=115}
[2024-02-28 21:39:12,569 INFO  L281   CegarLoopForPetriNet]: 104 programPoint places, 9 predicate places.
[2024-02-28 21:39:12,570 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 115 transitions, 326 flow
[2024-02-28 21:39:12,570 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,570 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:12,570 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:12,570 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 21:39:12,571 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:39:12,571 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:12,571 INFO  L85        PathProgramCache]: Analyzing trace with hash -1888681150, now seen corresponding path program 1 times
[2024-02-28 21:39:12,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:12,571 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819674708]
[2024-02-28 21:39:12,572 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:12,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:12,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:12,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:12,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:12,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819674708]
[2024-02-28 21:39:12,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819674708] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:12,606 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:12,606 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:39:12,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527526854]
[2024-02-28 21:39:12,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:12,606 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:39:12,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:12,607 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:39:12,607 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:39:12,617 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 105
[2024-02-28 21:39:12,617 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 115 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 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-02-28 21:39:12,617 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:12,617 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 105
[2024-02-28 21:39:12,617 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:12,649 INFO  L124   PetriNetUnfolderBase]: 35/369 cut-off events.
[2024-02-28 21:39:12,649 INFO  L125   PetriNetUnfolderBase]: For 36/43 co-relation queries the response was YES.
[2024-02-28 21:39:12,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 559 conditions, 369 events. 35/369 cut-off events. For 36/43 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1956 event pairs, 9 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 482. Up to 51 conditions per place. 
[2024-02-28 21:39:12,651 INFO  L140   encePairwiseOnDemand]: 100/105 looper letters, 8 selfloop transitions, 5 changer transitions 0/118 dead transitions.
[2024-02-28 21:39:12,651 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 360 flow
[2024-02-28 21:39:12,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:39:12,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:39:12,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions.
[2024-02-28 21:39:12,652 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.926984126984127
[2024-02-28 21:39:12,652 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 292 transitions.
[2024-02-28 21:39:12,652 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions.
[2024-02-28 21:39:12,653 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:12,653 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions.
[2024-02-28 21:39:12,653 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,654 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,654 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,654 INFO  L175             Difference]: Start difference. First operand has 113 places, 115 transitions, 326 flow. Second operand 3 states and 292 transitions.
[2024-02-28 21:39:12,655 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 118 transitions, 360 flow
[2024-02-28 21:39:12,656 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 350 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-02-28 21:39:12,657 INFO  L231             Difference]: Finished difference. Result has 112 places, 118 transitions, 352 flow
[2024-02-28 21:39:12,658 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=112, PETRI_TRANSITIONS=118}
[2024-02-28 21:39:12,658 INFO  L281   CegarLoopForPetriNet]: 104 programPoint places, 8 predicate places.
[2024-02-28 21:39:12,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 118 transitions, 352 flow
[2024-02-28 21:39:12,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 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-02-28 21:39:12,659 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:12,659 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:12,659 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 21:39:12,659 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:39:12,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:12,659 INFO  L85        PathProgramCache]: Analyzing trace with hash 1527165596, now seen corresponding path program 1 times
[2024-02-28 21:39:12,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:12,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94078518]
[2024-02-28 21:39:12,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:12,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:12,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:12,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:12,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:12,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94078518]
[2024-02-28 21:39:12,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94078518] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:12,685 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:12,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:39:12,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976613998]
[2024-02-28 21:39:12,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:12,686 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:39:12,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:12,686 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:39:12,686 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:39:12,707 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 105
[2024-02-28 21:39:12,707 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 118 transitions, 352 flow. Second operand  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,707 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:12,707 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 105
[2024-02-28 21:39:12,707 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:12,749 INFO  L124   PetriNetUnfolderBase]: 64/488 cut-off events.
[2024-02-28 21:39:12,749 INFO  L125   PetriNetUnfolderBase]: For 160/184 co-relation queries the response was YES.
[2024-02-28 21:39:12,750 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 889 conditions, 488 events. 64/488 cut-off events. For 160/184 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2781 event pairs, 13 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 805. Up to 109 conditions per place. 
[2024-02-28 21:39:12,751 INFO  L140   encePairwiseOnDemand]: 98/105 looper letters, 16 selfloop transitions, 11 changer transitions 1/125 dead transitions.
[2024-02-28 21:39:12,751 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 125 transitions, 434 flow
[2024-02-28 21:39:12,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:39:12,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:39:12,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions.
[2024-02-28 21:39:12,752 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9142857142857143
[2024-02-28 21:39:12,752 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 288 transitions.
[2024-02-28 21:39:12,752 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions.
[2024-02-28 21:39:12,752 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:12,752 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions.
[2024-02-28 21:39:12,753 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-02-28 21:39:12,754 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,754 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,754 INFO  L175             Difference]: Start difference. First operand has 112 places, 118 transitions, 352 flow. Second operand 3 states and 288 transitions.
[2024-02-28 21:39:12,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 125 transitions, 434 flow
[2024-02-28 21:39:12,755 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 125 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:39:12,757 INFO  L231             Difference]: Finished difference. Result has 114 places, 124 transitions, 426 flow
[2024-02-28 21:39:12,757 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=114, PETRI_TRANSITIONS=124}
[2024-02-28 21:39:12,757 INFO  L281   CegarLoopForPetriNet]: 104 programPoint places, 10 predicate places.
[2024-02-28 21:39:12,757 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 124 transitions, 426 flow
[2024-02-28 21:39:12,758 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,758 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:12,758 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:12,758 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 21:39:12,758 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-02-28 21:39:12,758 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:12,759 INFO  L85        PathProgramCache]: Analyzing trace with hash 1988904299, now seen corresponding path program 1 times
[2024-02-28 21:39:12,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:12,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758718172]
[2024-02-28 21:39:12,759 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:12,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:12,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:39:12,776 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 21:39:12,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:39:12,808 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 21:39:12,808 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 21:39:12,809 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2024-02-28 21:39:12,810 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2024-02-28 21:39:12,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2024-02-28 21:39:12,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2024-02-28 21:39:12,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2024-02-28 21:39:12,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2024-02-28 21:39:12,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2024-02-28 21:39:12,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2024-02-28 21:39:12,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2024-02-28 21:39:12,812 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2024-02-28 21:39:12,812 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2024-02-28 21:39:12,812 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2024-02-28 21:39:12,812 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 21:39:12,812 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:12,814 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 21:39:12,814 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 21:39:12,829 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-02-28 21:39:12,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 134 places, 133 transitions, 276 flow
[2024-02-28 21:39:12,846 INFO  L124   PetriNetUnfolderBase]: 10/215 cut-off events.
[2024-02-28 21:39:12,846 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2024-02-28 21:39:12,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 223 conditions, 215 events. 10/215 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 291 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 138. Up to 6 conditions per place. 
[2024-02-28 21:39:12,847 INFO  L82        GeneralOperation]: Start removeDead. Operand has 134 places, 133 transitions, 276 flow
[2024-02-28 21:39:12,848 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 134 places, 133 transitions, 276 flow
[2024-02-28 21:39:12,849 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 21:39:12,849 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;@2921361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 21:39:12,850 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-02-28 21:39:12,851 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 21:39:12,851 INFO  L124   PetriNetUnfolderBase]: 2/31 cut-off events.
[2024-02-28 21:39:12,851 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 21:39:12,852 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:12,852 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]
[2024-02-28 21:39:12,852 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:39:12,852 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:12,852 INFO  L85        PathProgramCache]: Analyzing trace with hash -1807123667, now seen corresponding path program 1 times
[2024-02-28 21:39:12,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:12,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827362830]
[2024-02-28 21:39:12,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:12,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:12,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:12,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:12,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:12,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827362830]
[2024-02-28 21:39:12,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827362830] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:12,867 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:12,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:39:12,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069881199]
[2024-02-28 21:39:12,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:12,868 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:39:12,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:12,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:39:12,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:39:12,893 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133
[2024-02-28 21:39:12,893 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 133 transitions, 276 flow. Second operand  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:12,893 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:12,893 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133
[2024-02-28 21:39:12,893 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:13,123 INFO  L124   PetriNetUnfolderBase]: 563/2385 cut-off events.
[2024-02-28 21:39:13,123 INFO  L125   PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES.
[2024-02-28 21:39:13,127 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3415 conditions, 2385 events. 563/2385 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 19801 event pairs, 195 based on Foata normal form. 36/2126 useless extension candidates. Maximal degree in co-relation 2689. Up to 666 conditions per place. 
[2024-02-28 21:39:13,134 INFO  L140   encePairwiseOnDemand]: 115/133 looper letters, 26 selfloop transitions, 11 changer transitions 1/146 dead transitions.
[2024-02-28 21:39:13,134 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 146 transitions, 381 flow
[2024-02-28 21:39:13,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:39:13,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:39:13,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions.
[2024-02-28 21:39:13,135 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9348370927318296
[2024-02-28 21:39:13,135 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 373 transitions.
[2024-02-28 21:39:13,135 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions.
[2024-02-28 21:39:13,136 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:13,136 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions.
[2024-02-28 21:39:13,136 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,137 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,137 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,138 INFO  L175             Difference]: Start difference. First operand has 134 places, 133 transitions, 276 flow. Second operand 3 states and 373 transitions.
[2024-02-28 21:39:13,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 146 transitions, 381 flow
[2024-02-28 21:39:13,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 146 transitions, 381 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 21:39:13,140 INFO  L231             Difference]: Finished difference. Result has 138 places, 140 transitions, 364 flow
[2024-02-28 21:39:13,140 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=138, PETRI_TRANSITIONS=140}
[2024-02-28 21:39:13,140 INFO  L281   CegarLoopForPetriNet]: 134 programPoint places, 4 predicate places.
[2024-02-28 21:39:13,141 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 140 transitions, 364 flow
[2024-02-28 21:39:13,141 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,141 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:13,141 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:13,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 21:39:13,141 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:39:13,141 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:13,142 INFO  L85        PathProgramCache]: Analyzing trace with hash -2079494587, now seen corresponding path program 1 times
[2024-02-28 21:39:13,142 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:13,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595374610]
[2024-02-28 21:39:13,142 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:13,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:13,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:13,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:13,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:13,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595374610]
[2024-02-28 21:39:13,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595374610] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:13,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:13,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:39:13,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086230632]
[2024-02-28 21:39:13,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:13,158 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:39:13,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:13,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:39:13,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:39:13,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 133
[2024-02-28 21:39:13,169 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 364 flow. Second operand  has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,169 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:13,169 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 133
[2024-02-28 21:39:13,169 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:13,397 INFO  L124   PetriNetUnfolderBase]: 467/2561 cut-off events.
[2024-02-28 21:39:13,398 INFO  L125   PetriNetUnfolderBase]: For 229/235 co-relation queries the response was YES.
[2024-02-28 21:39:13,402 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3914 conditions, 2561 events. 467/2561 cut-off events. For 229/235 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 23268 event pairs, 170 based on Foata normal form. 0/2292 useless extension candidates. Maximal degree in co-relation 3156. Up to 494 conditions per place. 
[2024-02-28 21:39:13,409 INFO  L140   encePairwiseOnDemand]: 128/133 looper letters, 14 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2024-02-28 21:39:13,409 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 147 transitions, 414 flow
[2024-02-28 21:39:13,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:39:13,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:39:13,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions.
[2024-02-28 21:39:13,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9423558897243107
[2024-02-28 21:39:13,411 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 376 transitions.
[2024-02-28 21:39:13,411 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions.
[2024-02-28 21:39:13,411 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:13,411 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions.
[2024-02-28 21:39:13,412 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,412 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,413 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,413 INFO  L175             Difference]: Start difference. First operand has 138 places, 140 transitions, 364 flow. Second operand 3 states and 376 transitions.
[2024-02-28 21:39:13,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 147 transitions, 414 flow
[2024-02-28 21:39:13,415 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 147 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:39:13,417 INFO  L231             Difference]: Finished difference. Result has 139 places, 143 transitions, 372 flow
[2024-02-28 21:39:13,417 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=139, PETRI_TRANSITIONS=143}
[2024-02-28 21:39:13,417 INFO  L281   CegarLoopForPetriNet]: 134 programPoint places, 5 predicate places.
[2024-02-28 21:39:13,417 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 143 transitions, 372 flow
[2024-02-28 21:39:13,418 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,418 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:13,418 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:13,418 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 21:39:13,418 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:39:13,418 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:13,418 INFO  L85        PathProgramCache]: Analyzing trace with hash -196311942, now seen corresponding path program 1 times
[2024-02-28 21:39:13,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:13,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792329157]
[2024-02-28 21:39:13,419 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:13,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:13,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:13,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:13,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:13,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792329157]
[2024-02-28 21:39:13,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792329157] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:13,434 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:13,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:39:13,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034619070]
[2024-02-28 21:39:13,434 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:13,434 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:39:13,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:13,435 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:39:13,435 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:39:13,471 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 133
[2024-02-28 21:39:13,471 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 143 transitions, 372 flow. Second operand  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,472 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:13,472 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 133
[2024-02-28 21:39:13,472 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:13,608 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][37], [112#L685-2true, Black: 145#(= |#race~data~0| 0), 143#true, threadThread1of2ForFork0InUse, 16#L697-1true, threadThread2of2ForFork0InUse, 149#true, 48#L682-3true, Black: 137#true])
[2024-02-28 21:39:13,608 INFO  L294   olderBase$Statistics]: this new event has 111 ancestors and is cut-off event
[2024-02-28 21:39:13,608 INFO  L297   olderBase$Statistics]:   existing Event has 108 ancestors and is cut-off event
[2024-02-28 21:39:13,609 INFO  L297   olderBase$Statistics]:   existing Event has 111 ancestors and is cut-off event
[2024-02-28 21:39:13,609 INFO  L297   olderBase$Statistics]:   existing Event has 108 ancestors and is cut-off event
[2024-02-28 21:39:13,702 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][37], [112#L685-2true, Black: 145#(= |#race~data~0| 0), 143#true, 61#L684-3true, threadThread1of2ForFork0InUse, 16#L697-1true, threadThread2of2ForFork0InUse, 149#true, Black: 137#true])
[2024-02-28 21:39:13,702 INFO  L294   olderBase$Statistics]: this new event has 121 ancestors and is cut-off event
[2024-02-28 21:39:13,703 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-02-28 21:39:13,703 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-02-28 21:39:13,703 INFO  L297   olderBase$Statistics]:   existing Event has 121 ancestors and is cut-off event
[2024-02-28 21:39:13,872 INFO  L124   PetriNetUnfolderBase]: 1076/4672 cut-off events.
[2024-02-28 21:39:13,873 INFO  L125   PetriNetUnfolderBase]: For 846/1155 co-relation queries the response was YES.
[2024-02-28 21:39:13,880 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7812 conditions, 4672 events. 1076/4672 cut-off events. For 846/1155 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 46616 event pairs, 538 based on Foata normal form. 39/4075 useless extension candidates. Maximal degree in co-relation 6539. Up to 1374 conditions per place. 
[2024-02-28 21:39:13,893 INFO  L140   encePairwiseOnDemand]: 125/133 looper letters, 28 selfloop transitions, 12 changer transitions 0/157 dead transitions.
[2024-02-28 21:39:13,893 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 157 transitions, 496 flow
[2024-02-28 21:39:13,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:39:13,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:39:13,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions.
[2024-02-28 21:39:13,894 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9097744360902256
[2024-02-28 21:39:13,894 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 363 transitions.
[2024-02-28 21:39:13,894 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions.
[2024-02-28 21:39:13,895 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:13,895 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions.
[2024-02-28 21:39:13,895 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,896 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,896 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,896 INFO  L175             Difference]: Start difference. First operand has 139 places, 143 transitions, 372 flow. Second operand 3 states and 363 transitions.
[2024-02-28 21:39:13,896 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 157 transitions, 496 flow
[2024-02-28 21:39:13,898 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 157 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:39:13,900 INFO  L231             Difference]: Finished difference. Result has 141 places, 153 transitions, 470 flow
[2024-02-28 21:39:13,900 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=141, PETRI_TRANSITIONS=153}
[2024-02-28 21:39:13,900 INFO  L281   CegarLoopForPetriNet]: 134 programPoint places, 7 predicate places.
[2024-02-28 21:39:13,900 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 153 transitions, 470 flow
[2024-02-28 21:39:13,901 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:13,901 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:13,901 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:13,901 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 21:39:13,901 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:39:13,901 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:13,901 INFO  L85        PathProgramCache]: Analyzing trace with hash 330464775, now seen corresponding path program 1 times
[2024-02-28 21:39:13,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:13,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656726739]
[2024-02-28 21:39:13,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:13,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:13,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:14,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:14,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:14,118 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656726739]
[2024-02-28 21:39:14,118 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656726739] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:14,118 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:14,118 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 21:39:14,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715341443]
[2024-02-28 21:39:14,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:14,118 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 21:39:14,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:14,119 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 21:39:14,119 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 21:39:14,167 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 133
[2024-02-28 21:39:14,167 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 153 transitions, 470 flow. Second operand  has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:14,167 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:14,167 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 133
[2024-02-28 21:39:14,167 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:14,576 INFO  L124   PetriNetUnfolderBase]: 832/4349 cut-off events.
[2024-02-28 21:39:14,576 INFO  L125   PetriNetUnfolderBase]: For 852/923 co-relation queries the response was YES.
[2024-02-28 21:39:14,584 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7168 conditions, 4349 events. 832/4349 cut-off events. For 852/923 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 41982 event pairs, 248 based on Foata normal form. 1/3834 useless extension candidates. Maximal degree in co-relation 5680. Up to 714 conditions per place. 
[2024-02-28 21:39:14,596 INFO  L140   encePairwiseOnDemand]: 127/133 looper letters, 27 selfloop transitions, 5 changer transitions 0/168 dead transitions.
[2024-02-28 21:39:14,597 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 168 transitions, 564 flow
[2024-02-28 21:39:14,597 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 21:39:14,597 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 21:39:14,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions.
[2024-02-28 21:39:14,599 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8909774436090225
[2024-02-28 21:39:14,599 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 711 transitions.
[2024-02-28 21:39:14,599 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 711 transitions.
[2024-02-28 21:39:14,599 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:14,599 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 711 transitions.
[2024-02-28 21:39:14,601 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:14,602 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:14,602 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:14,602 INFO  L175             Difference]: Start difference. First operand has 141 places, 153 transitions, 470 flow. Second operand 6 states and 711 transitions.
[2024-02-28 21:39:14,603 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 168 transitions, 564 flow
[2024-02-28 21:39:14,608 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 168 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:39:14,610 INFO  L231             Difference]: Finished difference. Result has 143 places, 152 transitions, 454 flow
[2024-02-28 21:39:14,610 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=454, PETRI_PLACES=143, PETRI_TRANSITIONS=152}
[2024-02-28 21:39:14,611 INFO  L281   CegarLoopForPetriNet]: 134 programPoint places, 9 predicate places.
[2024-02-28 21:39:14,611 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 152 transitions, 454 flow
[2024-02-28 21:39:14,611 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:14,611 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:14,611 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:14,612 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 21:39:14,612 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:39:14,612 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:14,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -1502322553, now seen corresponding path program 1 times
[2024-02-28 21:39:14,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:14,613 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135171591]
[2024-02-28 21:39:14,613 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:14,613 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:14,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:14,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:14,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:14,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135171591]
[2024-02-28 21:39:14,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135171591] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:14,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:14,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:39:14,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380320383]
[2024-02-28 21:39:14,638 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:14,638 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:39:14,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:14,638 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:39:14,639 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:39:14,653 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 133
[2024-02-28 21:39:14,653 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 152 transitions, 454 flow. Second operand  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 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-02-28 21:39:14,653 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:14,654 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 133
[2024-02-28 21:39:14,654 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:15,033 INFO  L124   PetriNetUnfolderBase]: 763/4023 cut-off events.
[2024-02-28 21:39:15,033 INFO  L125   PetriNetUnfolderBase]: For 694/1034 co-relation queries the response was YES.
[2024-02-28 21:39:15,038 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6624 conditions, 4023 events. 763/4023 cut-off events. For 694/1034 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 42076 event pairs, 261 based on Foata normal form. 2/3504 useless extension candidates. Maximal degree in co-relation 5697. Up to 722 conditions per place. 
[2024-02-28 21:39:15,046 INFO  L140   encePairwiseOnDemand]: 127/133 looper letters, 16 selfloop transitions, 7 changer transitions 0/160 dead transitions.
[2024-02-28 21:39:15,046 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 160 transitions, 527 flow
[2024-02-28 21:39:15,047 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:39:15,047 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:39:15,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions.
[2024-02-28 21:39:15,047 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9323308270676691
[2024-02-28 21:39:15,048 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 372 transitions.
[2024-02-28 21:39:15,048 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions.
[2024-02-28 21:39:15,048 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:15,048 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions.
[2024-02-28 21:39:15,049 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:15,049 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:15,050 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:15,050 INFO  L175             Difference]: Start difference. First operand has 143 places, 152 transitions, 454 flow. Second operand 3 states and 372 transitions.
[2024-02-28 21:39:15,050 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 160 transitions, 527 flow
[2024-02-28 21:39:15,051 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 160 transitions, 517 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-02-28 21:39:15,052 INFO  L231             Difference]: Finished difference. Result has 142 places, 157 transitions, 500 flow
[2024-02-28 21:39:15,053 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=142, PETRI_TRANSITIONS=157}
[2024-02-28 21:39:15,053 INFO  L281   CegarLoopForPetriNet]: 134 programPoint places, 8 predicate places.
[2024-02-28 21:39:15,053 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 157 transitions, 500 flow
[2024-02-28 21:39:15,053 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 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-02-28 21:39:15,053 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:15,053 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:15,053 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-02-28 21:39:15,054 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:39:15,054 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:15,054 INFO  L85        PathProgramCache]: Analyzing trace with hash -1338414692, now seen corresponding path program 1 times
[2024-02-28 21:39:15,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:15,054 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969975228]
[2024-02-28 21:39:15,054 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:15,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:15,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:15,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:15,078 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:15,078 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969975228]
[2024-02-28 21:39:15,078 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969975228] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:15,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 21:39:15,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 21:39:15,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573110129]
[2024-02-28 21:39:15,078 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:15,079 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 21:39:15,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:15,079 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 21:39:15,079 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 21:39:15,103 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 133
[2024-02-28 21:39:15,104 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 157 transitions, 500 flow. Second operand  has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:15,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:15,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 133
[2024-02-28 21:39:15,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:15,223 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][37], [112#L685-2true, Black: 145#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, 162#true, threadThread2of2ForFork0InUse, 16#L697-1true, Black: 164#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 168#true, Black: 151#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 48#L682-3true, Black: 137#true])
[2024-02-28 21:39:15,224 INFO  L294   olderBase$Statistics]: this new event has 111 ancestors and is cut-off event
[2024-02-28 21:39:15,224 INFO  L297   olderBase$Statistics]:   existing Event has 108 ancestors and is cut-off event
[2024-02-28 21:39:15,224 INFO  L297   olderBase$Statistics]:   existing Event has 108 ancestors and is cut-off event
[2024-02-28 21:39:15,224 INFO  L297   olderBase$Statistics]:   existing Event has 111 ancestors and is cut-off event
[2024-02-28 21:39:15,369 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][37], [112#L685-2true, Black: 145#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, 61#L684-3true, 162#true, threadThread2of2ForFork0InUse, 16#L697-1true, Black: 164#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 168#true, Black: 151#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 137#true])
[2024-02-28 21:39:15,370 INFO  L294   olderBase$Statistics]: this new event has 121 ancestors and is cut-off event
[2024-02-28 21:39:15,370 INFO  L297   olderBase$Statistics]:   existing Event has 121 ancestors and is cut-off event
[2024-02-28 21:39:15,370 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-02-28 21:39:15,370 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-02-28 21:39:15,468 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][130], [Black: 145#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, 162#true, 16#L697-1true, Black: 164#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 168#true, 53#L685-2true, Black: 151#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 82#L685-7true, Black: 137#true])
[2024-02-28 21:39:15,468 INFO  L294   olderBase$Statistics]: this new event has 129 ancestors and is cut-off event
[2024-02-28 21:39:15,468 INFO  L297   olderBase$Statistics]:   existing Event has 129 ancestors and is cut-off event
[2024-02-28 21:39:15,468 INFO  L297   olderBase$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-02-28 21:39:15,468 INFO  L297   olderBase$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-02-28 21:39:15,517 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][37], [Black: 145#(= |#race~data~0| 0), 162#true, threadThread1of2ForFork0InUse, Black: 164#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 16#L697-1true, threadThread2of2ForFork0InUse, 78#L686true, 168#true, Black: 151#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 53#L685-2true, Black: 137#true])
[2024-02-28 21:39:15,518 INFO  L294   olderBase$Statistics]: this new event has 131 ancestors and is cut-off event
[2024-02-28 21:39:15,518 INFO  L297   olderBase$Statistics]:   existing Event has 128 ancestors and is cut-off event
[2024-02-28 21:39:15,518 INFO  L297   olderBase$Statistics]:   existing Event has 128 ancestors and is cut-off event
[2024-02-28 21:39:15,518 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-02-28 21:39:15,585 INFO  L124   PetriNetUnfolderBase]: 1583/6367 cut-off events.
[2024-02-28 21:39:15,585 INFO  L125   PetriNetUnfolderBase]: For 3308/3731 co-relation queries the response was YES.
[2024-02-28 21:39:15,596 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12437 conditions, 6367 events. 1583/6367 cut-off events. For 3308/3731 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 67081 event pairs, 514 based on Foata normal form. 46/5559 useless extension candidates. Maximal degree in co-relation 10316. Up to 1833 conditions per place. 
[2024-02-28 21:39:15,612 INFO  L140   encePairwiseOnDemand]: 124/133 looper letters, 31 selfloop transitions, 19 changer transitions 0/175 dead transitions.
[2024-02-28 21:39:15,612 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 175 transitions, 685 flow
[2024-02-28 21:39:15,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 21:39:15,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 21:39:15,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions.
[2024-02-28 21:39:15,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9197994987468672
[2024-02-28 21:39:15,614 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 367 transitions.
[2024-02-28 21:39:15,614 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions.
[2024-02-28 21:39:15,614 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:15,614 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions.
[2024-02-28 21:39:15,615 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:15,616 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:15,616 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:15,616 INFO  L175             Difference]: Start difference. First operand has 142 places, 157 transitions, 500 flow. Second operand 3 states and 367 transitions.
[2024-02-28 21:39:15,616 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 175 transitions, 685 flow
[2024-02-28 21:39:15,618 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 175 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:39:15,619 INFO  L231             Difference]: Finished difference. Result has 144 places, 172 transitions, 668 flow
[2024-02-28 21:39:15,620 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=144, PETRI_TRANSITIONS=172}
[2024-02-28 21:39:15,620 INFO  L281   CegarLoopForPetriNet]: 134 programPoint places, 10 predicate places.
[2024-02-28 21:39:15,620 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 172 transitions, 668 flow
[2024-02-28 21:39:15,620 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:15,620 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:15,620 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:15,620 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-02-28 21:39:15,621 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:39:15,621 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:15,621 INFO  L85        PathProgramCache]: Analyzing trace with hash 1211345238, now seen corresponding path program 1 times
[2024-02-28 21:39:15,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:15,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763764506]
[2024-02-28 21:39:15,621 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:15,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:15,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:15,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:15,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:39:15,689 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763764506]
[2024-02-28 21:39:15,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763764506] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 21:39:15,689 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140265107]
[2024-02-28 21:39:15,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:15,689 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:39:15,689 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:39:15,692 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-02-28 21:39:15,706 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-02-28 21:39:15,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:39:15,792 INFO  L262         TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-28 21:39:15,794 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 21:39:15,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:39:15,934 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 21:39:15,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140265107] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 21:39:15,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 21:39:15,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7
[2024-02-28 21:39:15,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284048342]
[2024-02-28 21:39:15,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 21:39:15,935 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 21:39:15,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:39:15,936 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 21:39:15,936 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-02-28 21:39:15,962 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 133
[2024-02-28 21:39:15,963 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 172 transitions, 668 flow. Second operand  has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:15,963 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:39:15,963 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 133
[2024-02-28 21:39:15,963 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:39:16,549 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][136], [Black: 145#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, Black: 164#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 16#L697-1true, 53#L685-2true, Black: 151#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 168#true, 82#L685-7true, Black: 170#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 174#true, Black: 137#true])
[2024-02-28 21:39:16,549 INFO  L294   olderBase$Statistics]: this new event has 129 ancestors and is cut-off event
[2024-02-28 21:39:16,549 INFO  L297   olderBase$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-02-28 21:39:16,549 INFO  L297   olderBase$Statistics]:   existing Event has 129 ancestors and is cut-off event
[2024-02-28 21:39:16,549 INFO  L297   olderBase$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-02-28 21:39:16,551 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][136], [Black: 145#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, 16#L697-1true, threadThread2of2ForFork0InUse, Black: 164#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 53#L685-2true, 168#true, Black: 151#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 82#L685-7true, Black: 170#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 137#true, 178#(<= 1 ~threads_alive~0)])
[2024-02-28 21:39:16,551 INFO  L294   olderBase$Statistics]: this new event has 129 ancestors and is cut-off event
[2024-02-28 21:39:16,551 INFO  L297   olderBase$Statistics]:   existing Event has 129 ancestors and is cut-off event
[2024-02-28 21:39:16,551 INFO  L297   olderBase$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-02-28 21:39:16,551 INFO  L297   olderBase$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2024-02-28 21:39:16,642 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][37], [Black: 145#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, Black: 164#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 78#L686true, 16#L697-1true, threadThread2of2ForFork0InUse, 168#true, Black: 151#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 170#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 174#true, 68#L685-1true, Black: 137#true])
[2024-02-28 21:39:16,642 INFO  L294   olderBase$Statistics]: this new event has 130 ancestors and is cut-off event
[2024-02-28 21:39:16,642 INFO  L297   olderBase$Statistics]:   existing Event has 130 ancestors and is cut-off event
[2024-02-28 21:39:16,642 INFO  L297   olderBase$Statistics]:   existing Event has 127 ancestors and is cut-off event
[2024-02-28 21:39:16,642 INFO  L297   olderBase$Statistics]:   existing Event has 130 ancestors and is cut-off event
[2024-02-28 21:39:16,644 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][37], [Black: 145#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, Black: 164#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 16#L697-1true, 78#L686true, threadThread2of2ForFork0InUse, Black: 151#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 168#true, 53#L685-2true, Black: 170#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 174#true, Black: 137#true])
[2024-02-28 21:39:16,644 INFO  L294   olderBase$Statistics]: this new event has 131 ancestors and is cut-off event
[2024-02-28 21:39:16,645 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-02-28 21:39:16,645 INFO  L297   olderBase$Statistics]:   existing Event has 128 ancestors and is cut-off event
[2024-02-28 21:39:16,645 INFO  L297   olderBase$Statistics]:   existing Event has 128 ancestors and is cut-off event
[2024-02-28 21:39:16,689 INFO  L292   olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][37], [Black: 145#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, Black: 164#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 78#L686true, 16#L697-1true, threadThread2of2ForFork0InUse, 168#true, Black: 151#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 53#L685-2true, Black: 170#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 174#true, Black: 137#true])
[2024-02-28 21:39:16,689 INFO  L294   olderBase$Statistics]: this new event has 131 ancestors and is cut-off event
[2024-02-28 21:39:16,689 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-02-28 21:39:16,689 INFO  L297   olderBase$Statistics]:   existing Event has 128 ancestors and is cut-off event
[2024-02-28 21:39:16,689 INFO  L297   olderBase$Statistics]:   existing Event has 128 ancestors and is cut-off event
[2024-02-28 21:39:16,689 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-02-28 21:39:16,691 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([333] L697-4-->L697-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][37], [Black: 145#(= |#race~data~0| 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 16#L697-1true, Black: 164#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 78#L686true, Black: 151#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 168#true, 53#L685-2true, Black: 170#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 137#true, 178#(<= 1 ~threads_alive~0)])
[2024-02-28 21:39:16,691 INFO  L294   olderBase$Statistics]: this new event has 131 ancestors and is cut-off event
[2024-02-28 21:39:16,691 INFO  L297   olderBase$Statistics]:   existing Event has 128 ancestors and is cut-off event
[2024-02-28 21:39:16,691 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-02-28 21:39:16,691 INFO  L297   olderBase$Statistics]:   existing Event has 128 ancestors and is cut-off event
[2024-02-28 21:39:16,869 INFO  L124   PetriNetUnfolderBase]: 2633/9874 cut-off events.
[2024-02-28 21:39:16,870 INFO  L125   PetriNetUnfolderBase]: For 7242/8225 co-relation queries the response was YES.
[2024-02-28 21:39:16,893 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21191 conditions, 9874 events. 2633/9874 cut-off events. For 7242/8225 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 113963 event pairs, 393 based on Foata normal form. 104/8795 useless extension candidates. Maximal degree in co-relation 16886. Up to 2221 conditions per place. 
[2024-02-28 21:39:16,924 INFO  L140   encePairwiseOnDemand]: 125/133 looper letters, 36 selfloop transitions, 14 changer transitions 2/207 dead transitions.
[2024-02-28 21:39:16,924 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 207 transitions, 843 flow
[2024-02-28 21:39:16,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 21:39:16,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 21:39:16,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions.
[2024-02-28 21:39:16,926 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9140708915145005
[2024-02-28 21:39:16,926 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 851 transitions.
[2024-02-28 21:39:16,926 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions.
[2024-02-28 21:39:16,927 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:39:16,927 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions.
[2024-02-28 21:39:16,929 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:16,930 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:16,930 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:16,930 INFO  L175             Difference]: Start difference. First operand has 144 places, 172 transitions, 668 flow. Second operand 7 states and 851 transitions.
[2024-02-28 21:39:16,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 207 transitions, 843 flow
[2024-02-28 21:39:16,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 207 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 21:39:16,964 INFO  L231             Difference]: Finished difference. Result has 151 places, 185 transitions, 709 flow
[2024-02-28 21:39:16,964 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=709, PETRI_PLACES=151, PETRI_TRANSITIONS=185}
[2024-02-28 21:39:16,965 INFO  L281   CegarLoopForPetriNet]: 134 programPoint places, 17 predicate places.
[2024-02-28 21:39:16,965 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 185 transitions, 709 flow
[2024-02-28 21:39:16,965 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:39:16,965 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:39:16,965 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:16,974 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-02-28 21:39:17,166 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:39:17,166 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 21:39:17,167 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:39:17,168 INFO  L85        PathProgramCache]: Analyzing trace with hash -1288997615, now seen corresponding path program 1 times
[2024-02-28 21:39:17,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:39:17,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40621960]
[2024-02-28 21:39:17,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:39:17,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:39:17,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:39:17,189 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 21:39:17,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 21:39:17,202 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 21:39:17,202 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 21:39:17,203 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining)
[2024-02-28 21:39:17,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2024-02-28 21:39:17,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2024-02-28 21:39:17,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2024-02-28 21:39:17,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2024-02-28 21:39:17,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2024-02-28 21:39:17,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining)
[2024-02-28 21:39:17,203 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2024-02-28 21:39:17,204 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2024-02-28 21:39:17,204 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2024-02-28 21:39:17,204 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2024-02-28 21:39:17,204 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2024-02-28 21:39:17,204 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2024-02-28 21:39:17,204 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2024-02-28 21:39:17,204 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2024-02-28 21:39:17,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-02-28 21:39:17,204 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:39:17,208 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2024-02-28 21:39:17,208 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-02-28 21:39:17,237 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
[2024-02-28 21:39:17,238 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated
[2024-02-28 21:39:17,239 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:39:17,239 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:39:17,239 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,239 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated
[2024-02-28 21:39:17,239 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,239 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated
[2024-02-28 21:39:17,240 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,240 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,240 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,240 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post8 could not be translated
[2024-02-28 21:39:17,241 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post8 could not be translated
[2024-02-28 21:39:17,241 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated
[2024-02-28 21:39:17,247 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 09:39:17 BasicIcfg
[2024-02-28 21:39:17,247 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-02-28 21:39:17,248 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-02-28 21:39:17,248 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-02-28 21:39:17,248 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-02-28 21:39:17,248 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 09:39:11" (3/4) ...
[2024-02-28 21:39:17,249 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-02-28 21:39:17,250 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-02-28 21:39:17,250 INFO  L158              Benchmark]: Toolchain (without parser) took 6611.23ms. Allocated memory was 107.0MB in the beginning and 864.0MB in the end (delta: 757.1MB). Free memory was 70.0MB in the beginning and 425.8MB in the end (delta: -355.7MB). Peak memory consumption was 404.2MB. Max. memory is 16.1GB.
[2024-02-28 21:39:17,251 INFO  L158              Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 81.9MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-02-28 21:39:17,251 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 329.93ms. Allocated memory is still 107.0MB. Free memory was 69.7MB in the beginning and 50.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-02-28 21:39:17,251 INFO  L158              Benchmark]: Boogie Procedure Inliner took 31.01ms. Allocated memory is still 107.0MB. Free memory was 50.4MB in the beginning and 48.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-02-28 21:39:17,251 INFO  L158              Benchmark]: Boogie Preprocessor took 19.85ms. Allocated memory is still 107.0MB. Free memory was 48.4MB in the beginning and 46.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-02-28 21:39:17,252 INFO  L158              Benchmark]: RCFGBuilder took 367.71ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 46.7MB in the beginning and 96.7MB in the end (delta: -50.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-02-28 21:39:17,252 INFO  L158              Benchmark]: TraceAbstraction took 5854.86ms. Allocated memory was 134.2MB in the beginning and 864.0MB in the end (delta: 729.8MB). Free memory was 96.1MB in the beginning and 425.8MB in the end (delta: -329.7MB). Peak memory consumption was 402.1MB. Max. memory is 16.1GB.
[2024-02-28 21:39:17,252 INFO  L158              Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 864.0MB. Free memory is still 425.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-02-28 21:39:17,253 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.17ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 81.9MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 329.93ms. Allocated memory is still 107.0MB. Free memory was 69.7MB in the beginning and 50.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 31.01ms. Allocated memory is still 107.0MB. Free memory was 50.4MB in the beginning and 48.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 19.85ms. Allocated memory is still 107.0MB. Free memory was 48.4MB in the beginning and 46.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 367.71ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 46.7MB in the beginning and 96.7MB in the end (delta: -50.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 5854.86ms. Allocated memory was 134.2MB in the beginning and 864.0MB in the end (delta: 729.8MB). Free memory was 96.1MB in the beginning and 425.8MB in the end (delta: -329.7MB). Peak memory consumption was 402.1MB. Max. memory is 16.1GB.
 * Witness Printer took 2.39ms. Allocated memory is still 864.0MB. Free memory is still 425.8MB. 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~nondet6 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre10 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~mem12 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~mem12 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: IdentifierExpression #t~post8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~post8 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~nondet9 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: 685]: Data race detected
[2024-02-28 21:39:17,269 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
[2024-02-28 21:39:17,269 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated
[2024-02-28 21:39:17,269 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:39:17,270 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:39:17,270 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,270 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated
[2024-02-28 21:39:17,270 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,270 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated
[2024-02-28 21:39:17,270 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,271 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,271 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,271 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post8 could not be translated
[2024-02-28 21:39:17,271 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post8 could not be translated
[2024-02-28 21:39:17,271 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated
[2024-02-28 21:39:17,282 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated
[2024-02-28 21:39:17,283 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated
[2024-02-28 21:39:17,283 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated
[2024-02-28 21:39:17,283 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated
[2024-02-28 21:39:17,283 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,284 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated
[2024-02-28 21:39:17,284 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,284 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem12 could not be translated
[2024-02-28 21:39:17,284 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,284 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,284 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated
[2024-02-28 21:39:17,284 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post8 could not be translated
[2024-02-28 21:39:17,285 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post8 could not be translated
[2024-02-28 21:39:17,285 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated
    Data race detected
The following path leads to a data race: 
[L678]               0  int threads_alive = 0;
        VAL             [threads_alive=0]
[L679]               0  int data = 0;
        VAL             [data=0, threads_alive=0]
[L680]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
        VAL             [data=0, data_mutex={1:0}, threads_alive=0]
[L689]               0  int threads_total = __VERIFIER_nondet_int();
        VAL             [data=0, data_mutex={1:0}, threads_alive=0, threads_total=2]
[L690]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L675]  COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, cond=1, data=0, data_mutex={1:0}, threads_alive=0]
[L690]  RET          0  assume_abort_if_not(threads_total >= 0)
[L691]               0  int i = 0;
        VAL             [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2]
[L691]  COND TRUE    0  i < threads_total
        VAL             [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2]
[L692]               0  threads_alive++
        VAL             [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2]
[L693]               0  pthread_t tid;
        VAL             [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid={5:0}]
[L694]  FCALL, FORK  0  pthread_create(&tid, ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid={5:0}]
[L683]               1  data = __VERIFIER_nondet_int()
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1]
[L695]  EXPR         0  \read(tid)
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid={5:0}]
[L695]               0  pthread_detach(tid)
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid={5:0}]
[L691]               0  i++
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2, tid={5:0}]
[L691]  COND TRUE    0  i < threads_total
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2]
[L692]               0  threads_alive++
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2]
[L685]               1  threads_alive--
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2]
[L692]               0  threads_alive++
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2]
[L685]               1  threads_alive--
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2]

Now there is a data race on ~threads_alive~0 between 
	C: threads_alive++ [692]
and
	C: threads_alive-- [685]

  - UnprovableResult [Line: 692]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 697]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 698]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 692]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 695]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 694]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 683]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 685]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 130 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 197 IncrementalHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 10 mSDtfsCounter, 197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=426occurred in iteration=6, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 158 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 399 IncrementalHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 37 mSDtfsCounter, 399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=709occurred in iteration=7, InterpolantAutomatonStates: 28, 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.5s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 378 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 2 NumberOfNonLiveVariables, 161 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 1/2 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-02-28 21:39:17,296 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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