./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 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/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-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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.2-dev-2329fc7
[2023-10-25 15:26:25,828 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:26:25,834 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:26:25,899 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:26:25,899 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:26:25,902 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:26:25,903 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:26:25,906 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:26:25,907 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:26:25,912 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:26:25,913 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:26:25,914 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:26:25,915 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:26:25,918 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:26:25,919 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:26:25,920 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:26:25,929 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:26:25,929 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:26:25,930 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:26:25,935 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:26:25,937 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:26:25,938 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:26:25,939 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:26:25,940 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:26:25,958 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:26:25,958 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:26:25,959 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:26:25,961 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:26:25,961 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:26:25,962 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:26:25,962 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:26:25,963 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:26:25,964 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:26:25,965 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:26:25,965 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:26:25,965 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:26:25,966 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:26:25,966 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:26:25,966 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:26:25,967 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:26:25,968 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:26:25,968 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 15:26:26,014 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:26:26,015 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:26:26,015 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:26:26,015 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:26:26,016 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:26:26,016 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:26:26,016 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:26:26,017 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:26:26,017 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:26:26,017 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:26:26,018 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:26:26,018 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:26:26,018 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:26:26,018 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:26:26,018 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:26:26,018 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:26:26,019 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:26:26,019 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:26:26,019 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:26:26,019 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:26:26,019 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:26:26,019 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:26:26,020 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:26:26,020 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:26:26,020 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:26:26,020 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:26:26,020 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:26:26,020 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:26:26,021 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:26:26,021 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:26:26,021 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:26:26,021 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:26:26,022 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:26:26,022 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:26:26,022 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:26:26,022 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:26:26,023 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:26:26,023 INFO  L138        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-pldi/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-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
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
[2023-10-25 15:26:26,378 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:26:26,408 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:26:26,410 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:26:26,426 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:26:26,426 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:26:26,427 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race.i
[2023-10-25 15:26:28,103 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:26:28,457 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:26:28,464 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race.i
[2023-10-25 15:26:28,480 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/685854057/7c889d67175d4442b3ce88e03038c18e/FLAG033f50cf1
[2023-10-25 15:26:28,519 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/685854057/7c889d67175d4442b3ce88e03038c18e
[2023-10-25 15:26:28,521 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:26:28,522 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:26:28,523 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:26:28,523 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:26:28,525 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:26:28,525 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:26:28" (1/1) ...
[2023-10-25 15:26:28,526 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34344bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:28, skipping insertion in model container
[2023-10-25 15:26:28,526 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:26:28" (1/1) ...
[2023-10-25 15:26:28,531 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:26:28,606 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:26:29,063 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-10-25 15:26:29,066 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:26:29,091 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:26:29,151 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-10-25 15:26:29,173 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:26:29,210 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:26:29,211 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29 WrapperNode
[2023-10-25 15:26:29,211 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:26:29,226 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:26:29,226 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:26:29,226 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:26:29,232 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,269 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,294 INFO  L138                Inliner]: procedures = 159, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67
[2023-10-25 15:26:29,294 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:26:29,295 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:26:29,295 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:26:29,295 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:26:29,302 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,308 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,310 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,310 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,314 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,336 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,348 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,349 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,351 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:26:29,355 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:26:29,355 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:26:29,355 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:26:29,356 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (1/1) ...
[2023-10-25 15:26:29,361 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:26:29,388 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:26:29,403 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-25 15:26:29,433 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-25 15:26:29,439 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:26:29,439 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:26:29,439 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-25 15:26:29,440 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-25 15:26:29,440 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 15:26:29,440 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:26:29,440 INFO  L130     BoogieDeclarations]: Found specification of procedure pthread_detach
[2023-10-25 15:26:29,440 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-25 15:26:29,440 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:26:29,440 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:26:29,440 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:26:29,441 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:26:29,442 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 15:26:29,644 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:26:29,645 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:26:29,952 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:26:29,957 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:26:29,965 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:26:29,967 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:26:29 BoogieIcfgContainer
[2023-10-25 15:26:29,967 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:26:29,969 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:26:29,969 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:26:29,971 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:26:29,975 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:26:28" (1/3) ...
[2023-10-25 15:26:29,977 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0bd420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:26:29, skipping insertion in model container
[2023-10-25 15:26:29,977 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:29" (2/3) ...
[2023-10-25 15:26:29,978 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0bd420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:26:29, skipping insertion in model container
[2023-10-25 15:26:29,978 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:26:29" (3/3) ...
[2023-10-25 15:26:29,979 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race.i
[2023-10-25 15:26:29,986 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:26:30,003 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:26:30,003 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-10-25 15:26:30,008 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:26:30,119 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-25 15:26:30,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 104 places, 105 transitions, 215 flow
[2023-10-25 15:26:30,287 INFO  L130       PetriNetUnfolder]: 7/136 cut-off events.
[2023-10-25 15:26:30,287 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:30,303 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 141 conditions, 136 events. 7/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 164 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 74. Up to 6 conditions per place. 
[2023-10-25 15:26:30,303 INFO  L82        GeneralOperation]: Start removeDead. Operand has 104 places, 105 transitions, 215 flow
[2023-10-25 15:26:30,310 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 104 places, 105 transitions, 215 flow
[2023-10-25 15:26:30,313 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:26:30,324 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 105 transitions, 215 flow
[2023-10-25 15:26:30,339 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 105 transitions, 215 flow
[2023-10-25 15:26:30,339 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 104 places, 105 transitions, 215 flow
[2023-10-25 15:26:30,410 INFO  L130       PetriNetUnfolder]: 7/136 cut-off events.
[2023-10-25 15:26:30,425 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:30,426 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 141 conditions, 136 events. 7/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 164 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 74. Up to 6 conditions per place. 
[2023-10-25 15:26:30,428 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2500
[2023-10-25 15:26:33,012 INFO  L134        LiptonReduction]: Checked pairs total: 7962
[2023-10-25 15:26:33,013 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-10-25 15:26:33,045 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:26:33,053 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=LoopsAndPotentialCycles, 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;@cf3a163, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:26:33,053 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-10-25 15:26:33,055 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-10-25 15:26:33,055 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:33,055 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:33,056 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-25 15:26:33,056 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)] ===
[2023-10-25 15:26:33,060 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:33,060 INFO  L85        PathProgramCache]: Analyzing trace with hash 360721, now seen corresponding path program 1 times
[2023-10-25 15:26:33,082 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:33,083 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495778428]
[2023-10-25 15:26:33,083 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:33,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:33,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:33,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:33,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:33,386 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495778428]
[2023-10-25 15:26:33,386 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495778428] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:33,386 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:33,387 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:33,388 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694172121]
[2023-10-25 15:26:33,388 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:33,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:33,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:33,438 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:33,439 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:33,483 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 183
[2023-10-25 15:26:33,487 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 77 flow. Second operand  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:33,487 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:33,487 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 183
[2023-10-25 15:26:33,488 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:33,605 INFO  L130       PetriNetUnfolder]: 72/260 cut-off events.
[2023-10-25 15:26:33,605 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:33,607 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 439 conditions, 260 events. 72/260 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1241 event pairs, 25 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 398. Up to 97 conditions per place. 
[2023-10-25 15:26:33,612 INFO  L137   encePairwiseOnDemand]: 170/183 looper letters, 27 selfloop transitions, 8 changer transitions 0/49 dead transitions.
[2023-10-25 15:26:33,612 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 173 flow
[2023-10-25 15:26:33,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:33,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:33,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions.
[2023-10-25 15:26:33,643 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5683060109289617
[2023-10-25 15:26:33,644 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 312 transitions.
[2023-10-25 15:26:33,644 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions.
[2023-10-25 15:26:33,648 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:33,650 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions.
[2023-10-25 15:26:33,661 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:33,666 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:33,681 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:33,683 INFO  L175             Difference]: Start difference. First operand has 37 places, 36 transitions, 77 flow. Second operand 3 states and 312 transitions.
[2023-10-25 15:26:33,684 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 173 flow
[2023-10-25 15:26:33,686 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:26:33,688 INFO  L231             Difference]: Finished difference. Result has 40 places, 42 transitions, 143 flow
[2023-10-25 15:26:33,690 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=40, PETRI_TRANSITIONS=42}
[2023-10-25 15:26:33,692 INFO  L288   CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places.
[2023-10-25 15:26:33,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 143 flow
[2023-10-25 15:26:33,693 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:33,693 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:33,693 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:33,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:26:33,695 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-25 15:26:33,696 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:33,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -1868668675, now seen corresponding path program 1 times
[2023-10-25 15:26:33,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:33,698 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391738328]
[2023-10-25 15:26:33,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:33,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:33,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:33,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:33,797 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:33,797 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391738328]
[2023-10-25 15:26:33,797 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391738328] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:33,798 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:33,798 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:33,798 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719154686]
[2023-10-25 15:26:33,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:33,799 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:33,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:33,800 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:33,801 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:33,846 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 183
[2023-10-25 15:26:33,847 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 143 flow. Second operand  has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:33,847 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:33,847 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 183
[2023-10-25 15:26:33,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:33,916 INFO  L130       PetriNetUnfolder]: 57/229 cut-off events.
[2023-10-25 15:26:33,916 INFO  L131       PetriNetUnfolder]: For 100/102 co-relation queries the response was YES.
[2023-10-25 15:26:33,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 489 conditions, 229 events. 57/229 cut-off events. For 100/102 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1086 event pairs, 31 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 440. Up to 114 conditions per place. 
[2023-10-25 15:26:33,936 INFO  L137   encePairwiseOnDemand]: 178/183 looper letters, 21 selfloop transitions, 6 changer transitions 0/49 dead transitions.
[2023-10-25 15:26:33,936 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 221 flow
[2023-10-25 15:26:33,936 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:33,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:33,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions.
[2023-10-25 15:26:33,938 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5373406193078324
[2023-10-25 15:26:33,938 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 295 transitions.
[2023-10-25 15:26:33,938 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions.
[2023-10-25 15:26:33,939 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:33,939 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions.
[2023-10-25 15:26:33,939 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:33,942 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:33,942 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:33,942 INFO  L175             Difference]: Start difference. First operand has 40 places, 42 transitions, 143 flow. Second operand 3 states and 295 transitions.
[2023-10-25 15:26:33,942 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 221 flow
[2023-10-25 15:26:33,945 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:33,946 INFO  L231             Difference]: Finished difference. Result has 41 places, 46 transitions, 169 flow
[2023-10-25 15:26:33,946 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=41, PETRI_TRANSITIONS=46}
[2023-10-25 15:26:33,947 INFO  L288   CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places.
[2023-10-25 15:26:33,947 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 46 transitions, 169 flow
[2023-10-25 15:26:33,947 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:33,947 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:33,947 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:33,947 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:26:33,948 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-25 15:26:33,948 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:33,948 INFO  L85        PathProgramCache]: Analyzing trace with hash -1597045873, now seen corresponding path program 1 times
[2023-10-25 15:26:33,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:33,949 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3433350]
[2023-10-25 15:26:33,949 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:33,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:33,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:34,013 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:34,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:34,029 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3433350]
[2023-10-25 15:26:34,030 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3433350] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:34,030 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:34,030 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:34,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519661404]
[2023-10-25 15:26:34,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:34,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:34,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:34,032 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:34,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:34,042 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 183
[2023-10-25 15:26:34,043 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 46 transitions, 169 flow. Second operand  has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:34,043 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:34,043 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 183
[2023-10-25 15:26:34,044 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:34,115 INFO  L130       PetriNetUnfolder]: 81/287 cut-off events.
[2023-10-25 15:26:34,122 INFO  L131       PetriNetUnfolder]: For 143/147 co-relation queries the response was YES.
[2023-10-25 15:26:34,123 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 637 conditions, 287 events. 81/287 cut-off events. For 143/147 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1469 event pairs, 33 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 588. Up to 131 conditions per place. 
[2023-10-25 15:26:34,124 INFO  L137   encePairwiseOnDemand]: 179/183 looper letters, 29 selfloop transitions, 3 changer transitions 1/54 dead transitions.
[2023-10-25 15:26:34,124 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 257 flow
[2023-10-25 15:26:34,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:34,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:34,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions.
[2023-10-25 15:26:34,126 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5774134790528234
[2023-10-25 15:26:34,126 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 317 transitions.
[2023-10-25 15:26:34,126 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions.
[2023-10-25 15:26:34,126 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:34,126 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions.
[2023-10-25 15:26:34,127 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:34,128 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:34,128 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:34,128 INFO  L175             Difference]: Start difference. First operand has 41 places, 46 transitions, 169 flow. Second operand 3 states and 317 transitions.
[2023-10-25 15:26:34,129 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 257 flow
[2023-10-25 15:26:34,130 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:26:34,143 INFO  L231             Difference]: Finished difference. Result has 44 places, 48 transitions, 185 flow
[2023-10-25 15:26:34,143 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=44, PETRI_TRANSITIONS=48}
[2023-10-25 15:26:34,144 INFO  L288   CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places.
[2023-10-25 15:26:34,144 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 48 transitions, 185 flow
[2023-10-25 15:26:34,145 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:34,145 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:34,145 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:34,145 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:26:34,145 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-25 15:26:34,146 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:34,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 1846542559, now seen corresponding path program 1 times
[2023-10-25 15:26:34,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:34,146 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997978497]
[2023-10-25 15:26:34,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:34,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:34,176 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:34,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:34,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:34,233 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997978497]
[2023-10-25 15:26:34,234 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997978497] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:34,234 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:34,234 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:34,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586751723]
[2023-10-25 15:26:34,235 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:34,235 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:34,235 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:34,236 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:34,236 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:34,246 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 183
[2023-10-25 15:26:34,246 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 48 transitions, 185 flow. Second operand  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:34,247 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:34,247 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 183
[2023-10-25 15:26:34,247 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:34,312 INFO  L130       PetriNetUnfolder]: 73/269 cut-off events.
[2023-10-25 15:26:34,314 INFO  L131       PetriNetUnfolder]: For 135/142 co-relation queries the response was YES.
[2023-10-25 15:26:34,315 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 628 conditions, 269 events. 73/269 cut-off events. For 135/142 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1394 event pairs, 32 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 577. Up to 130 conditions per place. 
[2023-10-25 15:26:34,315 INFO  L137   encePairwiseOnDemand]: 178/183 looper letters, 27 selfloop transitions, 7 changer transitions 0/57 dead transitions.
[2023-10-25 15:26:34,316 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 285 flow
[2023-10-25 15:26:34,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:34,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:34,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions.
[2023-10-25 15:26:34,334 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5664845173041895
[2023-10-25 15:26:34,334 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 311 transitions.
[2023-10-25 15:26:34,334 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions.
[2023-10-25 15:26:34,337 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:34,337 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions.
[2023-10-25 15:26:34,338 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:34,339 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:34,340 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:34,340 INFO  L175             Difference]: Start difference. First operand has 44 places, 48 transitions, 185 flow. Second operand 3 states and 311 transitions.
[2023-10-25 15:26:34,340 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 285 flow
[2023-10-25 15:26:34,343 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:34,344 INFO  L231             Difference]: Finished difference. Result has 46 places, 51 transitions, 225 flow
[2023-10-25 15:26:34,344 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=46, PETRI_TRANSITIONS=51}
[2023-10-25 15:26:34,346 INFO  L288   CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places.
[2023-10-25 15:26:34,346 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 51 transitions, 225 flow
[2023-10-25 15:26:34,346 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:34,346 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:34,346 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:26:34,346 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:26:34,347 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-25 15:26:34,347 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:34,347 INFO  L85        PathProgramCache]: Analyzing trace with hash 1058997609, now seen corresponding path program 1 times
[2023-10-25 15:26:34,347 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:34,347 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621956830]
[2023-10-25 15:26:34,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:34,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:34,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:34,396 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:26:34,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:34,464 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:26:34,465 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:26:34,466 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2023-10-25 15:26:34,467 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2023-10-25 15:26:34,468 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2023-10-25 15:26:34,481 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2023-10-25 15:26:34,482 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2023-10-25 15:26:34,482 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2023-10-25 15:26:34,482 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2023-10-25 15:26:34,482 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2023-10-25 15:26:34,483 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2023-10-25 15:26:34,483 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2023-10-25 15:26:34,483 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2023-10-25 15:26:34,483 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2023-10-25 15:26:34,484 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 15:26:34,484 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-10-25 15:26:34,488 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:26:34,488 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:26:34,516 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-25 15:26:34,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 132 places, 131 transitions, 274 flow
[2023-10-25 15:26:34,563 INFO  L130       PetriNetUnfolder]: 10/211 cut-off events.
[2023-10-25 15:26:34,564 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-25 15:26:34,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 10/211 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 278 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 137. Up to 9 conditions per place. 
[2023-10-25 15:26:34,565 INFO  L82        GeneralOperation]: Start removeDead. Operand has 132 places, 131 transitions, 274 flow
[2023-10-25 15:26:34,566 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 132 places, 131 transitions, 274 flow
[2023-10-25 15:26:34,581 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:26:34,581 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 131 transitions, 274 flow
[2023-10-25 15:26:34,582 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 131 transitions, 274 flow
[2023-10-25 15:26:34,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 132 places, 131 transitions, 274 flow
[2023-10-25 15:26:34,599 INFO  L130       PetriNetUnfolder]: 10/211 cut-off events.
[2023-10-25 15:26:34,599 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-25 15:26:34,599 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 10/211 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 278 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 137. Up to 9 conditions per place. 
[2023-10-25 15:26:34,602 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6300
[2023-10-25 15:26:37,327 INFO  L134        LiptonReduction]: Checked pairs total: 24128
[2023-10-25 15:26:37,328 INFO  L136        LiptonReduction]: Total number of compositions: 87
[2023-10-25 15:26:37,330 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:26:37,333 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=LoopsAndPotentialCycles, 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;@cf3a163, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:26:37,334 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-10-25 15:26:37,335 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-10-25 15:26:37,335 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:37,335 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:37,336 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-25 15:26:37,336 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)] ===
[2023-10-25 15:26:37,338 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:37,338 INFO  L85        PathProgramCache]: Analyzing trace with hash 602978, now seen corresponding path program 1 times
[2023-10-25 15:26:37,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:37,338 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462262091]
[2023-10-25 15:26:37,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:37,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:37,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:37,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:37,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:37,374 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462262091]
[2023-10-25 15:26:37,375 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462262091] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:37,375 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:37,375 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:37,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110292457]
[2023-10-25 15:26:37,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:37,375 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:37,375 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:37,376 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:37,376 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:37,414 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 218
[2023-10-25 15:26:37,415 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 120 flow. Second operand  has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:37,415 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:37,415 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 218
[2023-10-25 15:26:37,415 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:38,176 INFO  L130       PetriNetUnfolder]: 2566/5288 cut-off events.
[2023-10-25 15:26:38,176 INFO  L131       PetriNetUnfolder]: For 63/63 co-relation queries the response was YES.
[2023-10-25 15:26:38,188 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9572 conditions, 5288 events. 2566/5288 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 40200 event pairs, 1044 based on Foata normal form. 0/4801 useless extension candidates. Maximal degree in co-relation 4153. Up to 2335 conditions per place. 
[2023-10-25 15:26:38,222 INFO  L137   encePairwiseOnDemand]: 201/218 looper letters, 49 selfloop transitions, 11 changer transitions 0/79 dead transitions.
[2023-10-25 15:26:38,222 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 295 flow
[2023-10-25 15:26:38,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:38,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:38,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions.
[2023-10-25 15:26:38,224 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6131498470948012
[2023-10-25 15:26:38,224 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 401 transitions.
[2023-10-25 15:26:38,224 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions.
[2023-10-25 15:26:38,224 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:38,225 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions.
[2023-10-25 15:26:38,225 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:38,237 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:38,238 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:38,238 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 120 flow. Second operand 3 states and 401 transitions.
[2023-10-25 15:26:38,238 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 295 flow
[2023-10-25 15:26:38,239 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 293 flow, removed 1 selfloop flow, removed 0 redundant places.
[2023-10-25 15:26:38,240 INFO  L231             Difference]: Finished difference. Result has 60 places, 63 transitions, 210 flow
[2023-10-25 15:26:38,241 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=60, PETRI_TRANSITIONS=63}
[2023-10-25 15:26:38,243 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places.
[2023-10-25 15:26:38,243 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 210 flow
[2023-10-25 15:26:38,245 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:38,245 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:38,245 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:38,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 15:26:38,245 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:38,246 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:38,246 INFO  L85        PathProgramCache]: Analyzing trace with hash -1471106384, now seen corresponding path program 1 times
[2023-10-25 15:26:38,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:38,246 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602790830]
[2023-10-25 15:26:38,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:38,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:38,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:38,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:38,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:38,288 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602790830]
[2023-10-25 15:26:38,288 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602790830] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:38,288 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:38,288 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:38,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125646819]
[2023-10-25 15:26:38,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:38,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:38,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:38,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:38,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:38,334 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 218
[2023-10-25 15:26:38,335 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 210 flow. Second operand  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:38,335 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:38,335 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 218
[2023-10-25 15:26:38,335 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:38,572 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L697-3-->L697: 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][12], [112#L685-2true, threadThread1of2ForFork0InUse, 141#true, threadThread2of2ForFork0InUse, 29#L683-2true, 137#(= |#race~threads_alive~0| 0), 31#L697true, Black: 135#true])
[2023-10-25 15:26:38,572 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-25 15:26:38,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-25 15:26:38,573 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2023-10-25 15:26:38,573 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2023-10-25 15:26:38,573 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L697-3-->L697: 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][12], [112#L685-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 141#true, 137#(= |#race~threads_alive~0| 0), 31#L697true, 103#L682-1true, Black: 135#true])
[2023-10-25 15:26:38,573 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-10-25 15:26:38,573 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2023-10-25 15:26:38,573 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-25 15:26:38,573 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2023-10-25 15:26:38,588 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L697-3-->L697: 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][12], [112#L685-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 141#true, 32#L683-4true, 137#(= |#race~threads_alive~0| 0), 31#L697true, Black: 135#true])
[2023-10-25 15:26:38,689 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-25 15:26:38,689 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-25 15:26:38,689 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-25 15:26:38,689 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-25 15:26:38,704 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L697-3-->L697: 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][12], [112#L685-2true, threadThread1of2ForFork0InUse, 141#true, threadThread2of2ForFork0InUse, 44#L684true, 137#(= |#race~threads_alive~0| 0), 31#L697true, Black: 135#true])
[2023-10-25 15:26:38,704 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-25 15:26:38,704 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-25 15:26:38,704 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-25 15:26:38,704 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-25 15:26:39,030 INFO  L130       PetriNetUnfolder]: 2100/4555 cut-off events.
[2023-10-25 15:26:39,045 INFO  L131       PetriNetUnfolder]: For 2315/2399 co-relation queries the response was YES.
[2023-10-25 15:26:39,050 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10309 conditions, 4555 events. 2100/4555 cut-off events. For 2315/2399 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 35646 event pairs, 1329 based on Foata normal form. 0/4168 useless extension candidates. Maximal degree in co-relation 3797. Up to 2913 conditions per place. 
[2023-10-25 15:26:39,074 INFO  L137   encePairwiseOnDemand]: 211/218 looper letters, 42 selfloop transitions, 11 changer transitions 0/83 dead transitions.
[2023-10-25 15:26:39,075 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 380 flow
[2023-10-25 15:26:39,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:39,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:39,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions.
[2023-10-25 15:26:39,078 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5886850152905199
[2023-10-25 15:26:39,078 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 385 transitions.
[2023-10-25 15:26:39,078 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions.
[2023-10-25 15:26:39,079 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:39,079 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions.
[2023-10-25 15:26:39,089 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:39,106 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:39,107 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:39,107 INFO  L175             Difference]: Start difference. First operand has 60 places, 63 transitions, 210 flow. Second operand 3 states and 385 transitions.
[2023-10-25 15:26:39,107 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 380 flow
[2023-10-25 15:26:39,113 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:39,114 INFO  L231             Difference]: Finished difference. Result has 61 places, 72 transitions, 275 flow
[2023-10-25 15:26:39,115 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=61, PETRI_TRANSITIONS=72}
[2023-10-25 15:26:39,116 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places.
[2023-10-25 15:26:39,116 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 72 transitions, 275 flow
[2023-10-25 15:26:39,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:39,117 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:39,117 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:39,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-25 15:26:39,117 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:39,117 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:39,118 INFO  L85        PathProgramCache]: Analyzing trace with hash -1256742814, now seen corresponding path program 1 times
[2023-10-25 15:26:39,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:39,118 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428202283]
[2023-10-25 15:26:39,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:39,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:39,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:39,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:39,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:39,150 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428202283]
[2023-10-25 15:26:39,150 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428202283] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:39,150 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:39,150 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:39,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592483177]
[2023-10-25 15:26:39,151 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:39,151 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:39,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:39,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:39,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:39,161 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 218
[2023-10-25 15:26:39,162 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 72 transitions, 275 flow. Second operand  has 3 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)
[2023-10-25 15:26:39,163 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:39,163 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 218
[2023-10-25 15:26:39,163 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:39,979 INFO  L130       PetriNetUnfolder]: 2469/5615 cut-off events.
[2023-10-25 15:26:39,997 INFO  L131       PetriNetUnfolder]: For 2596/2883 co-relation queries the response was YES.
[2023-10-25 15:26:40,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12204 conditions, 5615 events. 2469/5615 cut-off events. For 2596/2883 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 47754 event pairs, 1292 based on Foata normal form. 3/5093 useless extension candidates. Maximal degree in co-relation 7605. Up to 2656 conditions per place. 
[2023-10-25 15:26:40,052 INFO  L137   encePairwiseOnDemand]: 213/218 looper letters, 43 selfloop transitions, 4 changer transitions 0/88 dead transitions.
[2023-10-25 15:26:40,056 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 409 flow
[2023-10-25 15:26:40,056 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:40,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:40,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions.
[2023-10-25 15:26:40,058 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.617737003058104
[2023-10-25 15:26:40,058 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 404 transitions.
[2023-10-25 15:26:40,058 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions.
[2023-10-25 15:26:40,058 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:40,058 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions.
[2023-10-25 15:26:40,059 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:40,060 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:40,081 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:40,082 INFO  L175             Difference]: Start difference. First operand has 61 places, 72 transitions, 275 flow. Second operand 3 states and 404 transitions.
[2023-10-25 15:26:40,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 409 flow
[2023-10-25 15:26:40,094 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:26:40,096 INFO  L231             Difference]: Finished difference. Result has 64 places, 75 transitions, 294 flow
[2023-10-25 15:26:40,096 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=64, PETRI_TRANSITIONS=75}
[2023-10-25 15:26:40,110 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places.
[2023-10-25 15:26:40,111 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 75 transitions, 294 flow
[2023-10-25 15:26:40,111 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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)
[2023-10-25 15:26:40,111 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:40,111 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:40,111 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 15:26:40,112 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:40,112 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:40,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -351598344, now seen corresponding path program 1 times
[2023-10-25 15:26:40,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:40,112 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969246915]
[2023-10-25 15:26:40,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:40,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:40,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:40,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:40,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:40,156 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969246915]
[2023-10-25 15:26:40,156 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969246915] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:40,156 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:40,156 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:40,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938984846]
[2023-10-25 15:26:40,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:40,157 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:40,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:40,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:40,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:40,171 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 218
[2023-10-25 15:26:40,171 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 75 transitions, 294 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:40,171 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:40,171 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 218
[2023-10-25 15:26:40,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:40,988 INFO  L130       PetriNetUnfolder]: 2578/5961 cut-off events.
[2023-10-25 15:26:41,001 INFO  L131       PetriNetUnfolder]: For 2985/3329 co-relation queries the response was YES.
[2023-10-25 15:26:41,008 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13557 conditions, 5961 events. 2578/5961 cut-off events. For 2985/3329 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 52815 event pairs, 1452 based on Foata normal form. 2/5367 useless extension candidates. Maximal degree in co-relation 9075. Up to 3044 conditions per place. 
[2023-10-25 15:26:41,036 INFO  L137   encePairwiseOnDemand]: 212/218 looper letters, 48 selfloop transitions, 7 changer transitions 0/98 dead transitions.
[2023-10-25 15:26:41,036 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 497 flow
[2023-10-25 15:26:41,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:41,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:41,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions.
[2023-10-25 15:26:41,048 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6085626911314985
[2023-10-25 15:26:41,048 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 398 transitions.
[2023-10-25 15:26:41,048 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions.
[2023-10-25 15:26:41,049 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:41,058 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions.
[2023-10-25 15:26:41,059 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:41,060 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:41,060 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:41,061 INFO  L175             Difference]: Start difference. First operand has 64 places, 75 transitions, 294 flow. Second operand 3 states and 398 transitions.
[2023-10-25 15:26:41,061 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 497 flow
[2023-10-25 15:26:41,068 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:41,084 INFO  L231             Difference]: Finished difference. Result has 66 places, 80 transitions, 342 flow
[2023-10-25 15:26:41,084 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=66, PETRI_TRANSITIONS=80}
[2023-10-25 15:26:41,085 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2023-10-25 15:26:41,086 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 80 transitions, 342 flow
[2023-10-25 15:26:41,086 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:41,086 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:41,086 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:41,086 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-25 15:26:41,086 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:41,087 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:41,087 INFO  L85        PathProgramCache]: Analyzing trace with hash 1777019964, now seen corresponding path program 1 times
[2023-10-25 15:26:41,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:41,087 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397790283]
[2023-10-25 15:26:41,087 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:41,087 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:41,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:41,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:41,213 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:41,213 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397790283]
[2023-10-25 15:26:41,213 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397790283] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:26:41,213 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907963838]
[2023-10-25 15:26:41,214 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:41,214 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:26:41,214 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:26:41,231 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:26:41,273 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-25 15:26:41,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:41,358 INFO  L263         TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:26:41,360 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:26:41,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:41,497 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 15:26:41,497 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [907963838] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:41,497 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-25 15:26:41,497 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2023-10-25 15:26:41,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763418066]
[2023-10-25 15:26:41,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:41,509 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-25 15:26:41,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:41,510 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-25 15:26:41,510 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-10-25 15:26:41,533 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 218
[2023-10-25 15:26:41,534 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 80 transitions, 342 flow. Second operand  has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:41,534 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:41,534 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 218
[2023-10-25 15:26:41,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:42,759 INFO  L130       PetriNetUnfolder]: 3724/7922 cut-off events.
[2023-10-25 15:26:42,765 INFO  L131       PetriNetUnfolder]: For 3774/4383 co-relation queries the response was YES.
[2023-10-25 15:26:42,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19221 conditions, 7922 events. 3724/7922 cut-off events. For 3774/4383 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 67676 event pairs, 976 based on Foata normal form. 139/7457 useless extension candidates. Maximal degree in co-relation 9271. Up to 2409 conditions per place. 
[2023-10-25 15:26:42,836 INFO  L137   encePairwiseOnDemand]: 210/218 looper letters, 110 selfloop transitions, 16 changer transitions 3/172 dead transitions.
[2023-10-25 15:26:42,848 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 172 transitions, 931 flow
[2023-10-25 15:26:42,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 15:26:42,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 15:26:42,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 917 transitions.
[2023-10-25 15:26:42,863 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6009174311926605
[2023-10-25 15:26:42,864 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 917 transitions.
[2023-10-25 15:26:42,864 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 917 transitions.
[2023-10-25 15:26:42,864 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:42,864 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 917 transitions.
[2023-10-25 15:26:42,866 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:42,868 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:42,882 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:42,882 INFO  L175             Difference]: Start difference. First operand has 66 places, 80 transitions, 342 flow. Second operand 7 states and 917 transitions.
[2023-10-25 15:26:42,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 172 transitions, 931 flow
[2023-10-25 15:26:42,886 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 172 transitions, 901 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:42,887 INFO  L231             Difference]: Finished difference. Result has 73 places, 95 transitions, 426 flow
[2023-10-25 15:26:42,888 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=73, PETRI_TRANSITIONS=95}
[2023-10-25 15:26:42,888 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places.
[2023-10-25 15:26:42,889 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 95 transitions, 426 flow
[2023-10-25 15:26:42,889 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:42,889 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:42,889 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:42,897 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-25 15:26:43,094 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-10-25 15:26:43,094 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:43,094 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:43,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 1155071363, now seen corresponding path program 1 times
[2023-10-25 15:26:43,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:43,094 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770318003]
[2023-10-25 15:26:43,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:43,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:43,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:43,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:43,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:43,140 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770318003]
[2023-10-25 15:26:43,140 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770318003] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:43,140 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:43,141 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:43,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978979441]
[2023-10-25 15:26:43,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:43,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:43,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:43,142 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:43,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:43,169 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 115 out of 218
[2023-10-25 15:26:43,169 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 95 transitions, 426 flow. Second operand  has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:43,169 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:43,170 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 218
[2023-10-25 15:26:43,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:43,501 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L697-3-->L697: 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][22], [Black: 220#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 0 ~threads_alive~0)), Black: 166#(<= 0 ~threads_alive~0), Black: 176#(<= 0 |ULTIMATE.start_main_#t~post7#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 162#(<= 1 ~threads_alive~0), Black: 135#true, Black: 143#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 112#L685-2true, 227#true, Black: 148#(= |#race~data~0| 0), 31#L697true, 103#L682-1true, Black: 154#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)])
[2023-10-25 15:26:43,517 INFO  L383   tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event
[2023-10-25 15:26:43,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2023-10-25 15:26:43,518 INFO  L386   tUnfolder$Statistics]:   existing Event has 29 ancestors and is cut-off event
[2023-10-25 15:26:43,518 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-25 15:26:43,518 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L697-3-->L697: 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][22], [Black: 220#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 0 ~threads_alive~0)), Black: 166#(<= 0 ~threads_alive~0), Black: 176#(<= 0 |ULTIMATE.start_main_#t~post7#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 162#(<= 1 ~threads_alive~0), 29#L683-2true, Black: 135#true, Black: 143#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 112#L685-2true, 227#true, Black: 148#(= |#race~data~0| 0), 31#L697true, Black: 154#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)])
[2023-10-25 15:26:43,518 INFO  L383   tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event
[2023-10-25 15:26:43,518 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2023-10-25 15:26:43,518 INFO  L386   tUnfolder$Statistics]:   existing Event has 33 ancestors and is cut-off event
[2023-10-25 15:26:43,518 INFO  L386   tUnfolder$Statistics]:   existing Event has 30 ancestors and is cut-off event
[2023-10-25 15:26:43,520 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L697-3-->L697: 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][22], [Black: 220#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 0 ~threads_alive~0)), Black: 166#(<= 0 ~threads_alive~0), Black: 176#(<= 0 |ULTIMATE.start_main_#t~post7#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 162#(<= 1 ~threads_alive~0), 32#L683-4true, Black: 135#true, Black: 143#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 112#L685-2true, 227#true, Black: 148#(= |#race~data~0| 0), 31#L697true, Black: 154#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)])
[2023-10-25 15:26:43,520 INFO  L383   tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event
[2023-10-25 15:26:43,520 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-25 15:26:43,520 INFO  L386   tUnfolder$Statistics]:   existing Event has 34 ancestors and is cut-off event
[2023-10-25 15:26:43,520 INFO  L386   tUnfolder$Statistics]:   existing Event has 31 ancestors and is cut-off event
[2023-10-25 15:26:43,564 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([385] L697-3-->L697: 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][22], [Black: 220#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 0 ~threads_alive~0)), Black: 166#(<= 0 ~threads_alive~0), Black: 176#(<= 0 |ULTIMATE.start_main_#t~post7#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 44#L684true, 162#(<= 1 ~threads_alive~0), Black: 135#true, Black: 143#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 112#L685-2true, 227#true, Black: 148#(= |#race~data~0| 0), 31#L697true, Black: 154#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)])
[2023-10-25 15:26:43,564 INFO  L383   tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event
[2023-10-25 15:26:43,564 INFO  L386   tUnfolder$Statistics]:   existing Event has 35 ancestors and is cut-off event
[2023-10-25 15:26:43,564 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-25 15:26:43,564 INFO  L386   tUnfolder$Statistics]:   existing Event has 32 ancestors and is cut-off event
[2023-10-25 15:26:44,335 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L698-1-->ULTIMATE.startEXIT: Formula: (and (= |v_ULTIMATE.start_main_#res#1_24| v_~data~0_38) (= |v_ULTIMATE.start_main_#res#1_24| |v_ULTIMATE.start_#t~ret13#1_12|))  InVars {~data~0=v_~data~0_38}  OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_12|, ~data~0=v_~data~0_38}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#res#1, ULTIMATE.start_#t~ret13#1][81], [Black: 220#(and (<= 0 |ULTIMATE.start_main_#t~post7#1|) (<= 0 ~threads_alive~0)), Black: 176#(<= 0 |ULTIMATE.start_main_#t~post7#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 2#ULTIMATE.startEXITtrue, 3#threadEXITtrue, 166#(<= 0 ~threads_alive~0), Black: 135#true, Black: 143#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 227#true, Black: 146#true, Black: 154#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 68#L685-1true])
[2023-10-25 15:26:44,336 INFO  L383   tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event
[2023-10-25 15:26:44,336 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-10-25 15:26:44,336 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-10-25 15:26:44,336 INFO  L386   tUnfolder$Statistics]:   existing Event has 43 ancestors and is cut-off event
[2023-10-25 15:26:44,522 INFO  L130       PetriNetUnfolder]: 4048/8545 cut-off events.
[2023-10-25 15:26:44,530 INFO  L131       PetriNetUnfolder]: For 7119/7971 co-relation queries the response was YES.
[2023-10-25 15:26:44,544 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22925 conditions, 8545 events. 4048/8545 cut-off events. For 7119/7971 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 73782 event pairs, 1772 based on Foata normal form. 202/7937 useless extension candidates. Maximal degree in co-relation 19406. Up to 5504 conditions per place. 
[2023-10-25 15:26:44,595 INFO  L137   encePairwiseOnDemand]: 210/218 looper letters, 63 selfloop transitions, 15 changer transitions 0/119 dead transitions.
[2023-10-25 15:26:44,605 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 688 flow
[2023-10-25 15:26:44,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:44,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:44,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions.
[2023-10-25 15:26:44,607 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5932721712538226
[2023-10-25 15:26:44,608 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 388 transitions.
[2023-10-25 15:26:44,608 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions.
[2023-10-25 15:26:44,608 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:44,608 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions.
[2023-10-25 15:26:44,625 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:44,627 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:44,627 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:44,627 INFO  L175             Difference]: Start difference. First operand has 73 places, 95 transitions, 426 flow. Second operand 3 states and 388 transitions.
[2023-10-25 15:26:44,627 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 688 flow
[2023-10-25 15:26:44,634 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 119 transitions, 688 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:26:44,636 INFO  L231             Difference]: Finished difference. Result has 76 places, 106 transitions, 549 flow
[2023-10-25 15:26:44,636 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=76, PETRI_TRANSITIONS=106}
[2023-10-25 15:26:44,637 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places.
[2023-10-25 15:26:44,637 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 106 transitions, 549 flow
[2023-10-25 15:26:44,638 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:44,639 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:44,639 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:44,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 15:26:44,639 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:44,639 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:44,639 INFO  L85        PathProgramCache]: Analyzing trace with hash 304011890, now seen corresponding path program 1 times
[2023-10-25 15:26:44,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:44,640 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146976859]
[2023-10-25 15:26:44,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:44,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:44,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:44,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-25 15:26:44,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:44,699 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146976859]
[2023-10-25 15:26:44,699 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146976859] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:44,700 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:44,700 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:44,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911885814]
[2023-10-25 15:26:44,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:44,700 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:44,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:44,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:44,701 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:44,717 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 218
[2023-10-25 15:26:44,718 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 106 transitions, 549 flow. Second operand  has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:44,733 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:44,733 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 218
[2023-10-25 15:26:44,733 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:45,931 INFO  L130       PetriNetUnfolder]: 3785/8061 cut-off events.
[2023-10-25 15:26:45,932 INFO  L131       PetriNetUnfolder]: For 11791/13468 co-relation queries the response was YES.
[2023-10-25 15:26:45,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24408 conditions, 8061 events. 3785/8061 cut-off events. For 11791/13468 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 70650 event pairs, 1521 based on Foata normal form. 289/7508 useless extension candidates. Maximal degree in co-relation 20393. Up to 4685 conditions per place. 
[2023-10-25 15:26:46,015 INFO  L137   encePairwiseOnDemand]: 213/218 looper letters, 73 selfloop transitions, 6 changer transitions 0/134 dead transitions.
[2023-10-25 15:26:46,015 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 134 transitions, 852 flow
[2023-10-25 15:26:46,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:46,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:46,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions.
[2023-10-25 15:26:46,017 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6070336391437309
[2023-10-25 15:26:46,017 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 397 transitions.
[2023-10-25 15:26:46,017 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions.
[2023-10-25 15:26:46,017 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:46,017 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions.
[2023-10-25 15:26:46,018 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:46,033 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:46,034 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:46,034 INFO  L175             Difference]: Start difference. First operand has 76 places, 106 transitions, 549 flow. Second operand 3 states and 397 transitions.
[2023-10-25 15:26:46,034 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 134 transitions, 852 flow
[2023-10-25 15:26:46,045 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 134 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:26:46,046 INFO  L231             Difference]: Finished difference. Result has 78 places, 109 transitions, 574 flow
[2023-10-25 15:26:46,047 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=78, PETRI_TRANSITIONS=109}
[2023-10-25 15:26:46,047 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 21 predicate places.
[2023-10-25 15:26:46,047 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 109 transitions, 574 flow
[2023-10-25 15:26:46,048 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:46,048 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:46,048 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:46,048 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-25 15:26:46,048 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:46,049 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:46,049 INFO  L85        PathProgramCache]: Analyzing trace with hash 1820031444, now seen corresponding path program 1 times
[2023-10-25 15:26:46,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:46,049 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645049776]
[2023-10-25 15:26:46,049 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:46,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:46,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:46,086 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:26:46,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:46,106 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:26:46,107 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:26:46,107 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining)
[2023-10-25 15:26:46,107 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2023-10-25 15:26:46,108 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2023-10-25 15:26:46,108 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2023-10-25 15:26:46,108 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2023-10-25 15:26:46,108 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2023-10-25 15:26:46,108 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining)
[2023-10-25 15:26:46,108 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2023-10-25 15:26:46,109 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2023-10-25 15:26:46,109 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2023-10-25 15:26:46,109 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2023-10-25 15:26:46,109 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2023-10-25 15:26:46,109 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2023-10-25 15:26:46,109 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2023-10-25 15:26:46,110 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2023-10-25 15:26:46,110 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-25 15:26:46,110 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:46,124 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2023-10-25 15:26:46,124 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-10-25 15:26:46,203 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 03:26:46 BasicIcfg
[2023-10-25 15:26:46,204 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-10-25 15:26:46,204 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-10-25 15:26:46,204 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-10-25 15:26:46,204 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-10-25 15:26:46,205 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:26:29" (3/4) ...
[2023-10-25 15:26:46,207 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-10-25 15:26:46,207 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-10-25 15:26:46,208 INFO  L158              Benchmark]: Toolchain (without parser) took 17686.05ms. Allocated memory was 44.9MB in the beginning and 171.2MB in the end (delta: 126.3MB). Free memory was 14.7MB in the beginning and 69.3MB in the end (delta: -54.5MB). Peak memory consumption was 71.8MB. Max. memory is 15.6GB.
[2023-10-25 15:26:46,208 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 40.8MB. Free memory is still 15.2MB. There was no memory consumed. Max. memory is 15.6GB.
[2023-10-25 15:26:46,208 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 702.55ms. Allocated memory is still 44.9MB. Free memory was 14.5MB in the beginning and 18.1MB in the end (delta: -3.6MB). Peak memory consumption was 3.7MB. Max. memory is 15.6GB.
[2023-10-25 15:26:46,209 INFO  L158              Benchmark]: Boogie Procedure Inliner took 68.54ms. Allocated memory is still 44.9MB. Free memory was 17.9MB in the beginning and 15.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.0MB. Max. memory is 15.6GB.
[2023-10-25 15:26:46,211 INFO  L158              Benchmark]: Boogie Preprocessor took 59.48ms. Allocated memory is still 44.9MB. Free memory was 15.9MB in the beginning and 14.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.5MB. Max. memory is 15.6GB.
[2023-10-25 15:26:46,211 INFO  L158              Benchmark]: RCFGBuilder took 612.56ms. Allocated memory is still 44.9MB. Free memory was 14.4MB in the beginning and 13.1MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 15.6GB.
[2023-10-25 15:26:46,212 INFO  L158              Benchmark]: TraceAbstraction took 16234.94ms. Allocated memory was 44.9MB in the beginning and 171.2MB in the end (delta: 126.3MB). Free memory was 12.3MB in the beginning and 69.3MB in the end (delta: -56.9MB). Peak memory consumption was 69.4MB. Max. memory is 15.6GB.
[2023-10-25 15:26:46,212 INFO  L158              Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 171.2MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 15.6GB.
[2023-10-25 15:26:46,221 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14ms. Allocated memory is still 40.8MB. Free memory is still 15.2MB. There was no memory consumed. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 702.55ms. Allocated memory is still 44.9MB. Free memory was 14.5MB in the beginning and 18.1MB in the end (delta: -3.6MB). Peak memory consumption was 3.7MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 68.54ms. Allocated memory is still 44.9MB. Free memory was 17.9MB in the beginning and 15.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.0MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 59.48ms. Allocated memory is still 44.9MB. Free memory was 15.9MB in the beginning and 14.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.5MB. Max. memory is 15.6GB.
 * RCFGBuilder took 612.56ms. Allocated memory is still 44.9MB. Free memory was 14.4MB in the beginning and 13.1MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 15.6GB.
 * TraceAbstraction took 16234.94ms. Allocated memory was 44.9MB in the beginning and 171.2MB in the end (delta: 126.3MB). Free memory was 12.3MB in the beginning and 69.3MB in the end (delta: -56.9MB). Peak memory consumption was 69.4MB. Max. memory is 15.6GB.
 * Witness Printer took 3.42ms. Allocated memory is still 171.2MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.7s, 104 PlacesBefore, 37 PlacesAfterwards, 105 TransitionsBefore, 36 TransitionsAfterwards, 2500 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 7962 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3934, independent: 3606, independent conditional: 0, independent unconditional: 3606, dependent: 328, dependent conditional: 0, dependent unconditional: 328, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1262, independent: 1205, independent conditional: 0, independent unconditional: 1205, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3934, independent: 2401, independent conditional: 0, independent unconditional: 2401, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 1262, unknown conditional: 0, unknown unconditional: 1262] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.7s, 132 PlacesBefore, 57 PlacesAfterwards, 131 TransitionsBefore, 54 TransitionsAfterwards, 6300 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, 24128 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7085, independent: 6561, independent conditional: 0, independent unconditional: 6561, dependent: 524, dependent conditional: 0, dependent unconditional: 524, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2845, independent: 2765, independent conditional: 0, independent unconditional: 2765, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7085, independent: 3796, independent conditional: 0, independent unconditional: 3796, dependent: 444, dependent conditional: 0, dependent unconditional: 444, unknown: 2845, unknown conditional: 0, unknown unconditional: 2845] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 320, Positive conditional cache size: 0, Positive unconditional cache size: 320, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 685]: Data race detected
    Data race detected
The following path leads to a data race: 
[L678]               0  int threads_alive = 0;
[L679]               0  int data = 0;
[L680]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L689]               0  int threads_total = __VERIFIER_nondet_int();
[L690]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L675]  COND FALSE   0  !(!cond)
[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
[L692]               0  threads_alive++
[L693]               0  pthread_t tid;
[L694]  FCALL, FORK  0  pthread_create(&tid, ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=0, pthread_create(&tid, ((void *)0), &thread, ((void *)0))=0, threads_alive=1, threads_total=2, tid={5:0}]
[L695]  EXPR         0  \read(tid)
[L695]               0  pthread_detach(tid)
[L691]               0  i++
[L691]  COND TRUE    0  i < threads_total
[L692]               0  threads_alive++
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2]
[L683]               1  data = __VERIFIER_nondet_int()
[L685]               1  threads_alive--
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1]
[L692]               0  threads_alive++
        VAL             [arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_alive++=27, threads_alive++=1, 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, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 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, 128 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: 4.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 5 mSDtfsCounter, 193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=4, InterpolantAutomatonStates: 12, 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.3s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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, 154 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: 11.6s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 657 IncrementalHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 21 mSDtfsCounter, 657 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=7, InterpolantAutomatonStates: 25, 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, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 163 SizeOfPredicates, 2 NumberOfNonLiveVariables, 124 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 8/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-10-25 15:26:46,300 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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