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


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42baa13f3c833f066425b90d7117bc629a4606afd0b2e1bcf57fcc9bd3837ebb
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 13:16:33,583 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 13:16:33,585 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 13:16:33,607 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 13:16:33,607 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 13:16:33,608 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 13:16:33,609 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 13:16:33,610 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 13:16:33,611 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 13:16:33,612 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 13:16:33,612 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 13:16:33,613 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 13:16:33,614 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 13:16:33,614 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 13:16:33,615 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 13:16:33,616 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 13:16:33,616 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 13:16:33,617 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 13:16:33,618 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 13:16:33,619 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 13:16:33,620 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 13:16:33,621 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 13:16:33,622 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 13:16:33,623 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 13:16:33,625 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 13:16:33,626 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 13:16:33,626 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 13:16:33,626 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 13:16:33,627 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 13:16:33,627 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 13:16:33,628 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 13:16:33,628 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 13:16:33,629 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 13:16:33,629 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 13:16:33,630 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 13:16:33,630 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 13:16:33,631 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 13:16:33,631 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 13:16:33,631 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 13:16:33,632 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 13:16:33,632 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 13:16:33,633 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 13:16:33,648 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 13:16:33,649 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 13:16:33,649 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 13:16:33,649 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 13:16:33,650 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 13:16:33,650 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 13:16:33,650 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 13:16:33,650 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 13:16:33,650 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 13:16:33,650 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 13:16:33,651 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 13:16:33,651 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 13:16:33,651 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 13:16:33,651 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 13:16:33,651 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 13:16:33,651 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 13:16:33,651 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 13:16:33,651 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 13:16:33,651 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 13:16:33,652 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 13:16:33,652 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 13:16:33,652 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 13:16:33,652 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 13:16:33,652 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 13:16:33,652 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 13:16:33,652 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 13:16:33,652 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:16:33,652 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 13:16:33,653 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 13:16:33,653 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 13:16:33,653 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 13:16:33,653 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 13:16:33,653 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 13:16:33,653 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 13:16:33,653 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 13:16:33,653 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 13:16:33,653 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 13:16:33,654 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 -> 42baa13f3c833f066425b90d7117bc629a4606afd0b2e1bcf57fcc9bd3837ebb
[2023-11-03 13:16:33,847 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 13:16:33,880 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 13:16:33,882 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 13:16:33,883 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 13:16:33,884 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 13:16:33,885 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race.i
[2023-11-03 13:16:34,956 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 13:16:35,151 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 13:16:35,151 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race.i
[2023-11-03 13:16:35,162 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/4f56cf2f3/699d07668936441bae8fb819d0f30595/FLAG0eeab5f9e
[2023-11-03 13:16:35,517 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/4f56cf2f3/699d07668936441bae8fb819d0f30595
[2023-11-03 13:16:35,519 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 13:16:35,520 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 13:16:35,521 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 13:16:35,521 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 13:16:35,524 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 13:16:35,525 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,526 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@111820aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35, skipping insertion in model container
[2023-11-03 13:16:35,526 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,532 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 13:16:35,573 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 13:16:35,697 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 13:16:35,840 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:16:35,849 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 13:16:35,860 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 13:16:35,883 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:16:35,921 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 13:16:35,922 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35 WrapperNode
[2023-11-03 13:16:35,922 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 13:16:35,923 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 13:16:35,923 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 13:16:35,923 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 13:16:35,929 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,945 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,965 INFO  L138                Inliner]: procedures = 269, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84
[2023-11-03 13:16:35,966 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 13:16:35,966 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 13:16:35,966 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 13:16:35,967 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 13:16:35,975 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,975 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,979 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,979 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,986 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,989 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,992 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,993 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:35,995 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 13:16:35,996 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 13:16:35,996 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 13:16:35,996 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 13:16:35,997 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (1/1) ...
[2023-11-03 13:16:36,003 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:16:36,011 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:16:36,025 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-11-03 13:16:36,029 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-11-03 13:16:36,057 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 13:16:36,057 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 13:16:36,057 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 13:16:36,057 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 13:16:36,057 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 13:16:36,057 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 13:16:36,057 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-03 13:16:36,057 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 13:16:36,058 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-03 13:16:36,058 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-03 13:16:36,058 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 13:16:36,058 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 13:16:36,058 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 13:16:36,058 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 13:16:36,059 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 13:16:36,195 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 13:16:36,197 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 13:16:36,420 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 13:16:36,430 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 13:16:36,430 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 13:16:36,432 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:16:36 BoogieIcfgContainer
[2023-11-03 13:16:36,432 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 13:16:36,434 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 13:16:36,434 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 13:16:36,437 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 13:16:36,437 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:16:35" (1/3) ...
[2023-11-03 13:16:36,437 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3a21c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:16:36, skipping insertion in model container
[2023-11-03 13:16:36,437 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:16:35" (2/3) ...
[2023-11-03 13:16:36,438 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3a21c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:16:36, skipping insertion in model container
[2023-11-03 13:16:36,438 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:16:36" (3/3) ...
[2023-11-03 13:16:36,439 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race.i
[2023-11-03 13:16:36,446 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 13:16:36,454 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 13:16:36,455 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2023-11-03 13:16:36,455 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 13:16:36,496 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 13:16:36,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:36,576 INFO  L130       PetriNetUnfolder]: 6/158 cut-off events.
[2023-11-03 13:16:36,577 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:16:36,580 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 302 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2023-11-03 13:16:36,580 INFO  L82        GeneralOperation]: Start removeDead. Operand has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:36,584 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:36,587 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:16:36,598 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:36,602 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:36,603 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 108 places, 109 transitions, 226 flow
[2023-11-03 13:16:36,630 INFO  L130       PetriNetUnfolder]: 6/158 cut-off events.
[2023-11-03 13:16:36,630 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:16:36,631 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164 conditions, 158 events. 6/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 302 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. 
[2023-11-03 13:16:36,632 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1568
[2023-11-03 13:16:40,922 INFO  L134        LiptonReduction]: Checked pairs total: 2097
[2023-11-03 13:16:40,923 INFO  L136        LiptonReduction]: Total number of compositions: 105
[2023-11-03 13:16:40,936 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:16:40,941 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;@38c93740, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:16:40,941 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-11-03 13:16:40,943 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2023-11-03 13:16:40,943 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:16:40,943 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:40,944 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:16:40,944 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 13:16:40,947 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:40,948 INFO  L85        PathProgramCache]: Analyzing trace with hash 12504, now seen corresponding path program 1 times
[2023-11-03 13:16:40,954 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:40,954 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033111468]
[2023-11-03 13:16:40,955 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:40,955 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:41,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:16:41,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:16:41,086 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:16:41,086 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033111468]
[2023-11-03 13:16:41,087 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033111468] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:16:41,087 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:16:41,087 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:16:41,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468103434]
[2023-11-03 13:16:41,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:16:41,094 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:16:41,095 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:16:41,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:16:41,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:16:41,113 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 214
[2023-11-03 13:16:41,115 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 50 flow. Second operand  has 2 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 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-11-03 13:16:41,115 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:16:41,115 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 214
[2023-11-03 13:16:41,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:16:41,161 INFO  L130       PetriNetUnfolder]: 19/66 cut-off events.
[2023-11-03 13:16:41,161 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:16:41,162 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127 conditions, 66 events. 19/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 99. Up to 55 conditions per place. 
[2023-11-03 13:16:41,163 INFO  L137   encePairwiseOnDemand]: 210/214 looper letters, 13 selfloop transitions, 0 changer transitions 0/17 dead transitions.
[2023-11-03 13:16:41,163 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 68 flow
[2023-11-03 13:16:41,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:16:41,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:16:41,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 225 transitions.
[2023-11-03 13:16:41,174 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5257009345794392
[2023-11-03 13:16:41,174 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 225 transitions.
[2023-11-03 13:16:41,174 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 225 transitions.
[2023-11-03 13:16:41,175 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:16:41,177 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 225 transitions.
[2023-11-03 13:16:41,179 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 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-11-03 13:16:41,183 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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-11-03 13:16:41,183 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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-11-03 13:16:41,184 INFO  L175             Difference]: Start difference. First operand has 23 places, 21 transitions, 50 flow. Second operand 2 states and 225 transitions.
[2023-11-03 13:16:41,185 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 68 flow
[2023-11-03 13:16:41,186 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:16:41,187 INFO  L231             Difference]: Finished difference. Result has 20 places, 17 transitions, 42 flow
[2023-11-03 13:16:41,189 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=20, PETRI_TRANSITIONS=17}
[2023-11-03 13:16:41,192 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, -3 predicate places.
[2023-11-03 13:16:41,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 42 flow
[2023-11-03 13:16:41,192 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 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-11-03 13:16:41,192 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:41,192 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:16:41,193 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 13:16:41,193 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 13:16:41,193 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:41,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 11981218, now seen corresponding path program 1 times
[2023-11-03 13:16:41,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:41,194 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418659150]
[2023-11-03 13:16:41,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:41,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:41,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:16:41,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:16:41,274 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:16:41,274 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418659150]
[2023-11-03 13:16:41,275 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418659150] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:16:41,275 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:16:41,275 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:16:41,275 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410550830]
[2023-11-03 13:16:41,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:16:41,277 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:16:41,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:16:41,278 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:16:41,278 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:16:41,294 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 214
[2023-11-03 13:16:41,294 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 42 flow. Second operand  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-11-03 13:16:41,294 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:16:41,294 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 214
[2023-11-03 13:16:41,294 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:16:41,363 INFO  L130       PetriNetUnfolder]: 24/81 cut-off events.
[2023-11-03 13:16:41,363 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:16:41,364 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 161 conditions, 81 events. 24/81 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 280 event pairs, 13 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 157. Up to 50 conditions per place. 
[2023-11-03 13:16:41,364 INFO  L137   encePairwiseOnDemand]: 210/214 looper letters, 14 selfloop transitions, 3 changer transitions 3/22 dead transitions.
[2023-11-03 13:16:41,364 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 22 transitions, 92 flow
[2023-11-03 13:16:41,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:16:41,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:16:41,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions.
[2023-11-03 13:16:41,367 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5
[2023-11-03 13:16:41,367 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 321 transitions.
[2023-11-03 13:16:41,367 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions.
[2023-11-03 13:16:41,368 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:16:41,368 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions.
[2023-11-03 13:16:41,369 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-11-03 13:16:41,371 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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-11-03 13:16:41,372 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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-11-03 13:16:41,372 INFO  L175             Difference]: Start difference. First operand has 20 places, 17 transitions, 42 flow. Second operand 3 states and 321 transitions.
[2023-11-03 13:16:41,372 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 22 transitions, 92 flow
[2023-11-03 13:16:41,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:16:41,373 INFO  L231             Difference]: Finished difference. Result has 24 places, 17 transitions, 57 flow
[2023-11-03 13:16:41,373 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=24, PETRI_TRANSITIONS=17}
[2023-11-03 13:16:41,374 INFO  L288   CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places.
[2023-11-03 13:16:41,374 INFO  L495      AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 57 flow
[2023-11-03 13:16:41,374 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-11-03 13:16:41,374 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:41,374 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-11-03 13:16:41,375 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 13:16:41,375 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-11-03 13:16:41,375 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:41,375 INFO  L85        PathProgramCache]: Analyzing trace with hash -1330178479, now seen corresponding path program 1 times
[2023-11-03 13:16:41,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:41,376 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125135379]
[2023-11-03 13:16:41,376 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:41,376 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:41,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:16:41,422 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:16:41,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:16:41,455 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:16:41,455 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:16:41,456 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2023-11-03 13:16:41,457 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-11-03 13:16:41,458 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-11-03 13:16:41,458 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2023-11-03 13:16:41,458 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-11-03 13:16:41,458 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-11-03 13:16:41,458 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-11-03 13:16:41,459 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-11-03 13:16:41,459 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 13:16:41,459 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-11-03 13:16:41,461 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:16:41,461 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 13:16:41,479 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-03 13:16:41,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:41,511 INFO  L130       PetriNetUnfolder]: 11/276 cut-off events.
[2023-11-03 13:16:41,511 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 13:16:41,512 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290 conditions, 276 events. 11/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 636 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. 
[2023-11-03 13:16:41,512 INFO  L82        GeneralOperation]: Start removeDead. Operand has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:41,513 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:41,513 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:16:41,513 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:41,514 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:41,514 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 125 transitions, 268 flow
[2023-11-03 13:16:41,536 INFO  L130       PetriNetUnfolder]: 11/276 cut-off events.
[2023-11-03 13:16:41,536 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 13:16:41,537 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290 conditions, 276 events. 11/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 636 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. 
[2023-11-03 13:16:41,540 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3892
[2023-11-03 13:16:45,306 INFO  L134        LiptonReduction]: Checked pairs total: 7634
[2023-11-03 13:16:45,306 INFO  L136        LiptonReduction]: Total number of compositions: 107
[2023-11-03 13:16:45,309 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:16:45,310 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;@38c93740, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:16:45,310 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-11-03 13:16:45,312 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-11-03 13:16:45,312 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:16:45,312 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:45,312 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-03 13:16:45,313 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:16:45,313 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:45,313 INFO  L85        PathProgramCache]: Analyzing trace with hash 20441, now seen corresponding path program 1 times
[2023-11-03 13:16:45,313 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:45,313 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040241321]
[2023-11-03 13:16:45,314 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:45,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:45,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:16:45,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:16:45,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:16:45,336 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040241321]
[2023-11-03 13:16:45,336 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040241321] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:16:45,336 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:16:45,336 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-03 13:16:45,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383888664]
[2023-11-03 13:16:45,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:16:45,336 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:16:45,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:16:45,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:16:45,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:16:45,337 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 232
[2023-11-03 13:16:45,338 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 84 flow. Second operand  has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 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-11-03 13:16:45,338 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:16:45,338 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 232
[2023-11-03 13:16:45,338 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:16:45,450 INFO  L130       PetriNetUnfolder]: 378/759 cut-off events.
[2023-11-03 13:16:45,450 INFO  L131       PetriNetUnfolder]: For 38/38 co-relation queries the response was YES.
[2023-11-03 13:16:45,451 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 759 events. 378/759 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3813 event pairs, 371 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 519. Up to 666 conditions per place. 
[2023-11-03 13:16:45,454 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 21 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2023-11-03 13:16:45,455 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 118 flow
[2023-11-03 13:16:45,455 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:16:45,455 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:16:45,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions.
[2023-11-03 13:16:45,456 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5625
[2023-11-03 13:16:45,456 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 261 transitions.
[2023-11-03 13:16:45,457 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 261 transitions.
[2023-11-03 13:16:45,457 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:16:45,457 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 261 transitions.
[2023-11-03 13:16:45,458 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:45,459 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-11-03 13:16:45,459 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 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-11-03 13:16:45,459 INFO  L175             Difference]: Start difference. First operand has 36 places, 33 transitions, 84 flow. Second operand 2 states and 261 transitions.
[2023-11-03 13:16:45,459 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 118 flow
[2023-11-03 13:16:45,461 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:16:45,461 INFO  L231             Difference]: Finished difference. Result has 33 places, 29 transitions, 76 flow
[2023-11-03 13:16:45,461 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=29}
[2023-11-03 13:16:45,462 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places.
[2023-11-03 13:16:45,462 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 76 flow
[2023-11-03 13:16:45,462 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 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-11-03 13:16:45,462 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:45,462 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-11-03 13:16:45,462 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 13:16:45,463 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:16:45,463 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:45,463 INFO  L85        PathProgramCache]: Analyzing trace with hash 19618577, now seen corresponding path program 1 times
[2023-11-03 13:16:45,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:45,463 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553777630]
[2023-11-03 13:16:45,463 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:45,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:45,472 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:16:45,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:16:45,488 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:16:45,489 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553777630]
[2023-11-03 13:16:45,489 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553777630] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:16:45,489 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:16:45,489 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:16:45,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606085132]
[2023-11-03 13:16:45,489 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:16:45,489 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:16:45,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:16:45,490 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:16:45,490 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:16:45,505 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 232
[2023-11-03 13:16:45,506 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 76 flow. Second operand  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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-11-03 13:16:45,506 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:16:45,506 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 232
[2023-11-03 13:16:45,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:16:45,673 INFO  L130       PetriNetUnfolder]: 679/1281 cut-off events.
[2023-11-03 13:16:45,673 INFO  L131       PetriNetUnfolder]: For 42/42 co-relation queries the response was YES.
[2023-11-03 13:16:45,675 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2525 conditions, 1281 events. 679/1281 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6792 event pairs, 416 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 2520. Up to 850 conditions per place. 
[2023-11-03 13:16:45,678 INFO  L137   encePairwiseOnDemand]: 227/232 looper letters, 32 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2023-11-03 13:16:45,678 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 172 flow
[2023-11-03 13:16:45,679 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:16:45,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:16:45,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions.
[2023-11-03 13:16:45,680 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5402298850574713
[2023-11-03 13:16:45,680 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 376 transitions.
[2023-11-03 13:16:45,680 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions.
[2023-11-03 13:16:45,680 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:16:45,681 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions.
[2023-11-03 13:16:45,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:45,683 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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-11-03 13:16:45,684 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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-11-03 13:16:45,684 INFO  L175             Difference]: Start difference. First operand has 33 places, 29 transitions, 76 flow. Second operand 3 states and 376 transitions.
[2023-11-03 13:16:45,684 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 172 flow
[2023-11-03 13:16:45,685 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:16:45,685 INFO  L231             Difference]: Finished difference. Result has 37 places, 32 transitions, 106 flow
[2023-11-03 13:16:45,685 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=32}
[2023-11-03 13:16:45,686 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places.
[2023-11-03 13:16:45,686 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 106 flow
[2023-11-03 13:16:45,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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-11-03 13:16:45,687 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:45,687 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:16:45,687 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 13:16:45,687 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:16:45,687 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:45,687 INFO  L85        PathProgramCache]: Analyzing trace with hash 1542766331, now seen corresponding path program 1 times
[2023-11-03 13:16:45,687 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:45,687 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974271297]
[2023-11-03 13:16:45,687 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:45,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:45,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:16:45,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:16:45,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:16:45,725 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974271297]
[2023-11-03 13:16:45,725 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974271297] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:16:45,726 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:16:45,726 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:16:45,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301095106]
[2023-11-03 13:16:45,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:16:45,726 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:16:45,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:16:45,726 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:16:45,727 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:16:45,740 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 232
[2023-11-03 13:16:45,741 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-11-03 13:16:45,741 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:16:45,741 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 232
[2023-11-03 13:16:45,741 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:16:45,929 INFO  L130       PetriNetUnfolder]: 739/1420 cut-off events.
[2023-11-03 13:16:45,930 INFO  L131       PetriNetUnfolder]: For 329/329 co-relation queries the response was YES.
[2023-11-03 13:16:45,931 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 1420 events. 739/1420 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8161 event pairs, 430 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 3143. Up to 943 conditions per place. 
[2023-11-03 13:16:45,935 INFO  L137   encePairwiseOnDemand]: 226/232 looper letters, 35 selfloop transitions, 7 changer transitions 0/49 dead transitions.
[2023-11-03 13:16:45,935 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 242 flow
[2023-11-03 13:16:45,936 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:16:45,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:16:45,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions.
[2023-11-03 13:16:45,937 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5359195402298851
[2023-11-03 13:16:45,937 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 373 transitions.
[2023-11-03 13:16:45,937 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions.
[2023-11-03 13:16:45,938 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:16:45,938 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions.
[2023-11-03 13:16:45,939 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:16:45,940 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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-11-03 13:16:45,941 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 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-11-03 13:16:45,941 INFO  L175             Difference]: Start difference. First operand has 37 places, 32 transitions, 106 flow. Second operand 3 states and 373 transitions.
[2023-11-03 13:16:45,941 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 242 flow
[2023-11-03 13:16:45,945 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:16:45,946 INFO  L231             Difference]: Finished difference. Result has 39 places, 37 transitions, 154 flow
[2023-11-03 13:16:45,946 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=39, PETRI_TRANSITIONS=37}
[2023-11-03 13:16:45,946 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places.
[2023-11-03 13:16:45,946 INFO  L495      AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 154 flow
[2023-11-03 13:16:45,947 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-11-03 13:16:45,947 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:16:45,947 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:16:45,947 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 13:16:45,947 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-03 13:16:45,947 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:16:45,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 446003033, now seen corresponding path program 1 times
[2023-11-03 13:16:45,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:16:45,948 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165464492]
[2023-11-03 13:16:45,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:16:45,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:16:45,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:16:45,964 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:16:45,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:16:45,978 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:16:45,978 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:16:45,978 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining)
[2023-11-03 13:16:45,978 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-11-03 13:16:45,978 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-11-03 13:16:45,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-11-03 13:16:45,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-11-03 13:16:45,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining)
[2023-11-03 13:16:45,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-11-03 13:16:45,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-11-03 13:16:45,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-11-03 13:16:45,979 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-03 13:16:45,979 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-11-03 13:16:45,983 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2023-11-03 13:16:45,984 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-03 13:16:46,007 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:16:46 BasicIcfg
[2023-11-03 13:16:46,008 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-03 13:16:46,008 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-03 13:16:46,008 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-11-03 13:16:46,008 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-11-03 13:16:46,008 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:16:36" (3/4) ...
[2023-11-03 13:16:46,011 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-11-03 13:16:46,011 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-03 13:16:46,011 INFO  L158              Benchmark]: Toolchain (without parser) took 10490.99ms. Allocated memory was 213.9MB in the beginning and 308.3MB in the end (delta: 94.4MB). Free memory was 176.8MB in the beginning and 128.6MB in the end (delta: 48.2MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB.
[2023-11-03 13:16:46,012 INFO  L158              Benchmark]: CDTParser took 0.11ms. Allocated memory is still 107.0MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 23.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-03 13:16:46,012 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 401.23ms. Allocated memory is still 213.9MB. Free memory was 175.9MB in the beginning and 148.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2023-11-03 13:16:46,012 INFO  L158              Benchmark]: Boogie Procedure Inliner took 42.97ms. Allocated memory is still 213.9MB. Free memory was 148.6MB in the beginning and 145.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-03 13:16:46,013 INFO  L158              Benchmark]: Boogie Preprocessor took 29.02ms. Allocated memory is still 213.9MB. Free memory was 145.7MB in the beginning and 143.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-03 13:16:46,013 INFO  L158              Benchmark]: RCFGBuilder took 436.27ms. Allocated memory is still 213.9MB. Free memory was 143.6MB in the beginning and 126.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2023-11-03 13:16:46,013 INFO  L158              Benchmark]: TraceAbstraction took 9573.52ms. Allocated memory was 213.9MB in the beginning and 308.3MB in the end (delta: 94.4MB). Free memory was 126.8MB in the beginning and 128.6MB in the end (delta: -1.8MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB.
[2023-11-03 13:16:46,013 INFO  L158              Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 308.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-03 13:16:46,015 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.11ms. Allocated memory is still 107.0MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 23.6kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 401.23ms. Allocated memory is still 213.9MB. Free memory was 175.9MB in the beginning and 148.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 42.97ms. Allocated memory is still 213.9MB. Free memory was 148.6MB in the beginning and 145.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 29.02ms. Allocated memory is still 213.9MB. Free memory was 145.7MB in the beginning and 143.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 436.27ms. Allocated memory is still 213.9MB. Free memory was 143.6MB in the beginning and 126.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9573.52ms. Allocated memory was 213.9MB in the beginning and 308.3MB in the end (delta: 94.4MB). Free memory was 126.8MB in the beginning and 128.6MB in the end (delta: -1.8MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB.
 * Witness Printer took 2.86ms. Allocated memory is still 308.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 4.3s, 108 PlacesBefore, 23 PlacesAfterwards, 109 TransitionsBefore, 21 TransitionsAfterwards, 1568 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 2097 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1680, independent: 1610, independent conditional: 0, independent unconditional: 1610, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 856, independent: 838, independent conditional: 0, independent unconditional: 838, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1680, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 856, unknown conditional: 0, unknown unconditional: 856] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 3.8s, 125 PlacesBefore, 36 PlacesAfterwards, 125 TransitionsBefore, 33 TransitionsAfterwards, 3892 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 107 TotalNumberOfCompositions, 7634 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4256, independent: 4087, independent conditional: 0, independent unconditional: 4087, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2014, independent: 1979, independent conditional: 0, independent unconditional: 1979, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4256, independent: 2108, independent conditional: 0, independent unconditional: 2108, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 2014, unknown conditional: 0, unknown unconditional: 2014] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 1032]: Data race detected
    Data race detected
The following path leads to a data race: 
[L1013]               0  int data = 0;
[L1014]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L1022]               0  int threads_total = __VERIFIER_nondet_int();
[L1023]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1010]  COND FALSE   0  !(!cond)
[L1023]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1024]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1024]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1025]               0  int i = 0;
         VAL             [data=0, data_mutex={1:0}, i=0, threads_total=1, tids={5:0}]
[L1025]  COND TRUE    0  i < threads_total
[L1026]  EXPR         0  \read(*tids)
[L1026]  EXPR         0  tids[i]
[L1026]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [\read(*tids)={-1:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=0, threads_total=1, tids={5:0}]
[L1025]               0  i++
         VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=1, tids={5:0}]
[L1025]  COND FALSE   0  !(i < threads_total)
[L1028]               0  int i = 0;
         VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=0, i=1, threads_total=1, tids={5:0}]
[L1028]  COND FALSE   0  !(i < threads_total - 1)
[L1031]  EXPR         0  \read(*tids)
[L1031]               0  free(tids)
[L1032]               0  return data;
         VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=1, i=0, threads_total=1, tids={5:0}]
[L1017]               1  data = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=25, data_mutex={1:0}]
[L1032]               0  return data;
         VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=25, data_mutex={1:0}, i=0, i=1, threads_total=1, tids={5:0}]

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

  - UnprovableResult [Line: 1026]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1029]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1031]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1029]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1026]: 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: 1017]: 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, 121 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 2 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 136 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 10 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=3, InterpolantAutomatonStates: 8, 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.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 14 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-11-03 13:16:46,049 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
