./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/semaphore-posix-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/semaphore-posix-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 1c1654a2952e379169dacc3faf51bdabeef80c845229bbdbda835ff96c9d3adf
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 22:53:43,994 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 22:53:43,995 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 22:53:44,021 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 22:53:44,021 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 22:53:44,022 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 22:53:44,023 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 22:53:44,024 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 22:53:44,031 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 22:53:44,031 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 22:53:44,032 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 22:53:44,033 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 22:53:44,033 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 22:53:44,034 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 22:53:44,035 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 22:53:44,035 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 22:53:44,036 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 22:53:44,036 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 22:53:44,037 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 22:53:44,039 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 22:53:44,040 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 22:53:44,040 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 22:53:44,041 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 22:53:44,042 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 22:53:44,048 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 22:53:44,048 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 22:53:44,048 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 22:53:44,048 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 22:53:44,049 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 22:53:44,049 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 22:53:44,050 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 22:53:44,050 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 22:53:44,050 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 22:53:44,051 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 22:53:44,052 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 22:53:44,052 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 22:53:44,052 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 22:53:44,052 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 22:53:44,052 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 22:53:44,053 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 22:53:44,053 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 22:53:44,054 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 22:53:44,068 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 22:53:44,068 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 22:53:44,068 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 22:53:44,069 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 22:53:44,069 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 22:53:44,069 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 22:53:44,069 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 22:53:44,070 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 22:53:44,070 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 22:53:44,070 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 22:53:44,070 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 22:53:44,070 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 22:53:44,070 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 22:53:44,070 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 22:53:44,070 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 22:53:44,070 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 22:53:44,070 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 22:53:44,071 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 22:53:44,071 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 22:53:44,071 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 22:53:44,071 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 22:53:44,071 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 22:53:44,071 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 22:53:44,071 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 22:53:44,071 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 22:53:44,071 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 22:53:44,071 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:53:44,072 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 22:53:44,072 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 22:53:44,072 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 22:53:44,072 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 22:53:44,072 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 22:53:44,072 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 22:53:44,072 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 22:53:44,072 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 22:53:44,072 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 22:53:44,072 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 22:53:44,072 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 -> 1c1654a2952e379169dacc3faf51bdabeef80c845229bbdbda835ff96c9d3adf
[2024-03-11 22:53:44,228 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 22:53:44,246 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 22:53:44,248 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 22:53:44,249 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 22:53:44,249 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 22:53:44,250 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/semaphore-posix-race.i
[2024-03-11 22:53:45,308 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 22:53:45,525 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 22:53:45,526 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/semaphore-posix-race.i
[2024-03-11 22:53:45,537 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/c6854b7c7/1af950b0539f44e094a6ed2f7566d5d5/FLAGff662f087
[2024-03-11 22:53:45,885 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/c6854b7c7/1af950b0539f44e094a6ed2f7566d5d5
[2024-03-11 22:53:45,888 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 22:53:45,889 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 22:53:45,890 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 22:53:45,890 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 22:53:45,893 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 22:53:45,893 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:53:45" (1/1) ...
[2024-03-11 22:53:45,894 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e95a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:45, skipping insertion in model container
[2024-03-11 22:53:45,894 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:53:45" (1/1) ...
[2024-03-11 22:53:45,900 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 22:53:45,935 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 22:53:46,058 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:53:46,197 WARN  L623        FunctionHandler]: Unknown extern function sem_wait
[2024-03-11 22:53:46,205 WARN  L623        FunctionHandler]: Unknown extern function sem_post
[2024-03-11 22:53:46,207 WARN  L623        FunctionHandler]: Unknown extern function sem_init
[2024-03-11 22:53:46,214 WARN  L623        FunctionHandler]: Unknown extern function sem_post
[2024-03-11 22:53:46,217 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:53:46,224 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 22:53:46,234 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:53:46,251 WARN  L623        FunctionHandler]: Unknown extern function sem_wait
[2024-03-11 22:53:46,252 WARN  L623        FunctionHandler]: Unknown extern function sem_post
[2024-03-11 22:53:46,253 WARN  L623        FunctionHandler]: Unknown extern function sem_init
[2024-03-11 22:53:46,256 WARN  L623        FunctionHandler]: Unknown extern function sem_post
[2024-03-11 22:53:46,259 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:53:46,299 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 22:53:46,300 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46 WrapperNode
[2024-03-11 22:53:46,300 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 22:53:46,300 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 22:53:46,301 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 22:53:46,301 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 22:53:46,306 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,320 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,338 INFO  L138                Inliner]: procedures = 278, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99
[2024-03-11 22:53:46,338 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 22:53:46,339 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 22:53:46,339 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 22:53:46,339 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 22:53:46,346 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,346 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,350 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,350 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,356 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,358 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,360 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,361 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,363 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 22:53:46,364 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 22:53:46,364 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 22:53:46,364 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 22:53:46,364 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (1/1) ...
[2024-03-11 22:53:46,369 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:53:46,376 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:53:46,397 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)
[2024-03-11 22:53:46,403 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
[2024-03-11 22:53:46,425 INFO  L130     BoogieDeclarations]: Found specification of procedure sem_init
[2024-03-11 22:53:46,425 INFO  L130     BoogieDeclarations]: Found specification of procedure sem_post
[2024-03-11 22:53:46,425 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 22:53:46,425 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 22:53:46,425 INFO  L130     BoogieDeclarations]: Found specification of procedure sem_wait
[2024-03-11 22:53:46,426 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 22:53:46,426 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 22:53:46,426 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 22:53:46,426 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 22:53:46,426 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 22:53:46,426 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-11 22:53:46,426 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-11 22:53:46,426 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 22:53:46,440 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 22:53:46,440 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 22:53:46,440 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 22:53:46,442 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 22:53:46,585 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 22:53:46,586 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 22:53:46,794 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 22:53:46,801 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 22:53:46,801 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 22:53:46,803 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:53:46 BoogieIcfgContainer
[2024-03-11 22:53:46,803 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 22:53:46,804 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 22:53:46,805 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 22:53:46,807 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 22:53:46,807 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 10:53:45" (1/3) ...
[2024-03-11 22:53:46,807 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbd8325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:53:46, skipping insertion in model container
[2024-03-11 22:53:46,807 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:53:46" (2/3) ...
[2024-03-11 22:53:46,808 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbd8325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:53:46, skipping insertion in model container
[2024-03-11 22:53:46,808 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:53:46" (3/3) ...
[2024-03-11 22:53:46,809 INFO  L112   eAbstractionObserver]: Analyzing ICFG semaphore-posix-race.i
[2024-03-11 22:53:46,814 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 22:53:46,821 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 22:53:46,821 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-11 22:53:46,821 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 22:53:46,861 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 22:53:46,888 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 126 transitions, 260 flow
[2024-03-11 22:53:46,938 INFO  L130       PetriNetUnfolder]: 6/175 cut-off events.
[2024-03-11 22:53:46,938 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:53:46,942 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 175 events. 6/175 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 309 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. 
[2024-03-11 22:53:46,942 INFO  L82        GeneralOperation]: Start removeDead. Operand has 125 places, 126 transitions, 260 flow
[2024-03-11 22:53:46,946 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 125 places, 126 transitions, 260 flow
[2024-03-11 22:53:46,948 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:53:46,956 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 126 transitions, 260 flow
[2024-03-11 22:53:46,957 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 126 transitions, 260 flow
[2024-03-11 22:53:46,958 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 126 transitions, 260 flow
[2024-03-11 22:53:46,986 INFO  L130       PetriNetUnfolder]: 6/175 cut-off events.
[2024-03-11 22:53:46,986 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:53:46,987 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 175 events. 6/175 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 309 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. 
[2024-03-11 22:53:46,988 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1904
[2024-03-11 22:53:52,449 INFO  L134        LiptonReduction]: Checked pairs total: 1454
[2024-03-11 22:53:52,449 INFO  L136        LiptonReduction]: Total number of compositions: 131
[2024-03-11 22:53:52,462 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:53:52,467 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;@2d157b85, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:53:52,468 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-11 22:53:52,469 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2024-03-11 22:53:52,469 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:53:52,469 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:53:52,470 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 22:53:52,470 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:53:52,474 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:53:52,474 INFO  L85        PathProgramCache]: Analyzing trace with hash 14507, now seen corresponding path program 1 times
[2024-03-11 22:53:52,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:53:52,481 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923324763]
[2024-03-11 22:53:52,481 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:53:52,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:53:52,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:53:52,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:53:52,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:53:52,603 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923324763]
[2024-03-11 22:53:52,603 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923324763] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:53:52,604 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:53:52,604 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 22:53:52,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104617578]
[2024-03-11 22:53:52,605 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:53:52,611 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 22:53:52,611 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:53:52,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 22:53:52,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 22:53:52,629 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 257
[2024-03-11 22:53:52,631 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 40 flow. Second operand  has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:52,631 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:53:52,631 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 257
[2024-03-11 22:53:52,631 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:53:52,661 INFO  L130       PetriNetUnfolder]: 6/25 cut-off events.
[2024-03-11 22:53:52,661 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:53:52,661 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56 conditions, 25 events. 6/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 44 event pairs, 5 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 32. Up to 25 conditions per place. 
[2024-03-11 22:53:52,662 INFO  L137   encePairwiseOnDemand]: 252/257 looper letters, 5 selfloop transitions, 0 changer transitions 5/11 dead transitions.
[2024-03-11 22:53:52,662 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 11 transitions, 50 flow
[2024-03-11 22:53:52,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 22:53:52,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 22:53:52,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 257 transitions.
[2024-03-11 22:53:52,674 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-03-11 22:53:52,674 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 257 transitions.
[2024-03-11 22:53:52,675 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 257 transitions.
[2024-03-11 22:53:52,676 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:53:52,678 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 257 transitions.
[2024-03-11 22:53:52,680 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:52,684 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:52,684 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:52,685 INFO  L175             Difference]: Start difference. First operand has 18 places, 16 transitions, 40 flow. Second operand 2 states and 257 transitions.
[2024-03-11 22:53:52,686 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 11 transitions, 50 flow
[2024-03-11 22:53:52,688 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 11 transitions, 50 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:53:52,689 INFO  L231             Difference]: Finished difference. Result has 14 places, 6 transitions, 17 flow
[2024-03-11 22:53:52,690 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=17, PETRI_PLACES=14, PETRI_TRANSITIONS=6}
[2024-03-11 22:53:52,693 INFO  L288   CegarLoopForPetriNet]: 18 programPoint places, -4 predicate places.
[2024-03-11 22:53:52,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 14 places, 6 transitions, 17 flow
[2024-03-11 22:53:52,694 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:52,694 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:53:52,694 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2024-03-11 22:53:52,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 22:53:52,695 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:53:52,695 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:53:52,695 INFO  L85        PathProgramCache]: Analyzing trace with hash 531872456, now seen corresponding path program 1 times
[2024-03-11 22:53:52,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:53:52,696 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488706178]
[2024-03-11 22:53:52,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:53:52,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:53:52,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:53:52,752 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:53:52,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:53:52,800 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:53:52,801 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:53:52,802 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-11 22:53:52,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-11 22:53:52,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-11 22:53:52,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-11 22:53:52,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-11 22:53:52,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-11 22:53:52,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-11 22:53:52,805 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 22:53:52,805 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1]
[2024-03-11 22:53:52,807 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:53:52,807 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 22:53:52,820 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 22:53:52,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 145 transitions, 308 flow
[2024-03-11 22:53:52,862 INFO  L130       PetriNetUnfolder]: 11/293 cut-off events.
[2024-03-11 22:53:52,862 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:53:52,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 307 conditions, 293 events. 11/293 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 665 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. 
[2024-03-11 22:53:52,863 INFO  L82        GeneralOperation]: Start removeDead. Operand has 145 places, 145 transitions, 308 flow
[2024-03-11 22:53:52,864 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 145 transitions, 308 flow
[2024-03-11 22:53:52,864 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:53:52,864 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 145 transitions, 308 flow
[2024-03-11 22:53:52,864 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 145 transitions, 308 flow
[2024-03-11 22:53:52,865 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 145 transitions, 308 flow
[2024-03-11 22:53:52,887 INFO  L130       PetriNetUnfolder]: 11/293 cut-off events.
[2024-03-11 22:53:52,887 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:53:52,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 307 conditions, 293 events. 11/293 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 665 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. 
[2024-03-11 22:53:52,890 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4828
[2024-03-11 22:53:58,343 INFO  L134        LiptonReduction]: Checked pairs total: 7036
[2024-03-11 22:53:58,343 INFO  L136        LiptonReduction]: Total number of compositions: 136
[2024-03-11 22:53:58,345 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:53:58,346 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;@2d157b85, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:53:58,346 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-11 22:53:58,347 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2024-03-11 22:53:58,347 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:53:58,347 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:53:58,347 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 22:53:58,348 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)] ===
[2024-03-11 22:53:58,348 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:53:58,348 INFO  L85        PathProgramCache]: Analyzing trace with hash 24115, now seen corresponding path program 1 times
[2024-03-11 22:53:58,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:53:58,348 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597726911]
[2024-03-11 22:53:58,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:53:58,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:53:58,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:53:58,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:53:58,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:53:58,370 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597726911]
[2024-03-11 22:53:58,371 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597726911] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:53:58,371 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:53:58,371 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 22:53:58,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712264578]
[2024-03-11 22:53:58,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:53:58,371 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 22:53:58,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:53:58,372 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 22:53:58,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 22:53:58,373 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 281
[2024-03-11 22:53:58,373 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 70 flow. Second operand  has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,373 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:53:58,373 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 281
[2024-03-11 22:53:58,373 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:53:58,426 INFO  L130       PetriNetUnfolder]: 122/282 cut-off events.
[2024-03-11 22:53:58,426 INFO  L131       PetriNetUnfolder]: For 25/25 co-relation queries the response was YES.
[2024-03-11 22:53:58,427 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 549 conditions, 282 events. 122/282 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1237 event pairs, 117 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 147. Up to 238 conditions per place. 
[2024-03-11 22:53:58,428 INFO  L137   encePairwiseOnDemand]: 277/281 looper letters, 16 selfloop transitions, 0 changer transitions 0/22 dead transitions.
[2024-03-11 22:53:58,428 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 94 flow
[2024-03-11 22:53:58,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 22:53:58,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 22:53:58,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions.
[2024-03-11 22:53:58,431 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5266903914590747
[2024-03-11 22:53:58,431 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 296 transitions.
[2024-03-11 22:53:58,431 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions.
[2024-03-11 22:53:58,432 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:53:58,432 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions.
[2024-03-11 22:53:58,433 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,434 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,435 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,435 INFO  L175             Difference]: Start difference. First operand has 29 places, 26 transitions, 70 flow. Second operand 2 states and 296 transitions.
[2024-03-11 22:53:58,435 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 94 flow
[2024-03-11 22:53:58,436 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:53:58,436 INFO  L231             Difference]: Finished difference. Result has 26 places, 22 transitions, 62 flow
[2024-03-11 22:53:58,436 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=26, PETRI_TRANSITIONS=22}
[2024-03-11 22:53:58,437 INFO  L288   CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places.
[2024-03-11 22:53:58,437 INFO  L495      AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 62 flow
[2024-03-11 22:53:58,437 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,438 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:53:58,438 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 22:53:58,438 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 22:53:58,438 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:53:58,438 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:53:58,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 813068135, now seen corresponding path program 1 times
[2024-03-11 22:53:58,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:53:58,439 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367659860]
[2024-03-11 22:53:58,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:53:58,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:53:58,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:53:58,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:53:58,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:53:58,478 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367659860]
[2024-03-11 22:53:58,478 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367659860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:53:58,478 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:53:58,478 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:53:58,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605866959]
[2024-03-11 22:53:58,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:53:58,479 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:53:58,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:53:58,480 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:53:58,480 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:53:58,493 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281
[2024-03-11 22:53:58,494 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 62 flow. Second operand  has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,494 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:53:58,494 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281
[2024-03-11 22:53:58,494 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:53:58,600 INFO  L130       PetriNetUnfolder]: 208/427 cut-off events.
[2024-03-11 22:53:58,600 INFO  L131       PetriNetUnfolder]: For 35/35 co-relation queries the response was YES.
[2024-03-11 22:53:58,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 850 conditions, 427 events. 208/427 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1867 event pairs, 147 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 845. Up to 316 conditions per place. 
[2024-03-11 22:53:58,602 INFO  L137   encePairwiseOnDemand]: 277/281 looper letters, 25 selfloop transitions, 3 changer transitions 2/34 dead transitions.
[2024-03-11 22:53:58,602 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 154 flow
[2024-03-11 22:53:58,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:53:58,603 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:53:58,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions.
[2024-03-11 22:53:58,604 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5065243179122183
[2024-03-11 22:53:58,604 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 427 transitions.
[2024-03-11 22:53:58,604 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions.
[2024-03-11 22:53:58,605 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:53:58,605 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions.
[2024-03-11 22:53:58,606 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,608 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,608 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,608 INFO  L175             Difference]: Start difference. First operand has 26 places, 22 transitions, 62 flow. Second operand 3 states and 427 transitions.
[2024-03-11 22:53:58,609 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 154 flow
[2024-03-11 22:53:58,609 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:53:58,610 INFO  L231             Difference]: Finished difference. Result has 29 places, 24 transitions, 81 flow
[2024-03-11 22:53:58,610 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=29, PETRI_TRANSITIONS=24}
[2024-03-11 22:53:58,611 INFO  L288   CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places.
[2024-03-11 22:53:58,611 INFO  L495      AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 81 flow
[2024-03-11 22:53:58,611 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,611 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:53:58,611 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:53:58,611 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 22:53:58,611 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:53:58,612 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:53:58,612 INFO  L85        PathProgramCache]: Analyzing trace with hash 932922724, now seen corresponding path program 1 times
[2024-03-11 22:53:58,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:53:58,612 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373814248]
[2024-03-11 22:53:58,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:53:58,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:53:58,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:53:58,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 22:53:58,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:53:58,648 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373814248]
[2024-03-11 22:53:58,648 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373814248] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:53:58,648 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:53:58,648 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:53:58,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29447572]
[2024-03-11 22:53:58,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:53:58,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:53:58,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:53:58,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:53:58,649 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:53:58,661 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281
[2024-03-11 22:53:58,662 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 81 flow. Second operand  has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,662 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:53:58,662 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281
[2024-03-11 22:53:58,662 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:53:58,750 INFO  L130       PetriNetUnfolder]: 217/430 cut-off events.
[2024-03-11 22:53:58,750 INFO  L131       PetriNetUnfolder]: For 139/143 co-relation queries the response was YES.
[2024-03-11 22:53:58,752 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 430 events. 217/430 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1792 event pairs, 149 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 1031. Up to 342 conditions per place. 
[2024-03-11 22:53:58,753 INFO  L137   encePairwiseOnDemand]: 277/281 looper letters, 25 selfloop transitions, 4 changer transitions 2/35 dead transitions.
[2024-03-11 22:53:58,753 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 173 flow
[2024-03-11 22:53:58,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:53:58,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:53:58,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions.
[2024-03-11 22:53:58,755 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.505338078291815
[2024-03-11 22:53:58,755 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 426 transitions.
[2024-03-11 22:53:58,755 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions.
[2024-03-11 22:53:58,756 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:53:58,756 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions.
[2024-03-11 22:53:58,758 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,762 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,763 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,763 INFO  L175             Difference]: Start difference. First operand has 29 places, 24 transitions, 81 flow. Second operand 3 states and 426 transitions.
[2024-03-11 22:53:58,764 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 173 flow
[2024-03-11 22:53:58,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:53:58,768 INFO  L231             Difference]: Finished difference. Result has 31 places, 26 transitions, 102 flow
[2024-03-11 22:53:58,768 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=31, PETRI_TRANSITIONS=26}
[2024-03-11 22:53:58,770 INFO  L288   CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places.
[2024-03-11 22:53:58,770 INFO  L495      AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 102 flow
[2024-03-11 22:53:58,770 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:58,771 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:53:58,771 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2024-03-11 22:53:58,771 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 22:53:58,771 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:53:58,772 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:53:58,772 INFO  L85        PathProgramCache]: Analyzing trace with hash -1151097427, now seen corresponding path program 1 times
[2024-03-11 22:53:58,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:53:58,773 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219890444]
[2024-03-11 22:53:58,773 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:53:58,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:53:58,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:53:58,824 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:53:58,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:53:58,860 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:53:58,860 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:53:58,861 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2024-03-11 22:53:58,862 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-11 22:53:58,863 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-11 22:53:58,863 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2024-03-11 22:53:58,863 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-11 22:53:58,863 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-11 22:53:58,864 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-11 22:53:58,864 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-11 22:53:58,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 22:53:58,864 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-11 22:53:58,865 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:53:58,865 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-11 22:53:58,888 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-11 22:53:58,894 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 165 places, 164 transitions, 358 flow
[2024-03-11 22:53:58,933 INFO  L130       PetriNetUnfolder]: 21/490 cut-off events.
[2024-03-11 22:53:58,934 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-03-11 22:53:58,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 518 conditions, 490 events. 21/490 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1416 event pairs, 1 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 301. Up to 16 conditions per place. 
[2024-03-11 22:53:58,935 INFO  L82        GeneralOperation]: Start removeDead. Operand has 165 places, 164 transitions, 358 flow
[2024-03-11 22:53:58,936 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 165 places, 164 transitions, 358 flow
[2024-03-11 22:53:58,936 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:53:58,937 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 164 transitions, 358 flow
[2024-03-11 22:53:58,938 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 164 transitions, 358 flow
[2024-03-11 22:53:58,938 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 165 places, 164 transitions, 358 flow
[2024-03-11 22:53:58,999 INFO  L130       PetriNetUnfolder]: 21/490 cut-off events.
[2024-03-11 22:53:59,000 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-03-11 22:53:59,000 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 518 conditions, 490 events. 21/490 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1416 event pairs, 1 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 301. Up to 16 conditions per place. 
[2024-03-11 22:53:59,007 INFO  L119        LiptonReduction]: Number of co-enabled transitions 8262
[2024-03-11 22:54:04,149 INFO  L134        LiptonReduction]: Checked pairs total: 12240
[2024-03-11 22:54:04,149 INFO  L136        LiptonReduction]: Total number of compositions: 152
[2024-03-11 22:54:04,151 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:54:04,151 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;@2d157b85, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:54:04,151 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-11 22:54:04,153 INFO  L130       PetriNetUnfolder]: 0/2 cut-off events.
[2024-03-11 22:54:04,153 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:54:04,153 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:04,153 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2024-03-11 22:54:04,153 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)] ===
[2024-03-11 22:54:04,153 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:04,153 INFO  L85        PathProgramCache]: Analyzing trace with hash 34826, now seen corresponding path program 1 times
[2024-03-11 22:54:04,153 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:04,153 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010475075]
[2024-03-11 22:54:04,154 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:04,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:04,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:04,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:04,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:04,164 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010475075]
[2024-03-11 22:54:04,165 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010475075] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:04,165 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:04,165 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-03-11 22:54:04,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826276046]
[2024-03-11 22:54:04,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:04,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 22:54:04,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:04,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 22:54:04,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 22:54:04,166 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 316
[2024-03-11 22:54:04,166 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 94 flow. Second operand  has 2 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,166 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:04,167 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 316
[2024-03-11 22:54:04,167 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:04,336 INFO  L130       PetriNetUnfolder]: 1241/2159 cut-off events.
[2024-03-11 22:54:04,336 INFO  L131       PetriNetUnfolder]: For 277/277 co-relation queries the response was YES.
[2024-03-11 22:54:04,338 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4296 conditions, 2159 events. 1241/2159 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11540 event pairs, 1210 based on Foata normal form. 0/1948 useless extension candidates. Maximal degree in co-relation 718. Up to 1932 conditions per place. 
[2024-03-11 22:54:04,345 INFO  L137   encePairwiseOnDemand]: 312/316 looper letters, 22 selfloop transitions, 0 changer transitions 0/28 dead transitions.
[2024-03-11 22:54:04,345 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 130 flow
[2024-03-11 22:54:04,345 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 22:54:04,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 22:54:04,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 336 transitions.
[2024-03-11 22:54:04,346 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5316455696202531
[2024-03-11 22:54:04,346 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 336 transitions.
[2024-03-11 22:54:04,346 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 336 transitions.
[2024-03-11 22:54:04,346 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:04,347 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 336 transitions.
[2024-03-11 22:54:04,347 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 168.0) internal successors, (336), 2 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,348 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,349 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,349 INFO  L175             Difference]: Start difference. First operand has 36 places, 32 transitions, 94 flow. Second operand 2 states and 336 transitions.
[2024-03-11 22:54:04,349 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 130 flow
[2024-03-11 22:54:04,350 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:54:04,350 INFO  L231             Difference]: Finished difference. Result has 33 places, 28 transitions, 86 flow
[2024-03-11 22:54:04,350 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=33, PETRI_TRANSITIONS=28}
[2024-03-11 22:54:04,351 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places.
[2024-03-11 22:54:04,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 86 flow
[2024-03-11 22:54:04,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,351 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:04,351 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:04,351 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 22:54:04,352 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:54:04,352 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:04,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 2139518719, now seen corresponding path program 1 times
[2024-03-11 22:54:04,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:04,352 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317172024]
[2024-03-11 22:54:04,352 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:04,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:04,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:04,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:04,374 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:04,374 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317172024]
[2024-03-11 22:54:04,374 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317172024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:04,374 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:04,374 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:04,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271763470]
[2024-03-11 22:54:04,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:04,375 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:04,375 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:04,375 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:04,375 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:04,389 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 316
[2024-03-11 22:54:04,390 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 86 flow. Second operand  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,390 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:04,390 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 316
[2024-03-11 22:54:04,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:04,657 INFO  L130       PetriNetUnfolder]: 1697/2841 cut-off events.
[2024-03-11 22:54:04,657 INFO  L131       PetriNetUnfolder]: For 348/348 co-relation queries the response was YES.
[2024-03-11 22:54:04,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5693 conditions, 2841 events. 1697/2841 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15585 event pairs, 1246 based on Foata normal form. 0/2446 useless extension candidates. Maximal degree in co-relation 5687. Up to 2214 conditions per place. 
[2024-03-11 22:54:04,669 INFO  L137   encePairwiseOnDemand]: 311/316 looper letters, 36 selfloop transitions, 4 changer transitions 0/45 dead transitions.
[2024-03-11 22:54:04,669 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 218 flow
[2024-03-11 22:54:04,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:04,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:04,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions.
[2024-03-11 22:54:04,671 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5116033755274262
[2024-03-11 22:54:04,671 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 485 transitions.
[2024-03-11 22:54:04,671 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions.
[2024-03-11 22:54:04,672 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:04,672 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions.
[2024-03-11 22:54:04,673 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,675 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 316.0) internal successors, (1264), 4 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,675 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 316.0) internal successors, (1264), 4 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,676 INFO  L175             Difference]: Start difference. First operand has 33 places, 28 transitions, 86 flow. Second operand 3 states and 485 transitions.
[2024-03-11 22:54:04,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 218 flow
[2024-03-11 22:54:04,676 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:54:04,677 INFO  L231             Difference]: Finished difference. Result has 36 places, 31 transitions, 112 flow
[2024-03-11 22:54:04,677 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=36, PETRI_TRANSITIONS=31}
[2024-03-11 22:54:04,678 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places.
[2024-03-11 22:54:04,678 INFO  L495      AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 112 flow
[2024-03-11 22:54:04,678 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,678 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:04,678 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:04,679 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-11 22:54:04,679 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:54:04,679 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:04,679 INFO  L85        PathProgramCache]: Analyzing trace with hash -439047279, now seen corresponding path program 1 times
[2024-03-11 22:54:04,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:04,679 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909710580]
[2024-03-11 22:54:04,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:04,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:04,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:04,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 22:54:04,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:04,709 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909710580]
[2024-03-11 22:54:04,709 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909710580] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:54:04,709 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:54:04,709 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 22:54:04,709 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863586961]
[2024-03-11 22:54:04,710 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:54:04,710 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 22:54:04,710 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:04,710 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 22:54:04,710 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 22:54:04,725 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 316
[2024-03-11 22:54:04,726 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 112 flow. Second operand  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:04,726 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:04,726 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 316
[2024-03-11 22:54:04,726 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:04,994 INFO  L130       PetriNetUnfolder]: 2007/3363 cut-off events.
[2024-03-11 22:54:04,994 INFO  L131       PetriNetUnfolder]: For 1193/1246 co-relation queries the response was YES.
[2024-03-11 22:54:04,998 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7879 conditions, 3363 events. 2007/3363 cut-off events. For 1193/1246 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19160 event pairs, 1381 based on Foata normal form. 0/2863 useless extension candidates. Maximal degree in co-relation 7871. Up to 2668 conditions per place. 
[2024-03-11 22:54:05,009 INFO  L137   encePairwiseOnDemand]: 311/316 looper letters, 37 selfloop transitions, 5 changer transitions 0/47 dead transitions.
[2024-03-11 22:54:05,009 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 248 flow
[2024-03-11 22:54:05,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 22:54:05,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 22:54:05,011 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions.
[2024-03-11 22:54:05,011 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.510548523206751
[2024-03-11 22:54:05,011 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 484 transitions.
[2024-03-11 22:54:05,011 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions.
[2024-03-11 22:54:05,011 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:05,012 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions.
[2024-03-11 22:54:05,012 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:05,014 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 316.0) internal successors, (1264), 4 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:05,014 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 316.0) internal successors, (1264), 4 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:05,015 INFO  L175             Difference]: Start difference. First operand has 36 places, 31 transitions, 112 flow. Second operand 3 states and 484 transitions.
[2024-03-11 22:54:05,015 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 248 flow
[2024-03-11 22:54:05,017 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:54:05,017 INFO  L231             Difference]: Finished difference. Result has 38 places, 34 transitions, 141 flow
[2024-03-11 22:54:05,018 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=38, PETRI_TRANSITIONS=34}
[2024-03-11 22:54:05,018 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places.
[2024-03-11 22:54:05,018 INFO  L495      AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 141 flow
[2024-03-11 22:54:05,018 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:05,019 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:05,019 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:54:05,019 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-11 22:54:05,019 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:54:05,019 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:05,019 INFO  L85        PathProgramCache]: Analyzing trace with hash -1660501134, now seen corresponding path program 1 times
[2024-03-11 22:54:05,019 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:05,019 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053668916]
[2024-03-11 22:54:05,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:05,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:05,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:54:05,036 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:54:05,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:54:05,049 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:54:05,050 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:54:05,050 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining)
[2024-03-11 22:54:05,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-11 22:54:05,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-11 22:54:05,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-11 22:54:05,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-11 22:54:05,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining)
[2024-03-11 22:54:05,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-11 22:54:05,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-11 22:54:05,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-11 22:54:05,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-11 22:54:05,051 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-11 22:54:05,054 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances
[2024-03-11 22:54:05,054 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-11 22:54:05,082 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 10:54:05 BasicIcfg
[2024-03-11 22:54:05,082 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-11 22:54:05,082 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-11 22:54:05,083 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2024-03-11 22:54:05,083 INFO  L275        PluginConnector]: Witness Printer initialized
[2024-03-11 22:54:05,083 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:53:46" (3/4) ...
[2024-03-11 22:54:05,086 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-11 22:54:05,086 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-11 22:54:05,087 INFO  L158              Benchmark]: Toolchain (without parser) took 19197.70ms. Allocated memory was 132.1MB in the beginning and 308.3MB in the end (delta: 176.2MB). Free memory was 100.1MB in the beginning and 109.9MB in the end (delta: -9.8MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB.
[2024-03-11 22:54:05,087 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory was 64.7MB in the beginning and 64.6MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 22:54:05,087 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 410.40ms. Allocated memory is still 132.1MB. Free memory was 99.8MB in the beginning and 70.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
[2024-03-11 22:54:05,088 INFO  L158              Benchmark]: Boogie Procedure Inliner took 37.91ms. Allocated memory is still 132.1MB. Free memory was 70.5MB in the beginning and 67.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-11 22:54:05,088 INFO  L158              Benchmark]: Boogie Preprocessor took 24.24ms. Allocated memory is still 132.1MB. Free memory was 67.8MB in the beginning and 66.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-11 22:54:05,089 INFO  L158              Benchmark]: RCFGBuilder took 439.37ms. Allocated memory is still 132.1MB. Free memory was 66.0MB in the beginning and 91.7MB in the end (delta: -25.8MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB.
[2024-03-11 22:54:05,089 INFO  L158              Benchmark]: TraceAbstraction took 18277.53ms. Allocated memory was 132.1MB in the beginning and 308.3MB in the end (delta: 176.2MB). Free memory was 90.7MB in the beginning and 111.0MB in the end (delta: -20.3MB). Peak memory consumption was 157.0MB. Max. memory is 16.1GB.
[2024-03-11 22:54:05,089 INFO  L158              Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 308.3MB. Free memory was 111.0MB in the beginning and 109.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-11 22:54:05,091 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory was 64.7MB in the beginning and 64.6MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 410.40ms. Allocated memory is still 132.1MB. Free memory was 99.8MB in the beginning and 70.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 37.91ms. Allocated memory is still 132.1MB. Free memory was 70.5MB in the beginning and 67.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 24.24ms. Allocated memory is still 132.1MB. Free memory was 67.8MB in the beginning and 66.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 439.37ms. Allocated memory is still 132.1MB. Free memory was 66.0MB in the beginning and 91.7MB in the end (delta: -25.8MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 18277.53ms. Allocated memory was 132.1MB in the beginning and 308.3MB in the end (delta: 176.2MB). Free memory was 90.7MB in the beginning and 111.0MB in the end (delta: -20.3MB). Peak memory consumption was 157.0MB. Max. memory is 16.1GB.
 * Witness Printer took 3.45ms. Allocated memory is still 308.3MB. Free memory was 111.0MB in the beginning and 109.9MB in the end (delta: 1.0MB). 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: 5.5s, 125 PlacesBefore, 18 PlacesAfterwards, 126 TransitionsBefore, 16 TransitionsAfterwards, 1904 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 131 TotalNumberOfCompositions, 1454 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1454, independent: 1454, independent conditional: 0, independent unconditional: 1454, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 994, independent: 994, independent conditional: 0, independent unconditional: 994, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1454, independent: 460, independent conditional: 0, independent unconditional: 460, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 994, unknown conditional: 0, unknown unconditional: 994] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 5.5s, 145 PlacesBefore, 29 PlacesAfterwards, 145 TransitionsBefore, 26 TransitionsAfterwards, 4828 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 136 TotalNumberOfCompositions, 7036 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5061, independent: 4961, independent conditional: 0, independent unconditional: 4961, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2572, independent: 2554, independent conditional: 0, independent unconditional: 2554, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5061, independent: 2407, independent conditional: 0, independent unconditional: 2407, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 2572, unknown conditional: 0, unknown unconditional: 2572] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 5.2s, 165 PlacesBefore, 36 PlacesAfterwards, 164 TransitionsBefore, 32 TransitionsAfterwards, 8262 CoEnabledTransitionPairs, 8 FixpointIterations, 47 TrivialSequentialCompositions, 94 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 152 TotalNumberOfCompositions, 12240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8780, independent: 8619, independent conditional: 0, independent unconditional: 8619, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4284, independent: 4261, independent conditional: 0, independent unconditional: 4261, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8780, independent: 4358, independent conditional: 0, independent unconditional: 4358, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 4284, unknown conditional: 0, unknown unconditional: 4284] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 1038]: Data race detected
    Data race detected
The following path leads to a data race: 
[L1034]               0  int data = 0;
[L1035]               0  sem_t data_sem;
[L1044]               0  int breads_total = __VERIFIER_nondet_int();
[L1045]  CALL         0  assume_abort_if_not(breads_total >= 0)
[L1031]  COND FALSE   0  !(!cond)
[L1045]  RET          0  assume_abort_if_not(breads_total >= 0)
[L1046]               0  pthread_t *tids = malloc(breads_total * sizeof(pthread_t));
[L1046]               0  pthread_t *tids = malloc(breads_total * sizeof(pthread_t));
[L1047]               0  int i = 0;
         VAL             [breads_total=5, data=0, data_sem={1:0}, i=0, tids={17:0}]
[L1047]  COND TRUE    0  i < breads_total
[L1048]  EXPR         0  \read(*tids)
[L1048]  EXPR         0  tids[i]
[L1048]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [\read(*tids)={-2:0}, arg={0:0}, breads_total=5, data=0, data_sem={1:0}, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=-1, tids={17:0}]
[L1047]               0  i++
         VAL             [arg={0:0}, breads_total=5, data=0, data_sem={1:0}, i=1, tids={17:0}]
[L1047]  COND TRUE    0  i < breads_total
[L1048]  EXPR         0  \read(*tids)
[L1048]  EXPR         0  tids[i]
[L1038]               1  data = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=26, data_sem={1:0}]
[L1048]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [\read(*tids)={-2:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, breads_total=5, data=0, data = __VERIFIER_nondet_int()=26, data_sem={1:0}, i=1, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=0, tids={17:0}]
[L1038]               2  data = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=22, data_sem={1:0}]

Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements
	* C: tids[i] [1048]
	* C: tids[i] [1048]
	* C: tids[i] [1048]
	* C: tids[i] [1048]
and
	C: data = __VERIFIER_nondet_int() [1038]

  - UnprovableResult [Line: 1048]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1052]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1052]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1048]: 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. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 141 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 1 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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, 159 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: 6.0s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 9 mSDtfsCounter, 122 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=102occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances
    CFG has 5 procedures, 177 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: 6.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 22 mSDtfsCounter, 177 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=141occurred 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, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-03-11 22:54:05,138 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
