./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-3.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-3.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 4652f4da866d77155a362f7e0d43c417fde934bdeb6599c1ba8014f5bc2bf248
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 15:26:01,349 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:26:01,354 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:26:01,408 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:26:01,414 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:26:01,416 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:26:01,417 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:26:01,437 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:26:01,439 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:26:01,443 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:26:01,444 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:26:01,445 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:26:01,446 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:26:01,448 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:26:01,449 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:26:01,450 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:26:01,451 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:26:01,453 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:26:01,453 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:26:01,458 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:26:01,459 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:26:01,461 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:26:01,463 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:26:01,463 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:26:01,465 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:26:01,481 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:26:01,481 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:26:01,483 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:26:01,483 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:26:01,485 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:26:01,485 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:26:01,486 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:26:01,487 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:26:01,488 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:26:01,488 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:26:01,489 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:26:01,489 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:26:01,489 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:26:01,489 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:26:01,490 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:26:01,491 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:26:01,491 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:01,534 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:26:01,534 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:26:01,534 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:26:01,535 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:26:01,535 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:26:01,535 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:26:01,536 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:26:01,536 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:26:01,536 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:26:01,536 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:26:01,537 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:26:01,537 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:26:01,537 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:26:01,538 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:26:01,538 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:26:01,538 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:26:01,538 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:26:01,538 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:26:01,538 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:26:01,539 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:26:01,539 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:26:01,539 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:26:01,539 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:26:01,539 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:26:01,539 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:26:01,540 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:26:01,540 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:26:01,540 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:26:01,540 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:26:01,540 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:26:01,540 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:26:01,541 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:26:01,541 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:26:01,542 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:26:01,542 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:26:01,542 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:26:01,542 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:26:01,542 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 -> 4652f4da866d77155a362f7e0d43c417fde934bdeb6599c1ba8014f5bc2bf248
[2023-10-25 15:26:01,900 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:26:01,939 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:26:01,941 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:26:01,942 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:26:01,942 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:26:01,943 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-3.i
[2023-10-25 15:26:03,634 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:26:03,980 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:26:03,984 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-3.i
[2023-10-25 15:26:03,997 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/f1b4ace97/78fa46fb61b344f78f463f1c15b6c460/FLAG80a0a323b
[2023-10-25 15:26:04,029 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/f1b4ace97/78fa46fb61b344f78f463f1c15b6c460
[2023-10-25 15:26:04,032 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:26:04,041 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:26:04,042 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:26:04,042 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:26:04,045 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:26:04,045 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:26:04" (1/1) ...
[2023-10-25 15:26:04,046 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfb3ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:04, skipping insertion in model container
[2023-10-25 15:26:04,046 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:26:04" (1/1) ...
[2023-10-25 15:26:04,051 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:26:04,111 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:26:04,559 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-10-25 15:26:04,565 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:26:04,593 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:26:04,665 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-10-25 15:26:04,672 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:26:04,735 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:26:04,735 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:04 WrapperNode
[2023-10-25 15:26:04,735 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:26:04,736 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:26:04,737 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:26:04,737 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:26:04,742 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:04" (1/1) ...
[2023-10-25 15:26:04,764 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:04" (1/1) ...
[2023-10-25 15:26:04,797 INFO  L138                Inliner]: procedures = 159, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95
[2023-10-25 15:26:04,797 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:26:04,801 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:26:04,801 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:26:04,801 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:26:04,810 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:04" (1/1) ...
[2023-10-25 15:26:04,810 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:04" (1/1) ...
[2023-10-25 15:26:04,826 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:04" (1/1) ...
[2023-10-25 15:26:04,827 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:04" (1/1) ...
[2023-10-25 15:26:04,839 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:04" (1/1) ...
[2023-10-25 15:26:04,845 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:04" (1/1) ...
[2023-10-25 15:26:04,847 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:04" (1/1) ...
[2023-10-25 15:26:04,859 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:04" (1/1) ...
[2023-10-25 15:26:04,861 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:26:04,862 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:26:04,867 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:26:04,867 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:26:04,868 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:04" (1/1) ...
[2023-10-25 15:26:04,873 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:26:04,904 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:26:04,942 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:05,000 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:05,024 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:26:05,037 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:26:05,037 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-25 15:26:05,037 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-25 15:26:05,038 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 15:26:05,038 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:26:05,038 INFO  L130     BoogieDeclarations]: Found specification of procedure pthread_detach
[2023-10-25 15:26:05,038 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-25 15:26:05,038 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:26:05,038 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:26:05,038 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:26:05,038 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:26:05,040 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:05,273 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:26:05,282 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:26:05,624 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:26:05,637 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:26:05,653 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:26:05,656 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:26:05 BoogieIcfgContainer
[2023-10-25 15:26:05,656 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:26:05,658 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:26:05,658 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:26:05,661 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:26:05,661 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:26:04" (1/3) ...
[2023-10-25 15:26:05,662 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3499810a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:26:05, skipping insertion in model container
[2023-10-25 15:26:05,662 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:04" (2/3) ...
[2023-10-25 15:26:05,663 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3499810a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:26:05, skipping insertion in model container
[2023-10-25 15:26:05,663 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:26:05" (3/3) ...
[2023-10-25 15:26:05,664 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-3.i
[2023-10-25 15:26:05,682 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:26:05,689 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:26:05,690 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-10-25 15:26:05,690 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:26:05,807 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-25 15:26:05,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 136 transitions, 277 flow
[2023-10-25 15:26:05,982 INFO  L130       PetriNetUnfolder]: 7/176 cut-off events.
[2023-10-25 15:26:06,000 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:06,005 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 176 events. 7/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 222 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. 
[2023-10-25 15:26:06,006 INFO  L82        GeneralOperation]: Start removeDead. Operand has 135 places, 136 transitions, 277 flow
[2023-10-25 15:26:06,021 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 135 places, 136 transitions, 277 flow
[2023-10-25 15:26:06,025 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:26:06,035 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 136 transitions, 277 flow
[2023-10-25 15:26:06,043 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 136 transitions, 277 flow
[2023-10-25 15:26:06,044 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 136 transitions, 277 flow
[2023-10-25 15:26:06,158 INFO  L130       PetriNetUnfolder]: 7/176 cut-off events.
[2023-10-25 15:26:06,158 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:06,159 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 176 events. 7/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 222 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. 
[2023-10-25 15:26:06,162 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3304
[2023-10-25 15:26:10,607 INFO  L134        LiptonReduction]: Checked pairs total: 13696
[2023-10-25 15:26:10,607 INFO  L136        LiptonReduction]: Total number of compositions: 99
[2023-10-25 15:26:10,654 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:26:10,661 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;@76ce54c1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:26:10,661 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-10-25 15:26:10,664 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-25 15:26:10,664 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:10,667 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:10,667 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:26:10,668 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:10,672 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:10,677 INFO  L85        PathProgramCache]: Analyzing trace with hash 13845965, now seen corresponding path program 1 times
[2023-10-25 15:26:10,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:10,699 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263209867]
[2023-10-25 15:26:10,699 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:10,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:10,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:11,025 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:11,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:11,026 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263209867]
[2023-10-25 15:26:11,027 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263209867] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:11,027 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:11,027 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:11,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258577876]
[2023-10-25 15:26:11,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:11,051 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:11,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:11,086 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:11,087 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:11,139 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 235
[2023-10-25 15:26:11,154 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 95 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:11,154 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:11,154 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 235
[2023-10-25 15:26:11,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:11,318 INFO  L130       PetriNetUnfolder]: 149/470 cut-off events.
[2023-10-25 15:26:11,322 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:11,331 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 814 conditions, 470 events. 149/470 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2466 event pairs, 54 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 762. Up to 184 conditions per place. 
[2023-10-25 15:26:11,335 INFO  L137   encePairwiseOnDemand]: 222/235 looper letters, 41 selfloop transitions, 8 changer transitions 0/65 dead transitions.
[2023-10-25 15:26:11,337 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 233 flow
[2023-10-25 15:26:11,342 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:11,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:11,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions.
[2023-10-25 15:26:11,358 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5943262411347517
[2023-10-25 15:26:11,359 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 419 transitions.
[2023-10-25 15:26:11,360 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions.
[2023-10-25 15:26:11,370 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:11,381 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions.
[2023-10-25 15:26:11,389 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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:11,411 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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:11,412 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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:11,414 INFO  L175             Difference]: Start difference. First operand has 46 places, 45 transitions, 95 flow. Second operand 3 states and 419 transitions.
[2023-10-25 15:26:11,414 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 233 flow
[2023-10-25 15:26:11,417 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 233 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:26:11,419 INFO  L231             Difference]: Finished difference. Result has 49 places, 51 transitions, 161 flow
[2023-10-25 15:26:11,420 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=49, PETRI_TRANSITIONS=51}
[2023-10-25 15:26:11,423 INFO  L288   CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places.
[2023-10-25 15:26:11,423 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 161 flow
[2023-10-25 15:26:11,424 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:11,424 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:11,424 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:11,425 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:26:11,425 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:11,426 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:11,426 INFO  L85        PathProgramCache]: Analyzing trace with hash 931135085, now seen corresponding path program 1 times
[2023-10-25 15:26:11,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:11,430 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312729784]
[2023-10-25 15:26:11,430 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:11,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:11,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:11,570 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:11,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:11,570 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312729784]
[2023-10-25 15:26:11,571 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312729784] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:11,571 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:11,571 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:11,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105519577]
[2023-10-25 15:26:11,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:11,573 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:11,573 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:11,574 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:11,574 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:11,618 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 235
[2023-10-25 15:26:11,620 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 161 flow. Second operand  has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:11,621 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:11,621 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 235
[2023-10-25 15:26:11,621 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:11,742 INFO  L130       PetriNetUnfolder]: 130/418 cut-off events.
[2023-10-25 15:26:11,743 INFO  L131       PetriNetUnfolder]: For 120/123 co-relation queries the response was YES.
[2023-10-25 15:26:11,743 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 874 conditions, 418 events. 130/418 cut-off events. For 120/123 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2169 event pairs, 74 based on Foata normal form. 2/381 useless extension candidates. Maximal degree in co-relation 814. Up to 241 conditions per place. 
[2023-10-25 15:26:11,764 INFO  L137   encePairwiseOnDemand]: 229/235 looper letters, 31 selfloop transitions, 7 changer transitions 0/62 dead transitions.
[2023-10-25 15:26:11,765 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 269 flow
[2023-10-25 15:26:11,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:11,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:11,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions.
[2023-10-25 15:26:11,766 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5659574468085107
[2023-10-25 15:26:11,766 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 399 transitions.
[2023-10-25 15:26:11,766 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions.
[2023-10-25 15:26:11,767 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:11,767 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions.
[2023-10-25 15:26:11,768 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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:11,770 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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:11,771 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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:11,771 INFO  L175             Difference]: Start difference. First operand has 49 places, 51 transitions, 161 flow. Second operand 3 states and 399 transitions.
[2023-10-25 15:26:11,771 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 269 flow
[2023-10-25 15:26:11,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:11,777 INFO  L231             Difference]: Finished difference. Result has 51 places, 56 transitions, 201 flow
[2023-10-25 15:26:11,777 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=56}
[2023-10-25 15:26:11,778 INFO  L288   CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places.
[2023-10-25 15:26:11,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 56 transitions, 201 flow
[2023-10-25 15:26:11,779 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:11,779 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:11,779 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:11,780 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:26:11,780 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:11,785 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:11,786 INFO  L85        PathProgramCache]: Analyzing trace with hash 1155383445, now seen corresponding path program 1 times
[2023-10-25 15:26:11,787 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:11,787 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974089554]
[2023-10-25 15:26:11,787 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:11,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:11,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:11,911 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:11,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:11,912 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974089554]
[2023-10-25 15:26:11,913 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974089554] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:11,913 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:11,913 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:11,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192570179]
[2023-10-25 15:26:11,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:11,914 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:11,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:11,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:11,916 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:11,924 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 235
[2023-10-25 15:26:11,925 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 56 transitions, 201 flow. Second operand  has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:11,925 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:11,925 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 235
[2023-10-25 15:26:11,926 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:12,024 INFO  L130       PetriNetUnfolder]: 113/398 cut-off events.
[2023-10-25 15:26:12,030 INFO  L131       PetriNetUnfolder]: For 132/141 co-relation queries the response was YES.
[2023-10-25 15:26:12,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 843 conditions, 398 events. 113/398 cut-off events. For 132/141 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2157 event pairs, 76 based on Foata normal form. 8/372 useless extension candidates. Maximal degree in co-relation 788. Up to 224 conditions per place. 
[2023-10-25 15:26:12,032 INFO  L137   encePairwiseOnDemand]: 232/235 looper letters, 25 selfloop transitions, 2 changer transitions 2/61 dead transitions.
[2023-10-25 15:26:12,032 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 271 flow
[2023-10-25 15:26:12,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:12,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:12,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions.
[2023-10-25 15:26:12,034 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5801418439716312
[2023-10-25 15:26:12,034 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 409 transitions.
[2023-10-25 15:26:12,034 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions.
[2023-10-25 15:26:12,034 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:12,034 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions.
[2023-10-25 15:26:12,035 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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:12,050 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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:12,051 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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:12,051 INFO  L175             Difference]: Start difference. First operand has 51 places, 56 transitions, 201 flow. Second operand 3 states and 409 transitions.
[2023-10-25 15:26:12,051 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 271 flow
[2023-10-25 15:26:12,055 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:12,056 INFO  L231             Difference]: Finished difference. Result has 52 places, 57 transitions, 199 flow
[2023-10-25 15:26:12,056 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=52, PETRI_TRANSITIONS=57}
[2023-10-25 15:26:12,058 INFO  L288   CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places.
[2023-10-25 15:26:12,060 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 199 flow
[2023-10-25 15:26:12,060 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:12,060 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:12,060 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:12,060 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:26:12,061 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:12,061 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:12,062 INFO  L85        PathProgramCache]: Analyzing trace with hash 1312887995, now seen corresponding path program 1 times
[2023-10-25 15:26:12,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:12,062 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924109288]
[2023-10-25 15:26:12,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:12,062 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:12,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:12,149 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:12,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:12,149 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924109288]
[2023-10-25 15:26:12,149 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924109288] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:12,149 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:12,154 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:12,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927680247]
[2023-10-25 15:26:12,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:12,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:12,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:12,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:12,172 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:12,183 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 235
[2023-10-25 15:26:12,184 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 199 flow. Second operand  has 3 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:12,184 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:12,184 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 235
[2023-10-25 15:26:12,184 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:12,274 INFO  L130       PetriNetUnfolder]: 113/389 cut-off events.
[2023-10-25 15:26:12,276 INFO  L131       PetriNetUnfolder]: For 97/108 co-relation queries the response was YES.
[2023-10-25 15:26:12,277 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 812 conditions, 389 events. 113/389 cut-off events. For 97/108 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2100 event pairs, 67 based on Foata normal form. 9/366 useless extension candidates. Maximal degree in co-relation 778. Up to 215 conditions per place. 
[2023-10-25 15:26:12,278 INFO  L137   encePairwiseOnDemand]: 231/235 looper letters, 34 selfloop transitions, 3 changer transitions 0/68 dead transitions.
[2023-10-25 15:26:12,278 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 303 flow
[2023-10-25 15:26:12,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:12,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:12,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions.
[2023-10-25 15:26:12,281 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5815602836879432
[2023-10-25 15:26:12,286 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 410 transitions.
[2023-10-25 15:26:12,286 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions.
[2023-10-25 15:26:12,289 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:12,289 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions.
[2023-10-25 15:26:12,290 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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:12,291 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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:12,292 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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:12,292 INFO  L175             Difference]: Start difference. First operand has 52 places, 57 transitions, 199 flow. Second operand 3 states and 410 transitions.
[2023-10-25 15:26:12,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 303 flow
[2023-10-25 15:26:12,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:26:12,294 INFO  L231             Difference]: Finished difference. Result has 54 places, 59 transitions, 216 flow
[2023-10-25 15:26:12,304 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=59}
[2023-10-25 15:26:12,306 INFO  L288   CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places.
[2023-10-25 15:26:12,306 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 59 transitions, 216 flow
[2023-10-25 15:26:12,306 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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:12,306 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:12,307 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:12,307 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:26:12,307 INFO  L420      AbstractCegarLoop]: === Iteration 5 === 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:12,307 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:12,307 INFO  L85        PathProgramCache]: Analyzing trace with hash -1323982407, now seen corresponding path program 1 times
[2023-10-25 15:26:12,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:12,308 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555223663]
[2023-10-25 15:26:12,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:12,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:12,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:12,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:26:12,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:12,432 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555223663]
[2023-10-25 15:26:12,432 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555223663] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:12,432 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:12,432 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:12,437 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165990593]
[2023-10-25 15:26:12,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:12,438 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:12,438 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:12,438 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:12,439 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:12,448 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 235
[2023-10-25 15:26:12,449 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 216 flow. Second operand  has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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:12,449 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:12,449 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 235
[2023-10-25 15:26:12,449 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:12,563 INFO  L130       PetriNetUnfolder]: 135/443 cut-off events.
[2023-10-25 15:26:12,563 INFO  L131       PetriNetUnfolder]: For 152/167 co-relation queries the response was YES.
[2023-10-25 15:26:12,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 987 conditions, 443 events. 135/443 cut-off events. For 152/167 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2452 event pairs, 63 based on Foata normal form. 9/416 useless extension candidates. Maximal degree in co-relation 934. Up to 224 conditions per place. 
[2023-10-25 15:26:12,565 INFO  L137   encePairwiseOnDemand]: 231/235 looper letters, 32 selfloop transitions, 4 changer transitions 2/68 dead transitions.
[2023-10-25 15:26:12,565 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 318 flow
[2023-10-25 15:26:12,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:12,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:12,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions.
[2023-10-25 15:26:12,567 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5886524822695035
[2023-10-25 15:26:12,567 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 415 transitions.
[2023-10-25 15:26:12,567 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions.
[2023-10-25 15:26:12,568 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:12,568 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions.
[2023-10-25 15:26:12,569 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 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:12,570 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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:12,570 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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:12,570 INFO  L175             Difference]: Start difference. First operand has 54 places, 59 transitions, 216 flow. Second operand 3 states and 415 transitions.
[2023-10-25 15:26:12,571 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 318 flow
[2023-10-25 15:26:12,581 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:26:12,583 INFO  L231             Difference]: Finished difference. Result has 57 places, 61 transitions, 241 flow
[2023-10-25 15:26:12,583 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=57, PETRI_TRANSITIONS=61}
[2023-10-25 15:26:12,585 INFO  L288   CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places.
[2023-10-25 15:26:12,585 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 241 flow
[2023-10-25 15:26:12,585 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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:12,585 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:12,585 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:26:12,585 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 15:26:12,586 INFO  L420      AbstractCegarLoop]: === Iteration 6 === 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:12,586 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:12,586 INFO  L85        PathProgramCache]: Analyzing trace with hash -1790975771, now seen corresponding path program 1 times
[2023-10-25 15:26:12,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:12,586 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739701340]
[2023-10-25 15:26:12,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:12,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:12,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:12,657 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:26:12,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:12,717 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:26:12,717 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:26:12,718 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2023-10-25 15:26:12,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2023-10-25 15:26:12,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2023-10-25 15:26:12,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2023-10-25 15:26:12,731 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2023-10-25 15:26:12,734 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2023-10-25 15:26:12,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2023-10-25 15:26:12,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2023-10-25 15:26:12,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2023-10-25 15:26:12,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2023-10-25 15:26:12,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2023-10-25 15:26:12,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2023-10-25 15:26:12,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 15:26:12,736 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:12,739 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:26:12,739 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:26:12,769 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-25 15:26:12,775 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 166 places, 165 transitions, 342 flow
[2023-10-25 15:26:12,820 INFO  L130       PetriNetUnfolder]: 10/263 cut-off events.
[2023-10-25 15:26:12,820 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-25 15:26:12,821 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 273 conditions, 263 events. 10/263 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 376 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 177. Up to 6 conditions per place. 
[2023-10-25 15:26:12,821 INFO  L82        GeneralOperation]: Start removeDead. Operand has 166 places, 165 transitions, 342 flow
[2023-10-25 15:26:12,822 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 166 places, 165 transitions, 342 flow
[2023-10-25 15:26:12,832 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:26:12,832 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 165 transitions, 342 flow
[2023-10-25 15:26:12,833 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 165 transitions, 342 flow
[2023-10-25 15:26:12,833 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 166 places, 165 transitions, 342 flow
[2023-10-25 15:26:12,878 INFO  L130       PetriNetUnfolder]: 10/263 cut-off events.
[2023-10-25 15:26:12,878 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-25 15:26:12,879 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 273 conditions, 263 events. 10/263 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 376 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 177. Up to 6 conditions per place. 
[2023-10-25 15:26:12,883 INFO  L119        LiptonReduction]: Number of co-enabled transitions 8232
[2023-10-25 15:26:16,539 INFO  L134        LiptonReduction]: Checked pairs total: 37435
[2023-10-25 15:26:16,539 INFO  L136        LiptonReduction]: Total number of compositions: 109
[2023-10-25 15:26:16,540 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:26:16,541 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;@76ce54c1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:26:16,541 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-10-25 15:26:16,542 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-25 15:26:16,542 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:16,542 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:16,542 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:26:16,542 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:16,542 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:16,543 INFO  L85        PathProgramCache]: Analyzing trace with hash 23166534, now seen corresponding path program 1 times
[2023-10-25 15:26:16,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:16,543 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950472671]
[2023-10-25 15:26:16,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:16,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:16,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:16,587 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:16,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:16,587 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950472671]
[2023-10-25 15:26:16,587 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950472671] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:16,587 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:16,587 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:16,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822963342]
[2023-10-25 15:26:16,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:16,589 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:16,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:16,595 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:16,595 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:16,631 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 274
[2023-10-25 15:26:16,632 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 138 flow. Second operand  has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 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:16,632 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:16,632 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 274
[2023-10-25 15:26:16,632 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:17,992 INFO  L130       PetriNetUnfolder]: 4700/9285 cut-off events.
[2023-10-25 15:26:17,992 INFO  L131       PetriNetUnfolder]: For 61/61 co-relation queries the response was YES.
[2023-10-25 15:26:18,004 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16906 conditions, 9285 events. 4700/9285 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 73901 event pairs, 2037 based on Foata normal form. 0/8521 useless extension candidates. Maximal degree in co-relation 6522. Up to 3799 conditions per place. 
[2023-10-25 15:26:18,095 INFO  L137   encePairwiseOnDemand]: 257/274 looper letters, 63 selfloop transitions, 11 changer transitions 0/95 dead transitions.
[2023-10-25 15:26:18,095 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 95 transitions, 355 flow
[2023-10-25 15:26:18,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:18,096 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:18,096 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions.
[2023-10-25 15:26:18,097 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6289537712895377
[2023-10-25 15:26:18,097 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 517 transitions.
[2023-10-25 15:26:18,097 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions.
[2023-10-25 15:26:18,097 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:18,097 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions.
[2023-10-25 15:26:18,098 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 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:18,100 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:18,114 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:18,114 INFO  L175             Difference]: Start difference. First operand has 66 places, 63 transitions, 138 flow. Second operand 3 states and 517 transitions.
[2023-10-25 15:26:18,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 95 transitions, 355 flow
[2023-10-25 15:26:18,115 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 353 flow, removed 1 selfloop flow, removed 0 redundant places.
[2023-10-25 15:26:18,117 INFO  L231             Difference]: Finished difference. Result has 69 places, 72 transitions, 228 flow
[2023-10-25 15:26:18,117 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=69, PETRI_TRANSITIONS=72}
[2023-10-25 15:26:18,118 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places.
[2023-10-25 15:26:18,119 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 228 flow
[2023-10-25 15:26:18,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 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:18,120 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:18,120 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:18,120 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-25 15:26:18,120 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:18,120 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:18,120 INFO  L85        PathProgramCache]: Analyzing trace with hash 271718391, now seen corresponding path program 1 times
[2023-10-25 15:26:18,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:18,121 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627345689]
[2023-10-25 15:26:18,121 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:18,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:18,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:18,178 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:18,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:18,178 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627345689]
[2023-10-25 15:26:18,178 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627345689] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:18,179 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:18,179 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:18,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046191914]
[2023-10-25 15:26:18,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:18,179 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:18,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:18,180 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:18,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:18,189 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 274
[2023-10-25 15:26:18,189 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 228 flow. Second operand  has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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:18,190 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:18,190 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 274
[2023-10-25 15:26:18,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:19,394 INFO  L130       PetriNetUnfolder]: 3699/7359 cut-off events.
[2023-10-25 15:26:19,395 INFO  L131       PetriNetUnfolder]: For 1479/1494 co-relation queries the response was YES.
[2023-10-25 15:26:19,417 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15549 conditions, 7359 events. 3699/7359 cut-off events. For 1479/1494 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 58723 event pairs, 3092 based on Foata normal form. 1/6802 useless extension candidates. Maximal degree in co-relation 6902. Up to 5555 conditions per place. 
[2023-10-25 15:26:19,470 INFO  L137   encePairwiseOnDemand]: 271/274 looper letters, 35 selfloop transitions, 2 changer transitions 2/77 dead transitions.
[2023-10-25 15:26:19,482 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 77 transitions, 320 flow
[2023-10-25 15:26:19,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:19,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:19,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions.
[2023-10-25 15:26:19,484 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.610705596107056
[2023-10-25 15:26:19,484 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 502 transitions.
[2023-10-25 15:26:19,485 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions.
[2023-10-25 15:26:19,485 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:19,485 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions.
[2023-10-25 15:26:19,486 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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:19,487 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:19,488 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:19,488 INFO  L175             Difference]: Start difference. First operand has 69 places, 72 transitions, 228 flow. Second operand 3 states and 502 transitions.
[2023-10-25 15:26:19,488 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 77 transitions, 320 flow
[2023-10-25 15:26:19,509 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:19,512 INFO  L231             Difference]: Finished difference. Result has 70 places, 73 transitions, 218 flow
[2023-10-25 15:26:19,513 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=70, PETRI_TRANSITIONS=73}
[2023-10-25 15:26:19,513 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 4 predicate places.
[2023-10-25 15:26:19,514 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 218 flow
[2023-10-25 15:26:19,514 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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:19,514 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:19,514 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:19,514 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 15:26:19,514 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:19,515 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:19,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 1566035078, now seen corresponding path program 1 times
[2023-10-25 15:26:19,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:19,515 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443132627]
[2023-10-25 15:26:19,515 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:19,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:19,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:19,543 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:19,543 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:19,557 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443132627]
[2023-10-25 15:26:19,557 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443132627] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:19,557 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:19,558 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:19,558 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689732449]
[2023-10-25 15:26:19,558 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:19,558 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:19,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:19,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:19,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:19,583 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 274
[2023-10-25 15:26:19,584 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 218 flow. Second operand  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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:19,584 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:19,584 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 274
[2023-10-25 15:26:19,584 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:20,622 INFO  L130       PetriNetUnfolder]: 3943/7684 cut-off events.
[2023-10-25 15:26:20,634 INFO  L131       PetriNetUnfolder]: For 1638/1840 co-relation queries the response was YES.
[2023-10-25 15:26:20,641 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16434 conditions, 7684 events. 3943/7684 cut-off events. For 1638/1840 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 60134 event pairs, 2549 based on Foata normal form. 59/6992 useless extension candidates. Maximal degree in co-relation 16398. Up to 5346 conditions per place. 
[2023-10-25 15:26:20,680 INFO  L137   encePairwiseOnDemand]: 266/274 looper letters, 53 selfloop transitions, 12 changer transitions 0/97 dead transitions.
[2023-10-25 15:26:20,692 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 97 transitions, 412 flow
[2023-10-25 15:26:20,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:20,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:20,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions.
[2023-10-25 15:26:20,694 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6058394160583942
[2023-10-25 15:26:20,694 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 498 transitions.
[2023-10-25 15:26:20,694 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions.
[2023-10-25 15:26:20,694 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:20,694 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions.
[2023-10-25 15:26:20,695 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 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:20,697 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:20,697 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:20,697 INFO  L175             Difference]: Start difference. First operand has 70 places, 73 transitions, 218 flow. Second operand 3 states and 498 transitions.
[2023-10-25 15:26:20,697 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 97 transitions, 412 flow
[2023-10-25 15:26:20,699 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 97 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:26:20,700 INFO  L231             Difference]: Finished difference. Result has 73 places, 83 transitions, 322 flow
[2023-10-25 15:26:20,713 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=73, PETRI_TRANSITIONS=83}
[2023-10-25 15:26:20,714 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places.
[2023-10-25 15:26:20,714 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 322 flow
[2023-10-25 15:26:20,715 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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:20,715 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:20,715 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:20,715 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-25 15:26:20,715 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:20,715 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:20,715 INFO  L85        PathProgramCache]: Analyzing trace with hash 2024296669, now seen corresponding path program 1 times
[2023-10-25 15:26:20,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:20,716 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328484601]
[2023-10-25 15:26:20,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:20,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:20,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:20,763 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:20,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:20,763 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328484601]
[2023-10-25 15:26:20,764 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328484601] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:20,764 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:20,764 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:20,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880935373]
[2023-10-25 15:26:20,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:20,765 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:20,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:20,766 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:20,766 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:20,777 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 153 out of 274
[2023-10-25 15:26:20,778 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 322 flow. Second operand  has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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:20,778 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:20,778 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 274
[2023-10-25 15:26:20,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:21,903 INFO  L130       PetriNetUnfolder]: 4089/8296 cut-off events.
[2023-10-25 15:26:21,904 INFO  L131       PetriNetUnfolder]: For 5148/6911 co-relation queries the response was YES.
[2023-10-25 15:26:21,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19237 conditions, 8296 events. 4089/8296 cut-off events. For 5148/6911 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 69168 event pairs, 2758 based on Foata normal form. 251/7673 useless extension candidates. Maximal degree in co-relation 11348. Up to 5557 conditions per place. 
[2023-10-25 15:26:21,970 INFO  L137   encePairwiseOnDemand]: 269/274 looper letters, 64 selfloop transitions, 4 changer transitions 0/110 dead transitions.
[2023-10-25 15:26:21,970 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 110 transitions, 555 flow
[2023-10-25 15:26:21,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:21,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:21,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions.
[2023-10-25 15:26:21,972 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6228710462287105
[2023-10-25 15:26:21,972 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 512 transitions.
[2023-10-25 15:26:21,973 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions.
[2023-10-25 15:26:21,973 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:21,973 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions.
[2023-10-25 15:26:21,974 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:26:21,990 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:21,991 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:21,991 INFO  L175             Difference]: Start difference. First operand has 73 places, 83 transitions, 322 flow. Second operand 3 states and 512 transitions.
[2023-10-25 15:26:21,991 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 110 transitions, 555 flow
[2023-10-25 15:26:21,998 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 110 transitions, 523 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:21,999 INFO  L231             Difference]: Finished difference. Result has 74 places, 86 transitions, 324 flow
[2023-10-25 15:26:22,000 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=74, PETRI_TRANSITIONS=86}
[2023-10-25 15:26:22,000 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places.
[2023-10-25 15:26:22,001 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 86 transitions, 324 flow
[2023-10-25 15:26:22,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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:22,001 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:22,001 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:22,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-25 15:26:22,001 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:22,002 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:22,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 366274325, now seen corresponding path program 1 times
[2023-10-25 15:26:22,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:22,003 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902312416]
[2023-10-25 15:26:22,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:22,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:22,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:22,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:26:22,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:22,067 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902312416]
[2023-10-25 15:26:22,067 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902312416] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:22,067 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:22,068 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:22,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724619925]
[2023-10-25 15:26:22,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:22,068 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:22,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:22,069 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:22,069 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:22,077 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 274
[2023-10-25 15:26:22,078 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 86 transitions, 324 flow. Second operand  has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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:22,078 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:22,078 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 274
[2023-10-25 15:26:22,078 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:23,280 INFO  L130       PetriNetUnfolder]: 4914/9916 cut-off events.
[2023-10-25 15:26:23,280 INFO  L131       PetriNetUnfolder]: For 5630/7673 co-relation queries the response was YES.
[2023-10-25 15:26:23,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23298 conditions, 9916 events. 4914/9916 cut-off events. For 5630/7673 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 83544 event pairs, 2708 based on Foata normal form. 247/9262 useless extension candidates. Maximal degree in co-relation 12576. Up to 5855 conditions per place. 
[2023-10-25 15:26:23,369 INFO  L137   encePairwiseOnDemand]: 269/274 looper letters, 62 selfloop transitions, 6 changer transitions 0/109 dead transitions.
[2023-10-25 15:26:23,369 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 535 flow
[2023-10-25 15:26:23,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:23,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:23,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions.
[2023-10-25 15:26:23,371 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6289537712895377
[2023-10-25 15:26:23,371 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 517 transitions.
[2023-10-25 15:26:23,371 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions.
[2023-10-25 15:26:23,372 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:23,372 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions.
[2023-10-25 15:26:23,373 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 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:23,374 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:23,376 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:23,389 INFO  L175             Difference]: Start difference. First operand has 74 places, 86 transitions, 324 flow. Second operand 3 states and 517 transitions.
[2023-10-25 15:26:23,389 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 535 flow
[2023-10-25 15:26:23,393 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 109 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:26:23,394 INFO  L231             Difference]: Finished difference. Result has 77 places, 90 transitions, 368 flow
[2023-10-25 15:26:23,395 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=77, PETRI_TRANSITIONS=90}
[2023-10-25 15:26:23,395 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places.
[2023-10-25 15:26:23,395 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 90 transitions, 368 flow
[2023-10-25 15:26:23,396 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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:23,396 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:23,396 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:23,396 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 15:26:23,396 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:23,396 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:23,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -548589024, now seen corresponding path program 1 times
[2023-10-25 15:26:23,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:23,397 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75259170]
[2023-10-25 15:26:23,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:23,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:23,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:23,426 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:26:23,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:23,469 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:26:23,472 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:26:23,472 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining)
[2023-10-25 15:26:23,474 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2023-10-25 15:26:23,474 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2023-10-25 15:26:23,474 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2023-10-25 15:26:23,474 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2023-10-25 15:26:23,475 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2023-10-25 15:26:23,475 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining)
[2023-10-25 15:26:23,475 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2023-10-25 15:26:23,475 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2023-10-25 15:26:23,475 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2023-10-25 15:26:23,489 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2023-10-25 15:26:23,489 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2023-10-25 15:26:23,490 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2023-10-25 15:26:23,490 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2023-10-25 15:26:23,490 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2023-10-25 15:26:23,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-25 15:26:23,490 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:23,495 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2023-10-25 15:26:23,495 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-10-25 15:26:23,564 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 03:26:23 BasicIcfg
[2023-10-25 15:26:23,565 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-10-25 15:26:23,565 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-10-25 15:26:23,566 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-10-25 15:26:23,566 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-10-25 15:26:23,566 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:05" (3/4) ...
[2023-10-25 15:26:23,575 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-10-25 15:26:23,575 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-10-25 15:26:23,576 INFO  L158              Benchmark]: Toolchain (without parser) took 19534.08ms. Allocated memory was 44.9MB in the beginning and 178.1MB in the end (delta: 133.2MB). Free memory was 14.7MB in the beginning and 83.6MB in the end (delta: -68.9MB). Peak memory consumption was 64.2MB. Max. memory is 15.6GB.
[2023-10-25 15:26:23,576 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 40.8MB. Free memory was 15.2MB in the beginning and 15.1MB in the end (delta: 31.6kB). Peak memory consumption was 31.6kB. Max. memory is 15.6GB.
[2023-10-25 15:26:23,576 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 693.29ms. Allocated memory is still 44.9MB. Free memory was 14.5MB in the beginning and 17.4MB in the end (delta: -3.0MB). Peak memory consumption was 3.6MB. Max. memory is 15.6GB.
[2023-10-25 15:26:23,577 INFO  L158              Benchmark]: Boogie Procedure Inliner took 64.13ms. Allocated memory is still 44.9MB. Free memory was 17.4MB in the beginning and 15.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.2MB. Max. memory is 15.6GB.
[2023-10-25 15:26:23,578 INFO  L158              Benchmark]: Boogie Preprocessor took 60.07ms. Allocated memory is still 44.9MB. Free memory was 15.3MB in the beginning and 13.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.6MB. Max. memory is 15.6GB.
[2023-10-25 15:26:23,578 INFO  L158              Benchmark]: RCFGBuilder took 794.35ms. Allocated memory is still 44.9MB. Free memory was 13.6MB in the beginning and 21.8MB in the end (delta: -8.2MB). Peak memory consumption was 4.7MB. Max. memory is 15.6GB.
[2023-10-25 15:26:23,578 INFO  L158              Benchmark]: TraceAbstraction took 17906.62ms. Allocated memory was 44.9MB in the beginning and 178.1MB in the end (delta: 133.2MB). Free memory was 21.0MB in the beginning and 83.6MB in the end (delta: -62.7MB). Peak memory consumption was 70.5MB. Max. memory is 15.6GB.
[2023-10-25 15:26:23,579 INFO  L158              Benchmark]: Witness Printer took 10.06ms. Allocated memory is still 178.1MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 15.6GB.
[2023-10-25 15:26:23,594 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 was 15.2MB in the beginning and 15.1MB in the end (delta: 31.6kB). Peak memory consumption was 31.6kB. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 693.29ms. Allocated memory is still 44.9MB. Free memory was 14.5MB in the beginning and 17.4MB in the end (delta: -3.0MB). Peak memory consumption was 3.6MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 64.13ms. Allocated memory is still 44.9MB. Free memory was 17.4MB in the beginning and 15.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.2MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 60.07ms. Allocated memory is still 44.9MB. Free memory was 15.3MB in the beginning and 13.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.6MB. Max. memory is 15.6GB.
 * RCFGBuilder took 794.35ms. Allocated memory is still 44.9MB. Free memory was 13.6MB in the beginning and 21.8MB in the end (delta: -8.2MB). Peak memory consumption was 4.7MB. Max. memory is 15.6GB.
 * TraceAbstraction took 17906.62ms. Allocated memory was 44.9MB in the beginning and 178.1MB in the end (delta: 133.2MB). Free memory was 21.0MB in the beginning and 83.6MB in the end (delta: -62.7MB). Peak memory consumption was 70.5MB. Max. memory is 15.6GB.
 * Witness Printer took 10.06ms. Allocated memory is still 178.1MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 4.6s, 135 PlacesBefore, 46 PlacesAfterwards, 136 TransitionsBefore, 45 TransitionsAfterwards, 3304 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 99 TotalNumberOfCompositions, 13696 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4677, independent: 4157, independent conditional: 0, independent unconditional: 4157, dependent: 520, dependent conditional: 0, dependent unconditional: 520, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1589, independent: 1526, independent conditional: 0, independent unconditional: 1526, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4677, independent: 2631, independent conditional: 0, independent unconditional: 2631, dependent: 457, dependent conditional: 0, dependent unconditional: 457, unknown: 1589, unknown conditional: 0, unknown unconditional: 1589] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 221, Positive conditional cache size: 0, Positive unconditional cache size: 221, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 3.7s, 166 PlacesBefore, 66 PlacesAfterwards, 165 TransitionsBefore, 63 TransitionsAfterwards, 8232 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 109 TotalNumberOfCompositions, 37435 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10143, independent: 9392, independent conditional: 0, independent unconditional: 9392, dependent: 751, dependent conditional: 0, dependent unconditional: 751, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3645, independent: 3552, independent conditional: 0, independent unconditional: 3552, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10143, independent: 5840, independent conditional: 0, independent unconditional: 5840, dependent: 658, dependent conditional: 0, dependent unconditional: 658, unknown: 3645, unknown conditional: 0, unknown unconditional: 3645] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 419, Positive conditional cache size: 0, Positive unconditional cache size: 419, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, 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 = -1;
[L679]               0  pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L680]               0  pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } };
[L681]               0  int data = 0;
[L682]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L694]               0  int threads_total = __VERIFIER_nondet_int();
[L695]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L675]  COND FALSE   0  !(!cond)
[L695]  RET          0  assume_abort_if_not(threads_total >= 0)
[L696]               0  int i = 0;
        VAL             [data=0, data_mutex={3:0}, i=0, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1]
[L696]  COND TRUE    0  i < threads_total
[L698]               0  threads_alive++
[L700]               0  pthread_t tid;
[L701]  FCALL, FORK  0  pthread_create(&tid, ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={3:0}, i=0, pthread_create(&tid, ((void *)0), &thread, ((void *)0))=-1, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}]
[L702]  EXPR         0  \read(tid)
[L702]               0  pthread_detach(tid)
[L696]               0  i++
[L696]  COND FALSE   0  !(i < threads_total)
[L685]               1  data = __VERIFIER_nondet_int()
        VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=49, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]
[L705]  COND FALSE   0  !(\read(threads_alive))
        VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=49, data_mutex={3:0}, i=1, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1]
[L708]               0  return data;
        VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=49, data_mutex={3:0}, i=1, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1]
[L685]               1  data = __VERIFIER_nondet_int()
        VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=49, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}]

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

  - UnprovableResult [Line: 698]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 705]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 708]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 698]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 702]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 701]: Unable to prove that petrification did provide enough thread instances (tool internal message, 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: 688]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 688]: 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, 162 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: 6.9s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 12 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=5, InterpolantAutomatonStates: 15, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 71 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 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, 191 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: 10.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 453 IncrementalHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 24 mSDtfsCounter, 453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 72 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 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:23,669 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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