./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/per-thread-array-index-race-2.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/per-thread-array-index-race-2.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 588c01face7baa7cf65cc649c1ffef36a83824bf6956581c1ca3de7e95a23299
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 11:23:37,320 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 11:23:37,323 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 11:23:37,357 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 11:23:37,357 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 11:23:37,358 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 11:23:37,359 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 11:23:37,360 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 11:23:37,361 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 11:23:37,361 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 11:23:37,362 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 11:23:37,363 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 11:23:37,363 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 11:23:37,364 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 11:23:37,365 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 11:23:37,366 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 11:23:37,366 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 11:23:37,367 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 11:23:37,368 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 11:23:37,369 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 11:23:37,370 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 11:23:37,372 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 11:23:37,373 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 11:23:37,373 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 11:23:37,375 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 11:23:37,376 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 11:23:37,376 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 11:23:37,376 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 11:23:37,377 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 11:23:37,377 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 11:23:37,378 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 11:23:37,378 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 11:23:37,379 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 11:23:37,379 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 11:23:37,380 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 11:23:37,380 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 11:23:37,380 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 11:23:37,381 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 11:23:37,381 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 11:23:37,381 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 11:23:37,382 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 11:23:37,383 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 11:23:37,399 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 11:23:37,399 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 11:23:37,399 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 11:23:37,400 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 11:23:37,400 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 11:23:37,400 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 11:23:37,401 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 11:23:37,401 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 11:23:37,401 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 11:23:37,401 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 11:23:37,401 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 11:23:37,401 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 11:23:37,401 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 11:23:37,402 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 11:23:37,402 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 11:23:37,402 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 11:23:37,402 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 11:23:37,402 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 11:23:37,402 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 11:23:37,402 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 11:23:37,402 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 11:23:37,402 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 11:23:37,402 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 11:23:37,403 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 11:23:37,403 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 11:23:37,403 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 11:23:37,403 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 11:23:37,403 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 11:23:37,403 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 11:23:37,403 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 11:23:37,403 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 11:23:37,403 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 11:23:37,404 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 11:23:37,404 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 11:23:37,404 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 11:23:37,404 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 11:23:37,404 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 11:23:37,404 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 -> 588c01face7baa7cf65cc649c1ffef36a83824bf6956581c1ca3de7e95a23299
[2023-11-03 11:23:37,707 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 11:23:37,761 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 11:23:37,763 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 11:23:37,763 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 11:23:37,764 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 11:23:37,765 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i
[2023-11-03 11:23:39,370 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 11:23:39,628 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 11:23:39,629 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i
[2023-11-03 11:23:39,698 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/dddd2c927/b4964d73a6b045ffaecb378387e10303/FLAG3aeee5d5b
[2023-11-03 11:23:39,933 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/dddd2c927/b4964d73a6b045ffaecb378387e10303
[2023-11-03 11:23:39,936 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 11:23:39,938 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 11:23:39,939 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 11:23:39,939 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 11:23:39,943 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 11:23:39,943 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 11:23:39" (1/1) ...
[2023-11-03 11:23:39,944 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745c9635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:39, skipping insertion in model container
[2023-11-03 11:23:39,945 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 11:23:39" (1/1) ...
[2023-11-03 11:23:39,952 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 11:23:39,988 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 11:23:40,118 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 11:23:40,258 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 11:23:40,264 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 11:23:40,275 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 11:23:40,299 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 11:23:40,336 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 11:23:40,336 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40 WrapperNode
[2023-11-03 11:23:40,336 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 11:23:40,337 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 11:23:40,337 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 11:23:40,337 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 11:23:40,343 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,358 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,378 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2023-11-03 11:23:40,378 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 11:23:40,379 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 11:23:40,379 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 11:23:40,379 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 11:23:40,387 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,387 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,390 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,391 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,398 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,401 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,403 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,404 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,407 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 11:23:40,408 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 11:23:40,408 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 11:23:40,408 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 11:23:40,409 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (1/1) ...
[2023-11-03 11:23:40,414 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 11:23:40,437 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:23:40,483 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-03 11:23:40,486 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-03 11:23:40,554 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 11:23:40,554 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 11:23:40,554 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 11:23:40,554 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 11:23:40,555 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 11:23:40,555 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 11:23:40,555 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 11:23:40,555 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 11:23:40,555 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 11:23:40,556 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 11:23:40,556 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 11:23:40,557 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 11:23:40,697 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 11:23:40,699 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 11:23:40,901 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 11:23:40,908 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 11:23:40,908 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 11:23:40,910 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:23:40 BoogieIcfgContainer
[2023-11-03 11:23:40,910 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 11:23:40,912 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 11:23:40,912 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 11:23:41,021 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 11:23:41,022 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 11:23:39" (1/3) ...
[2023-11-03 11:23:41,023 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e3a230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 11:23:41, skipping insertion in model container
[2023-11-03 11:23:41,023 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:23:40" (2/3) ...
[2023-11-03 11:23:41,024 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e3a230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 11:23:41, skipping insertion in model container
[2023-11-03 11:23:41,024 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:23:40" (3/3) ...
[2023-11-03 11:23:41,026 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race-2.i
[2023-11-03 11:23:41,037 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 11:23:41,055 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 11:23:41,055 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-11-03 11:23:41,055 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 11:23:41,120 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 11:23:41,147 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2023-11-03 11:23:41,192 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2023-11-03 11:23:41,192 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 11:23:41,200 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 6/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-11-03 11:23:41,201 INFO  L82        GeneralOperation]: Start removeDead. Operand has 114 places, 115 transitions, 238 flow
[2023-11-03 11:23:41,207 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 114 places, 115 transitions, 238 flow
[2023-11-03 11:23:41,212 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 11:23:41,220 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 115 transitions, 238 flow
[2023-11-03 11:23:41,223 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 238 flow
[2023-11-03 11:23:41,223 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2023-11-03 11:23:41,249 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2023-11-03 11:23:41,250 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 11:23:41,250 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 6/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-11-03 11:23:41,252 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2052
[2023-11-03 11:23:43,613 INFO  L134        LiptonReduction]: Checked pairs total: 12265
[2023-11-03 11:23:43,613 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-11-03 11:23:43,626 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 11:23:43,631 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;@204fc40a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 11:23:43,631 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-11-03 11:23:43,633 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-11-03 11:23:43,633 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 11:23:43,633 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:43,633 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 11:23:43,634 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:23:43,638 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:43,638 INFO  L85        PathProgramCache]: Analyzing trace with hash 381, now seen corresponding path program 1 times
[2023-11-03 11:23:43,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:43,646 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976800452]
[2023-11-03 11:23:43,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:43,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:43,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:43,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:23:43,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:43,734 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976800452]
[2023-11-03 11:23:43,735 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976800452] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:43,735 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:43,735 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 11:23:43,736 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870726603]
[2023-11-03 11:23:43,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:43,743 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 11:23:43,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:43,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 11:23:43,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 11:23:43,764 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193
[2023-11-03 11:23:43,766 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:43,766 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:43,766 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193
[2023-11-03 11:23:43,767 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:43,850 INFO  L130       PetriNetUnfolder]: 33/213 cut-off events.
[2023-11-03 11:23:43,850 INFO  L131       PetriNetUnfolder]: For 4/7 co-relation queries the response was YES.
[2023-11-03 11:23:43,852 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 213 events. 33/213 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1010 event pairs, 32 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 250. Up to 88 conditions per place. 
[2023-11-03 11:23:43,853 INFO  L137   encePairwiseOnDemand]: 192/193 looper letters, 16 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2023-11-03 11:23:43,853 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 138 flow
[2023-11-03 11:23:43,855 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 11:23:43,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 11:23:43,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions.
[2023-11-03 11:23:43,864 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6139896373056994
[2023-11-03 11:23:43,865 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 237 transitions.
[2023-11-03 11:23:43,865 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions.
[2023-11-03 11:23:43,866 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:43,868 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions.
[2023-11-03 11:23:43,870 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:43,874 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:43,875 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:43,877 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 237 transitions.
[2023-11-03 11:23:43,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 138 flow
[2023-11-03 11:23:43,879 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:43,881 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2023-11-03 11:23:43,882 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=49}
[2023-11-03 11:23:43,885 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2023-11-03 11:23:43,885 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2023-11-03 11:23:43,886 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:43,886 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:43,886 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:43,886 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 11:23:43,886 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:23:43,887 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:43,887 INFO  L85        PathProgramCache]: Analyzing trace with hash -835068003, now seen corresponding path program 1 times
[2023-11-03 11:23:43,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:43,887 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052965275]
[2023-11-03 11:23:43,887 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:43,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:43,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:44,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:23:44,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:44,211 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052965275]
[2023-11-03 11:23:44,212 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052965275] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:44,212 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:44,212 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:23:44,212 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042550089]
[2023-11-03 11:23:44,213 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:44,214 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:23:44,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:44,215 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:23:44,215 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:23:44,448 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-11-03 11:23:44,449 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:44,449 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:44,449 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-11-03 11:23:44,449 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:44,727 INFO  L130       PetriNetUnfolder]: 245/703 cut-off events.
[2023-11-03 11:23:44,727 INFO  L131       PetriNetUnfolder]: For 7/9 co-relation queries the response was YES.
[2023-11-03 11:23:44,730 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 703 events. 245/703 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4008 event pairs, 86 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 1296. Up to 291 conditions per place. 
[2023-11-03 11:23:44,734 INFO  L137   encePairwiseOnDemand]: 170/193 looper letters, 61 selfloop transitions, 29 changer transitions 0/102 dead transitions.
[2023-11-03 11:23:44,734 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 395 flow
[2023-11-03 11:23:44,735 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:23:44,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:23:44,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions.
[2023-11-03 11:23:44,739 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5207253886010362
[2023-11-03 11:23:44,739 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 603 transitions.
[2023-11-03 11:23:44,739 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 603 transitions.
[2023-11-03 11:23:44,741 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:44,741 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 603 transitions.
[2023-11-03 11:23:44,743 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:44,746 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:44,746 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:44,747 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 603 transitions.
[2023-11-03 11:23:44,747 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 395 flow
[2023-11-03 11:23:44,748 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:44,749 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2023-11-03 11:23:44,750 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=78}
[2023-11-03 11:23:44,750 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2023-11-03 11:23:44,750 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2023-11-03 11:23:44,751 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:44,751 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:44,751 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:44,751 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 11:23:44,751 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:23:44,752 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:44,752 INFO  L85        PathProgramCache]: Analyzing trace with hash 1573274442, now seen corresponding path program 1 times
[2023-11-03 11:23:44,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:44,752 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338254817]
[2023-11-03 11:23:44,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:44,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:44,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:44,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:23:44,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:44,784 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338254817]
[2023-11-03 11:23:44,785 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338254817] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:44,785 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:44,785 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 11:23:44,785 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133315790]
[2023-11-03 11:23:44,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:44,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 11:23:44,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:44,787 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 11:23:44,787 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 11:23:44,804 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 193
[2023-11-03 11:23:44,804 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:44,804 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:44,804 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 193
[2023-11-03 11:23:44,805 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:44,891 INFO  L130       PetriNetUnfolder]: 122/485 cut-off events.
[2023-11-03 11:23:44,891 INFO  L131       PetriNetUnfolder]: For 111/116 co-relation queries the response was YES.
[2023-11-03 11:23:44,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 485 events. 122/485 cut-off events. For 111/116 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2711 event pairs, 10 based on Foata normal form. 11/468 useless extension candidates. Maximal degree in co-relation 1076. Up to 129 conditions per place. 
[2023-11-03 11:23:44,896 INFO  L137   encePairwiseOnDemand]: 189/193 looper letters, 24 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2023-11-03 11:23:44,896 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 392 flow
[2023-11-03 11:23:44,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 11:23:44,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 11:23:44,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions.
[2023-11-03 11:23:44,899 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5785837651122625
[2023-11-03 11:23:44,899 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 335 transitions.
[2023-11-03 11:23:44,899 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions.
[2023-11-03 11:23:44,899 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:44,899 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions.
[2023-11-03 11:23:44,900 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:44,902 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:44,903 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:44,903 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 335 transitions.
[2023-11-03 11:23:44,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 392 flow
[2023-11-03 11:23:44,907 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:44,909 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2023-11-03 11:23:44,909 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=78}
[2023-11-03 11:23:44,910 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2023-11-03 11:23:44,910 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2023-11-03 11:23:44,911 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:44,911 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:44,911 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:44,911 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 11:23:44,912 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:23:44,912 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:44,912 INFO  L85        PathProgramCache]: Analyzing trace with hash 348753171, now seen corresponding path program 1 times
[2023-11-03 11:23:44,913 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:44,913 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29769789]
[2023-11-03 11:23:44,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:44,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:44,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:45,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:23:45,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:45,170 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29769789]
[2023-11-03 11:23:45,170 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29769789] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:45,170 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:45,170 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:23:45,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121917398]
[2023-11-03 11:23:45,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:45,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:23:45,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:45,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:23:45,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:23:45,411 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193
[2023-11-03 11:23:45,412 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:45,412 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:45,412 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193
[2023-11-03 11:23:45,412 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:45,622 INFO  L130       PetriNetUnfolder]: 228/682 cut-off events.
[2023-11-03 11:23:45,622 INFO  L131       PetriNetUnfolder]: For 296/304 co-relation queries the response was YES.
[2023-11-03 11:23:45,623 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 682 events. 228/682 cut-off events. For 296/304 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3726 event pairs, 57 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 1748. Up to 360 conditions per place. 
[2023-11-03 11:23:45,625 INFO  L137   encePairwiseOnDemand]: 182/193 looper letters, 52 selfloop transitions, 33 changer transitions 8/128 dead transitions.
[2023-11-03 11:23:45,626 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 725 flow
[2023-11-03 11:23:45,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:23:45,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:23:45,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2023-11-03 11:23:45,628 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5483592400690847
[2023-11-03 11:23:45,628 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2023-11-03 11:23:45,628 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2023-11-03 11:23:45,629 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:45,629 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2023-11-03 11:23:45,632 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:45,635 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:45,636 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:45,636 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2023-11-03 11:23:45,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 725 flow
[2023-11-03 11:23:45,639 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:45,640 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2023-11-03 11:23:45,640 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=108}
[2023-11-03 11:23:45,641 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2023-11-03 11:23:45,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2023-11-03 11:23:45,642 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:45,642 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:45,642 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:45,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 11:23:45,642 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:23:45,642 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:45,643 INFO  L85        PathProgramCache]: Analyzing trace with hash -1543790880, now seen corresponding path program 1 times
[2023-11-03 11:23:45,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:45,643 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074234519]
[2023-11-03 11:23:45,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:45,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:45,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:45,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:23:45,874 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:45,874 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074234519]
[2023-11-03 11:23:45,875 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074234519] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:45,875 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:45,875 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:23:45,875 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462005321]
[2023-11-03 11:23:45,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:45,876 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:23:45,876 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:45,876 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:23:45,876 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:23:46,034 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193
[2023-11-03 11:23:46,035 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:46,035 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:46,035 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193
[2023-11-03 11:23:46,036 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:46,477 INFO  L130       PetriNetUnfolder]: 402/1014 cut-off events.
[2023-11-03 11:23:46,477 INFO  L131       PetriNetUnfolder]: For 761/769 co-relation queries the response was YES.
[2023-11-03 11:23:46,479 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1014 events. 402/1014 cut-off events. For 761/769 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6010 event pairs, 103 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 3282. Up to 729 conditions per place. 
[2023-11-03 11:23:46,483 INFO  L137   encePairwiseOnDemand]: 171/193 looper letters, 105 selfloop transitions, 76 changer transitions 24/218 dead transitions.
[2023-11-03 11:23:46,483 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 218 transitions, 1523 flow
[2023-11-03 11:23:46,484 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:23:46,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:23:46,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions.
[2023-11-03 11:23:46,485 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5474956822107081
[2023-11-03 11:23:46,485 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 634 transitions.
[2023-11-03 11:23:46,486 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions.
[2023-11-03 11:23:46,486 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:46,486 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions.
[2023-11-03 11:23:46,487 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:46,489 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:46,490 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:46,490 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 634 transitions.
[2023-11-03 11:23:46,490 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 218 transitions, 1523 flow
[2023-11-03 11:23:46,495 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 218 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:46,498 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2023-11-03 11:23:46,498 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=81, PETRI_TRANSITIONS=174}
[2023-11-03 11:23:46,499 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2023-11-03 11:23:46,499 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2023-11-03 11:23:46,499 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:46,499 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:46,500 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-11-03 11:23:46,500 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 11:23:46,500 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:23:46,500 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:46,500 INFO  L85        PathProgramCache]: Analyzing trace with hash -1557923308, now seen corresponding path program 1 times
[2023-11-03 11:23:46,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:46,500 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005348186]
[2023-11-03 11:23:46,501 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:46,501 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:46,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 11:23:46,532 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 11:23:46,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 11:23:46,567 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 11:23:46,568 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 11:23:46,569 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-11-03 11:23:46,571 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-11-03 11:23:46,571 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-11-03 11:23:46,571 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-11-03 11:23:46,571 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-11-03 11:23:46,572 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-11-03 11:23:46,572 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-11-03 11:23:46,572 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-11-03 11:23:46,572 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-11-03 11:23:46,572 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-11-03 11:23:46,572 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-11-03 11:23:46,573 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 11:23:46,573 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:46,575 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 11:23:46,575 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 11:23:46,595 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-03 11:23:46,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2023-11-03 11:23:46,618 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2023-11-03 11:23:46,618 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 11:23:46,619 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 289 events. 11/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. 
[2023-11-03 11:23:46,619 INFO  L82        GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 288 flow
[2023-11-03 11:23:46,620 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 135 places, 135 transitions, 288 flow
[2023-11-03 11:23:46,620 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 11:23:46,620 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 135 transitions, 288 flow
[2023-11-03 11:23:46,621 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 135 transitions, 288 flow
[2023-11-03 11:23:46,621 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2023-11-03 11:23:46,642 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2023-11-03 11:23:46,642 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 11:23:46,642 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 289 events. 11/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. 
[2023-11-03 11:23:46,645 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5220
[2023-11-03 11:23:48,580 INFO  L134        LiptonReduction]: Checked pairs total: 30411
[2023-11-03 11:23:48,580 INFO  L136        LiptonReduction]: Total number of compositions: 82
[2023-11-03 11:23:48,583 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 11:23:48,585 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;@204fc40a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 11:23:48,585 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-03 11:23:48,587 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-11-03 11:23:48,587 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 11:23:48,587 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:48,587 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 11:23:48,587 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:23:48,588 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:48,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 617, now seen corresponding path program 1 times
[2023-11-03 11:23:48,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:48,589 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404582509]
[2023-11-03 11:23:48,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:48,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:48,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:48,594 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:23:48,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:48,595 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404582509]
[2023-11-03 11:23:48,595 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404582509] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:48,595 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:48,595 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 11:23:48,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699459923]
[2023-11-03 11:23:48,595 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:48,596 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 11:23:48,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:48,596 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 11:23:48,596 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 11:23:48,596 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 217
[2023-11-03 11:23:48,597 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 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)
[2023-11-03 11:23:48,597 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:48,597 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 217
[2023-11-03 11:23:48,597 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:48,735 INFO  L130       PetriNetUnfolder]: 411/1257 cut-off events.
[2023-11-03 11:23:48,736 INFO  L131       PetriNetUnfolder]: For 71/158 co-relation queries the response was YES.
[2023-11-03 11:23:48,737 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1257 events. 411/1257 cut-off events. For 71/158 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8092 event pairs, 404 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 1664. Up to 731 conditions per place. 
[2023-11-03 11:23:48,740 INFO  L137   encePairwiseOnDemand]: 216/217 looper letters, 22 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2023-11-03 11:23:48,740 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 188 flow
[2023-11-03 11:23:48,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 11:23:48,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 11:23:48,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions.
[2023-11-03 11:23:48,741 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6428571428571429
[2023-11-03 11:23:48,742 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 279 transitions.
[2023-11-03 11:23:48,742 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 279 transitions.
[2023-11-03 11:23:48,742 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:48,742 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 279 transitions.
[2023-11-03 11:23:48,743 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:48,743 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:48,743 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:48,744 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 279 transitions.
[2023-11-03 11:23:48,744 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 188 flow
[2023-11-03 11:23:48,744 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:48,745 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2023-11-03 11:23:48,745 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2023-11-03 11:23:48,746 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2023-11-03 11:23:48,746 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2023-11-03 11:23:48,746 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 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)
[2023-11-03 11:23:48,746 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:48,746 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:48,746 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-03 11:23:48,746 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:23:48,747 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:48,747 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578260816, now seen corresponding path program 1 times
[2023-11-03 11:23:48,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:48,747 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886105574]
[2023-11-03 11:23:48,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:48,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:48,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:48,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:23:48,878 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:48,878 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886105574]
[2023-11-03 11:23:48,878 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886105574] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:48,878 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:48,878 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:23:48,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568651050]
[2023-11-03 11:23:48,879 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:48,879 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:23:48,879 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:48,879 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:23:48,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:23:49,066 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217
[2023-11-03 11:23:49,068 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:49,068 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:49,068 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217
[2023-11-03 11:23:49,068 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:49,974 INFO  L130       PetriNetUnfolder]: 5742/10965 cut-off events.
[2023-11-03 11:23:49,974 INFO  L131       PetriNetUnfolder]: For 239/274 co-relation queries the response was YES.
[2023-11-03 11:23:49,984 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20646 conditions, 10965 events. 5742/10965 cut-off events. For 239/274 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 81958 event pairs, 1527 based on Foata normal form. 16/10301 useless extension candidates. Maximal degree in co-relation 20641. Up to 5895 conditions per place. 
[2023-11-03 11:23:50,021 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 93 selfloop transitions, 48 changer transitions 0/158 dead transitions.
[2023-11-03 11:23:50,021 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 158 transitions, 627 flow
[2023-11-03 11:23:50,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:23:50,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:23:50,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions.
[2023-11-03 11:23:50,024 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5668202764976958
[2023-11-03 11:23:50,024 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 738 transitions.
[2023-11-03 11:23:50,024 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions.
[2023-11-03 11:23:50,024 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:50,025 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions.
[2023-11-03 11:23:50,026 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:50,028 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:50,028 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:50,028 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 738 transitions.
[2023-11-03 11:23:50,029 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 158 transitions, 627 flow
[2023-11-03 11:23:50,030 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:50,032 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2023-11-03 11:23:50,032 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-11-03 11:23:50,032 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-11-03 11:23:50,033 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2023-11-03 11:23:50,033 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:50,033 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:50,033 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:50,033 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-03 11:23:50,033 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:23:50,034 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:50,034 INFO  L85        PathProgramCache]: Analyzing trace with hash 933296301, now seen corresponding path program 1 times
[2023-11-03 11:23:50,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:50,034 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587306093]
[2023-11-03 11:23:50,034 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:50,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:50,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:50,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:23:50,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:50,059 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587306093]
[2023-11-03 11:23:50,059 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587306093] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:50,059 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:50,059 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 11:23:50,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995044342]
[2023-11-03 11:23:50,059 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:50,059 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 11:23:50,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:50,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 11:23:50,060 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 11:23:50,080 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2023-11-03 11:23:50,081 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:50,081 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:50,081 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2023-11-03 11:23:50,081 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:50,489 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_71| v_~datas~0.base_81)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_29 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_30| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_71))) (= |v_threadThread1of2ForFork0_#t~nondet4_30| (select .cse0 (+ .cse1 v_~datas~0.offset_71))) (= (select .cse0 (+ .cse1 v_~datas~0.offset_71 1)) |v_threadThread1of2ForFork0_#t~nondet4_30|) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#res.base_9| 0) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_71)) |v_threadThread1of2ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_71|, ~datas~0.base=v_~datas~0.base_81, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_29, ~datas~0.offset=v_~datas~0.offset_71, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_30|}  OutVars{#race=|v_#race_71|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_17|, ~datas~0.base=v_~datas~0.base_81, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_29, ~datas~0.offset=v_~datas~0.offset_71}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 141#true, 2#ULTIMATE.startEXITtrue, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#true, threadThread2of2ForFork0InUse, 47#threadEXITtrue, 21#L1016-4true, 155#(= |#race~datas~0| 0)])
[2023-11-03 11:23:50,489 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 11:23:50,489 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:23:50,489 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:23:50,490 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:23:50,490 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L1016-4-->L1016-6: Formula: (= (store |v_#race_60| v_~datas~0.base_57 (store (select |v_#race_60| v_~datas~0.base_57) (+ (* v_threadThread2of2ForFork0_~i~0_19 4) v_~datas~0.offset_51) |v_threadThread2of2ForFork0_#t~nondet4_21|)) |v_#race_59|)  InVars {#race=|v_#race_60|, ~datas~0.base=v_~datas~0.base_57, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_19}  OutVars{#race=|v_#race_59|, ~datas~0.base=v_~datas~0.base_57, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_21|, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 2#ULTIMATE.startEXITtrue, 141#true, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#true, Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 123#L1016-6true, 64#L1016-9true, 155#(= |#race~datas~0| 0)])
[2023-11-03 11:23:50,490 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-03 11:23:50,490 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:23:50,490 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:23:50,490 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-03 11:23:50,602 INFO  L130       PetriNetUnfolder]: 2751/6463 cut-off events.
[2023-11-03 11:23:50,602 INFO  L131       PetriNetUnfolder]: For 1904/2456 co-relation queries the response was YES.
[2023-11-03 11:23:50,614 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14861 conditions, 6463 events. 2751/6463 cut-off events. For 1904/2456 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53231 event pairs, 924 based on Foata normal form. 125/6164 useless extension candidates. Maximal degree in co-relation 14851. Up to 2371 conditions per place. 
[2023-11-03 11:23:50,630 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2023-11-03 11:23:50,631 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2023-11-03 11:23:50,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 11:23:50,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 11:23:50,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions.
[2023-11-03 11:23:50,632 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5990783410138248
[2023-11-03 11:23:50,632 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 390 transitions.
[2023-11-03 11:23:50,633 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions.
[2023-11-03 11:23:50,633 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:50,633 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions.
[2023-11-03 11:23:50,634 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:50,635 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:50,635 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:50,635 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 390 transitions.
[2023-11-03 11:23:50,635 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2023-11-03 11:23:50,644 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:50,645 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2023-11-03 11:23:50,645 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-11-03 11:23:50,646 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-11-03 11:23:50,646 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2023-11-03 11:23:50,646 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:50,646 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:50,646 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:50,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-03 11:23:50,647 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:23:50,647 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:50,647 INFO  L85        PathProgramCache]: Analyzing trace with hash -2101318696, now seen corresponding path program 1 times
[2023-11-03 11:23:50,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:50,647 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118341028]
[2023-11-03 11:23:50,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:50,648 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:50,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:50,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:23:50,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:50,803 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118341028]
[2023-11-03 11:23:50,803 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118341028] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:50,804 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:50,804 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:23:50,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777719789]
[2023-11-03 11:23:50,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:50,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:23:50,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:50,805 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:23:50,806 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:23:51,005 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2023-11-03 11:23:51,006 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:51,006 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:51,006 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2023-11-03 11:23:51,006 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:52,169 INFO  L130       PetriNetUnfolder]: 5675/10752 cut-off events.
[2023-11-03 11:23:52,170 INFO  L131       PetriNetUnfolder]: For 6509/6607 co-relation queries the response was YES.
[2023-11-03 11:23:52,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28674 conditions, 10752 events. 5675/10752 cut-off events. For 6509/6607 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 79142 event pairs, 1877 based on Foata normal form. 0/10235 useless extension candidates. Maximal degree in co-relation 28663. Up to 6983 conditions per place. 
[2023-11-03 11:23:52,212 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 110 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2023-11-03 11:23:52,213 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1313 flow
[2023-11-03 11:23:52,213 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:23:52,214 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:23:52,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions.
[2023-11-03 11:23:52,215 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821812596006144
[2023-11-03 11:23:52,215 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 758 transitions.
[2023-11-03 11:23:52,215 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions.
[2023-11-03 11:23:52,216 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:52,216 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions.
[2023-11-03 11:23:52,217 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:52,218 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:52,219 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:52,219 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 758 transitions.
[2023-11-03 11:23:52,219 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1313 flow
[2023-11-03 11:23:52,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:52,229 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2023-11-03 11:23:52,229 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=87, PETRI_TRANSITIONS=180}
[2023-11-03 11:23:52,230 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2023-11-03 11:23:52,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2023-11-03 11:23:52,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:52,230 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:52,230 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:52,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-03 11:23:52,230 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:23:52,231 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:52,231 INFO  L85        PathProgramCache]: Analyzing trace with hash 1490734773, now seen corresponding path program 1 times
[2023-11-03 11:23:52,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:52,231 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168596952]
[2023-11-03 11:23:52,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:52,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:52,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:52,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:23:52,438 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:52,438 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168596952]
[2023-11-03 11:23:52,438 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168596952] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:52,438 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:52,438 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:23:52,438 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026187197]
[2023-11-03 11:23:52,438 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:52,439 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:23:52,439 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:52,439 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:23:52,439 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:23:52,612 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-11-03 11:23:52,613 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:52,613 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:52,613 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-11-03 11:23:52,613 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:54,812 INFO  L130       PetriNetUnfolder]: 11355/20109 cut-off events.
[2023-11-03 11:23:54,812 INFO  L131       PetriNetUnfolder]: For 18604/18765 co-relation queries the response was YES.
[2023-11-03 11:23:54,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64116 conditions, 20109 events. 11355/20109 cut-off events. For 18604/18765 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 151214 event pairs, 3272 based on Foata normal form. 0/18815 useless extension candidates. Maximal degree in co-relation 64100. Up to 13848 conditions per place. 
[2023-11-03 11:23:54,900 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 239 selfloop transitions, 132 changer transitions 0/389 dead transitions.
[2023-11-03 11:23:54,900 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 389 transitions, 2939 flow
[2023-11-03 11:23:54,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:23:54,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:23:54,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2023-11-03 11:23:54,902 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2023-11-03 11:23:54,903 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2023-11-03 11:23:54,903 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2023-11-03 11:23:54,903 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:54,903 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2023-11-03 11:23:54,905 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:54,906 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:54,906 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:54,906 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 778 transitions.
[2023-11-03 11:23:54,907 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 389 transitions, 2939 flow
[2023-11-03 11:23:54,937 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 389 transitions, 2939 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:54,941 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2023-11-03 11:23:54,941 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2326, PETRI_PLACES=96, PETRI_TRANSITIONS=302}
[2023-11-03 11:23:54,941 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2023-11-03 11:23:54,941 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2023-11-03 11:23:54,942 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:54,942 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:54,942 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:54,942 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-03 11:23:54,942 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:23:54,942 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:54,943 INFO  L85        PathProgramCache]: Analyzing trace with hash -686777030, now seen corresponding path program 1 times
[2023-11-03 11:23:54,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:54,943 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929068922]
[2023-11-03 11:23:54,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:54,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:54,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:55,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 11:23:55,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:55,182 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929068922]
[2023-11-03 11:23:55,182 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929068922] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:23:55,182 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453010224]
[2023-11-03 11:23:55,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:55,182 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:23:55,182 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:23:55,184 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:23:55,186 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-03 11:23:55,287 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:55,290 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-11-03 11:23:55,294 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:23:55,446 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 11:23:55,476 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:23:55,478 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 11:23:55,520 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:23:55,521 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:23:55,522 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 11:23:55,569 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:23:55,570 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:23:55,571 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:23:55,572 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 11:23:55,629 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:23:55,630 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 11:23:55,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 11:23:55,666 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:23:55,705 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2023-11-03 11:23:55,739 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-11-03 11:23:55,772 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2023-11-03 11:23:55,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2023-11-03 11:23:55,838 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [453010224] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:23:55,838 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:23:55,838 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15
[2023-11-03 11:23:55,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784393057]
[2023-11-03 11:23:55,839 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:23:55,839 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2023-11-03 11:23:55,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:55,839 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2023-11-03 11:23:55,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=121, Unknown=3, NotChecked=78, Total=272
[2023-11-03 11:23:55,847 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 217
[2023-11-03 11:23:55,848 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 17 states, 17 states have (on average 81.3529411764706) internal successors, (1383), 17 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:55,848 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:23:55,848 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 217
[2023-11-03 11:23:55,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:23:59,093 INFO  L130       PetriNetUnfolder]: 14603/24245 cut-off events.
[2023-11-03 11:23:59,094 INFO  L131       PetriNetUnfolder]: For 41050/41050 co-relation queries the response was YES.
[2023-11-03 11:23:59,147 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94260 conditions, 24245 events. 14603/24245 cut-off events. For 41050/41050 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 173289 event pairs, 3234 based on Foata normal form. 162/22857 useless extension candidates. Maximal degree in co-relation 94239. Up to 14161 conditions per place. 
[2023-11-03 11:23:59,228 INFO  L137   encePairwiseOnDemand]: 207/217 looper letters, 500 selfloop transitions, 54 changer transitions 1/562 dead transitions.
[2023-11-03 11:23:59,229 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 562 transitions, 5374 flow
[2023-11-03 11:23:59,229 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 11:23:59,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 11:23:59,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions.
[2023-11-03 11:23:59,231 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46017116524028967
[2023-11-03 11:23:59,231 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 699 transitions.
[2023-11-03 11:23:59,231 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions.
[2023-11-03 11:23:59,232 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:23:59,232 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions.
[2023-11-03 11:23:59,233 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:59,234 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:59,235 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:59,235 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 699 transitions.
[2023-11-03 11:23:59,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 562 transitions, 5374 flow
[2023-11-03 11:23:59,452 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 562 transitions, 5278 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-11-03 11:23:59,457 INFO  L231             Difference]: Finished difference. Result has 102 places, 314 transitions, 2506 flow
[2023-11-03 11:23:59,457 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2506, PETRI_PLACES=102, PETRI_TRANSITIONS=314}
[2023-11-03 11:23:59,458 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 35 predicate places.
[2023-11-03 11:23:59,458 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 314 transitions, 2506 flow
[2023-11-03 11:23:59,459 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 81.3529411764706) internal successors, (1383), 17 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:23:59,459 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:23:59,459 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:23:59,497 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-03 11:23:59,659 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-11-03 11:23:59,660 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:23:59,661 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:23:59,661 INFO  L85        PathProgramCache]: Analyzing trace with hash -1154275821, now seen corresponding path program 1 times
[2023-11-03 11:23:59,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:23:59,662 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280255452]
[2023-11-03 11:23:59,662 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:23:59,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:23:59,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:23:59,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:23:59,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:23:59,931 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280255452]
[2023-11-03 11:23:59,931 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280255452] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:23:59,931 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:23:59,931 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-03 11:23:59,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700296504]
[2023-11-03 11:23:59,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:23:59,931 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-03 11:23:59,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:23:59,932 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-03 11:23:59,932 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-03 11:24:00,243 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217
[2023-11-03 11:24:00,244 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 314 transitions, 2506 flow. Second operand  has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:00,244 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:24:00,244 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217
[2023-11-03 11:24:00,244 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:24:03,537 INFO  L130       PetriNetUnfolder]: 13820/24388 cut-off events.
[2023-11-03 11:24:03,537 INFO  L131       PetriNetUnfolder]: For 46821/46988 co-relation queries the response was YES.
[2023-11-03 11:24:03,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97397 conditions, 24388 events. 13820/24388 cut-off events. For 46821/46988 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 189768 event pairs, 3201 based on Foata normal form. 348/24232 useless extension candidates. Maximal degree in co-relation 97374. Up to 11426 conditions per place. 
[2023-11-03 11:24:03,735 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 462 selfloop transitions, 166 changer transitions 2/647 dead transitions.
[2023-11-03 11:24:03,735 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 647 transitions, 6020 flow
[2023-11-03 11:24:03,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 11:24:03,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 11:24:03,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 973 transitions.
[2023-11-03 11:24:03,738 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5604838709677419
[2023-11-03 11:24:03,738 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 973 transitions.
[2023-11-03 11:24:03,738 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 973 transitions.
[2023-11-03 11:24:03,738 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:24:03,738 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 973 transitions.
[2023-11-03 11:24:03,740 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 121.625) internal successors, (973), 8 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:03,742 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:03,742 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:03,742 INFO  L175             Difference]: Start difference. First operand has 102 places, 314 transitions, 2506 flow. Second operand 8 states and 973 transitions.
[2023-11-03 11:24:03,742 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 647 transitions, 6020 flow
[2023-11-03 11:24:03,937 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 647 transitions, 5921 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-03 11:24:03,943 INFO  L231             Difference]: Finished difference. Result has 111 places, 430 transitions, 4113 flow
[2023-11-03 11:24:03,943 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4113, PETRI_PLACES=111, PETRI_TRANSITIONS=430}
[2023-11-03 11:24:03,944 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 44 predicate places.
[2023-11-03 11:24:03,944 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 430 transitions, 4113 flow
[2023-11-03 11:24:03,944 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:03,944 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:24:03,944 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:24:03,944 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-03 11:24:03,945 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:24:03,945 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:24:03,945 INFO  L85        PathProgramCache]: Analyzing trace with hash 340394548, now seen corresponding path program 1 times
[2023-11-03 11:24:03,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:24:03,945 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025078660]
[2023-11-03 11:24:03,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:24:03,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:24:03,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:24:04,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:24:04,000 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:24:04,001 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025078660]
[2023-11-03 11:24:04,001 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025078660] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:24:04,001 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853829306]
[2023-11-03 11:24:04,001 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:24:04,001 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:24:04,001 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:24:04,002 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:24:04,004 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-03 11:24:04,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:24:04,093 INFO  L263         TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 11:24:04,094 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:24:04,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:24:04,137 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:24:04,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:24:04,167 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [853829306] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:24:04,167 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:24:04,167 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2023-11-03 11:24:04,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67103865]
[2023-11-03 11:24:04,167 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:24:04,168 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-03 11:24:04,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:24:04,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-03 11:24:04,168 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2023-11-03 11:24:04,261 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2023-11-03 11:24:04,262 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 430 transitions, 4113 flow. Second operand  has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:04,262 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:24:04,262 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2023-11-03 11:24:04,262 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:24:05,886 INFO  L130       PetriNetUnfolder]: 5754/12879 cut-off events.
[2023-11-03 11:24:05,886 INFO  L131       PetriNetUnfolder]: For 42930/44884 co-relation queries the response was YES.
[2023-11-03 11:24:05,946 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55285 conditions, 12879 events. 5754/12879 cut-off events. For 42930/44884 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 112065 event pairs, 470 based on Foata normal form. 202/12746 useless extension candidates. Maximal degree in co-relation 55256. Up to 5114 conditions per place. 
[2023-11-03 11:24:05,997 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 152 selfloop transitions, 5 changer transitions 23/483 dead transitions.
[2023-11-03 11:24:05,997 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 483 transitions, 4821 flow
[2023-11-03 11:24:05,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 11:24:05,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 11:24:05,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions.
[2023-11-03 11:24:05,999 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5766951942067149
[2023-11-03 11:24:06,000 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 876 transitions.
[2023-11-03 11:24:06,000 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions.
[2023-11-03 11:24:06,000 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:24:06,000 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions.
[2023-11-03 11:24:06,001 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:06,003 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:06,003 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:06,003 INFO  L175             Difference]: Start difference. First operand has 111 places, 430 transitions, 4113 flow. Second operand 7 states and 876 transitions.
[2023-11-03 11:24:06,003 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 483 transitions, 4821 flow
[2023-11-03 11:24:06,196 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 483 transitions, 4807 flow, removed 7 selfloop flow, removed 0 redundant places.
[2023-11-03 11:24:06,201 INFO  L231             Difference]: Finished difference. Result has 120 places, 390 transitions, 3685 flow
[2023-11-03 11:24:06,201 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3757, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3685, PETRI_PLACES=120, PETRI_TRANSITIONS=390}
[2023-11-03 11:24:06,202 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 53 predicate places.
[2023-11-03 11:24:06,202 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 390 transitions, 3685 flow
[2023-11-03 11:24:06,202 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:06,202 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:24:06,202 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:24:06,210 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-03 11:24:06,403 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:24:06,403 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:24:06,404 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:24:06,405 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108254852, now seen corresponding path program 1 times
[2023-11-03 11:24:06,405 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:24:06,405 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714871626]
[2023-11-03 11:24:06,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:24:06,405 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:24:06,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:24:06,634 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:24:06,634 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:24:06,634 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714871626]
[2023-11-03 11:24:06,634 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714871626] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:24:06,634 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:24:06,635 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-03 11:24:06,635 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301964485]
[2023-11-03 11:24:06,635 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:24:06,635 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-03 11:24:06,635 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:24:06,635 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-03 11:24:06,636 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-03 11:24:06,951 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-11-03 11:24:06,952 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 390 transitions, 3685 flow. Second operand  has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:06,952 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:24:06,952 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-11-03 11:24:06,952 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:24:09,028 INFO  L130       PetriNetUnfolder]: 8771/16346 cut-off events.
[2023-11-03 11:24:09,028 INFO  L131       PetriNetUnfolder]: For 65828/66223 co-relation queries the response was YES.
[2023-11-03 11:24:09,069 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77526 conditions, 16346 events. 8771/16346 cut-off events. For 65828/66223 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 123686 event pairs, 2787 based on Foata normal form. 240/16416 useless extension candidates. Maximal degree in co-relation 77493. Up to 13560 conditions per place. 
[2023-11-03 11:24:09,119 INFO  L137   encePairwiseOnDemand]: 209/217 looper letters, 343 selfloop transitions, 13 changer transitions 7/402 dead transitions.
[2023-11-03 11:24:09,120 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 402 transitions, 4497 flow
[2023-11-03 11:24:09,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 11:24:09,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 11:24:09,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions.
[2023-11-03 11:24:09,122 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48847926267281105
[2023-11-03 11:24:09,122 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 742 transitions.
[2023-11-03 11:24:09,122 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 742 transitions.
[2023-11-03 11:24:09,122 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:24:09,122 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 742 transitions.
[2023-11-03 11:24:09,123 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:09,125 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:09,126 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:09,126 INFO  L175             Difference]: Start difference. First operand has 120 places, 390 transitions, 3685 flow. Second operand 7 states and 742 transitions.
[2023-11-03 11:24:09,126 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 402 transitions, 4497 flow
[2023-11-03 11:24:09,283 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 402 transitions, 4408 flow, removed 6 selfloop flow, removed 3 redundant places.
[2023-11-03 11:24:09,287 INFO  L231             Difference]: Finished difference. Result has 122 places, 388 transitions, 3635 flow
[2023-11-03 11:24:09,288 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3635, PETRI_PLACES=122, PETRI_TRANSITIONS=388}
[2023-11-03 11:24:09,288 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 55 predicate places.
[2023-11-03 11:24:09,288 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 388 transitions, 3635 flow
[2023-11-03 11:24:09,289 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:09,289 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:24:09,289 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:24:09,289 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-03 11:24:09,289 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:24:09,289 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:24:09,290 INFO  L85        PathProgramCache]: Analyzing trace with hash 860099489, now seen corresponding path program 1 times
[2023-11-03 11:24:09,290 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:24:09,290 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397425405]
[2023-11-03 11:24:09,290 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:24:09,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:24:09,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:24:09,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-03 11:24:09,480 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:24:09,480 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397425405]
[2023-11-03 11:24:09,480 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397425405] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:24:09,480 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:24:09,480 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:24:09,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501246137]
[2023-11-03 11:24:09,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:24:09,481 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:24:09,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:24:09,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:24:09,482 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:24:09,636 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-11-03 11:24:09,637 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 388 transitions, 3635 flow. Second operand  has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:09,637 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:24:09,637 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-11-03 11:24:09,637 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:24:13,086 INFO  L130       PetriNetUnfolder]: 12785/22892 cut-off events.
[2023-11-03 11:24:13,086 INFO  L131       PetriNetUnfolder]: For 82261/82659 co-relation queries the response was YES.
[2023-11-03 11:24:13,192 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105773 conditions, 22892 events. 12785/22892 cut-off events. For 82261/82659 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 175825 event pairs, 2816 based on Foata normal form. 45/21734 useless extension candidates. Maximal degree in co-relation 105739. Up to 17260 conditions per place. 
[2023-11-03 11:24:13,278 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 405 selfloop transitions, 156 changer transitions 18/594 dead transitions.
[2023-11-03 11:24:13,278 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 594 transitions, 6405 flow
[2023-11-03 11:24:13,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:24:13,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:24:13,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2023-11-03 11:24:13,281 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2023-11-03 11:24:13,281 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2023-11-03 11:24:13,281 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2023-11-03 11:24:13,281 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:24:13,281 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2023-11-03 11:24:13,283 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:13,284 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:13,284 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:13,284 INFO  L175             Difference]: Start difference. First operand has 122 places, 388 transitions, 3635 flow. Second operand 6 states and 778 transitions.
[2023-11-03 11:24:13,284 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 594 transitions, 6405 flow
[2023-11-03 11:24:13,608 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 594 transitions, 6347 flow, removed 1 selfloop flow, removed 3 redundant places.
[2023-11-03 11:24:13,614 INFO  L231             Difference]: Finished difference. Result has 128 places, 501 transitions, 5166 flow
[2023-11-03 11:24:13,614 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3601, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5166, PETRI_PLACES=128, PETRI_TRANSITIONS=501}
[2023-11-03 11:24:13,614 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 61 predicate places.
[2023-11-03 11:24:13,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 501 transitions, 5166 flow
[2023-11-03 11:24:13,615 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:13,615 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:24:13,615 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:24:13,615 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-03 11:24:13,615 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:24:13,616 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:24:13,616 INFO  L85        PathProgramCache]: Analyzing trace with hash -907237555, now seen corresponding path program 1 times
[2023-11-03 11:24:13,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:24:13,616 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592352418]
[2023-11-03 11:24:13,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:24:13,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:24:13,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:24:14,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:24:14,697 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:24:14,697 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592352418]
[2023-11-03 11:24:14,698 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592352418] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:24:14,698 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318040973]
[2023-11-03 11:24:14,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:24:14,698 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:24:14,698 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:24:14,699 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:24:14,701 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-03 11:24:14,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:24:14,803 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-11-03 11:24:14,806 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:24:14,817 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-11-03 11:24:14,945 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:24:14,946 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-11-03 11:24:14,992 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 11:24:15,006 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 11:24:15,041 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:24:15,068 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:24:15,109 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:24:15,109 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:24:15,159 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:24:15,159 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:24:15,224 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:24:15,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:24:15,237 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:24:15,238 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [318040973] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:24:15,238 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:24:15,238 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21
[2023-11-03 11:24:15,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476005973]
[2023-11-03 11:24:15,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:24:15,239 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-03 11:24:15,239 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:24:15,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-03 11:24:15,240 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506
[2023-11-03 11:24:15,719 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217
[2023-11-03 11:24:15,721 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 501 transitions, 5166 flow. Second operand  has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:15,722 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:24:15,722 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217
[2023-11-03 11:24:15,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:24:20,756 INFO  L130       PetriNetUnfolder]: 16066/28224 cut-off events.
[2023-11-03 11:24:20,756 INFO  L131       PetriNetUnfolder]: For 138124/138543 co-relation queries the response was YES.
[2023-11-03 11:24:20,862 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 145503 conditions, 28224 events. 16066/28224 cut-off events. For 138124/138543 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 221081 event pairs, 2413 based on Foata normal form. 232/28257 useless extension candidates. Maximal degree in co-relation 145465. Up to 10206 conditions per place. 
[2023-11-03 11:24:20,964 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 933 selfloop transitions, 283 changer transitions 35/1263 dead transitions.
[2023-11-03 11:24:20,964 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1263 transitions, 15728 flow
[2023-11-03 11:24:20,965 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-11-03 11:24:20,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-03 11:24:20,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1167 transitions.
[2023-11-03 11:24:20,967 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48889819857561795
[2023-11-03 11:24:20,967 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1167 transitions.
[2023-11-03 11:24:20,967 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1167 transitions.
[2023-11-03 11:24:20,967 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:24:20,967 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1167 transitions.
[2023-11-03 11:24:20,969 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 106.0909090909091) internal successors, (1167), 11 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:20,971 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:20,972 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:20,972 INFO  L175             Difference]: Start difference. First operand has 128 places, 501 transitions, 5166 flow. Second operand 11 states and 1167 transitions.
[2023-11-03 11:24:20,972 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 1263 transitions, 15728 flow
[2023-11-03 11:24:21,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1263 transitions, 15478 flow, removed 125 selfloop flow, removed 0 redundant places.
[2023-11-03 11:24:21,797 INFO  L231             Difference]: Finished difference. Result has 145 places, 755 transitions, 9363 flow
[2023-11-03 11:24:21,797 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=5000, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9363, PETRI_PLACES=145, PETRI_TRANSITIONS=755}
[2023-11-03 11:24:21,797 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 78 predicate places.
[2023-11-03 11:24:21,798 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 755 transitions, 9363 flow
[2023-11-03 11:24:21,798 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:21,798 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:24:21,798 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:24:21,806 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-03 11:24:21,998 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-11-03 11:24:21,999 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:24:21,999 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:24:21,999 INFO  L85        PathProgramCache]: Analyzing trace with hash -103982335, now seen corresponding path program 2 times
[2023-11-03 11:24:21,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:24:22,000 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203424296]
[2023-11-03 11:24:22,000 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:24:22,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:24:22,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:24:22,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:24:22,448 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:24:22,448 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203424296]
[2023-11-03 11:24:22,448 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203424296] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:24:22,448 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047806379]
[2023-11-03 11:24:22,448 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 11:24:22,448 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:24:22,448 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:24:22,450 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:24:22,452 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-03 11:24:22,563 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 11:24:22,563 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:24:22,565 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-11-03 11:24:22,572 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:24:22,582 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:24:22,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2023-11-03 11:24:22,710 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:24:22,711 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-11-03 11:24:22,745 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:24:22,747 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 11:24:22,766 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:24:22,808 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:24:22,856 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:24:22,857 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:24:22,969 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 11:24:23,012 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:24:23,012 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 11:24:23,040 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:24:23,040 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:24:23,099 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:24:23,100 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:24:23,134 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:24:23,135 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:24:23,160 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:24:23,161 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:24:23,208 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:24:23,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:24:23,218 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:24:23,218 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047806379] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:24:23,218 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:24:23,218 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-11-03 11:24:23,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109104954]
[2023-11-03 11:24:23,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:24:23,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-03 11:24:23,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:24:23,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-03 11:24:23,219 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2023-11-03 11:24:23,939 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217
[2023-11-03 11:24:23,940 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 755 transitions, 9363 flow. Second operand  has 11 states, 11 states have (on average 91.18181818181819) internal successors, (1003), 11 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:23,940 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:24:23,940 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217
[2023-11-03 11:24:23,940 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:24:31,528 INFO  L130       PetriNetUnfolder]: 17180/30220 cut-off events.
[2023-11-03 11:24:31,528 INFO  L131       PetriNetUnfolder]: For 206398/206888 co-relation queries the response was YES.
[2023-11-03 11:24:31,678 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172995 conditions, 30220 events. 17180/30220 cut-off events. For 206398/206888 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 238311 event pairs, 2207 based on Foata normal form. 290/30331 useless extension candidates. Maximal degree in co-relation 172949. Up to 12901 conditions per place. 
[2023-11-03 11:24:31,800 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 838 selfloop transitions, 526 changer transitions 51/1427 dead transitions.
[2023-11-03 11:24:31,800 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 1427 transitions, 19203 flow
[2023-11-03 11:24:31,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-11-03 11:24:31,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2023-11-03 11:24:31,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1651 transitions.
[2023-11-03 11:24:31,804 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5072196620583718
[2023-11-03 11:24:31,804 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1651 transitions.
[2023-11-03 11:24:31,805 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1651 transitions.
[2023-11-03 11:24:31,805 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:24:31,805 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1651 transitions.
[2023-11-03 11:24:31,808 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 110.06666666666666) internal successors, (1651), 15 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:31,810 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:31,811 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:31,811 INFO  L175             Difference]: Start difference. First operand has 145 places, 755 transitions, 9363 flow. Second operand 15 states and 1651 transitions.
[2023-11-03 11:24:31,811 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 1427 transitions, 19203 flow
[2023-11-03 11:24:33,536 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 1427 transitions, 19137 flow, removed 25 selfloop flow, removed 2 redundant places.
[2023-11-03 11:24:33,552 INFO  L231             Difference]: Finished difference. Result has 163 places, 999 transitions, 14370 flow
[2023-11-03 11:24:33,552 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=9322, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14370, PETRI_PLACES=163, PETRI_TRANSITIONS=999}
[2023-11-03 11:24:33,553 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 96 predicate places.
[2023-11-03 11:24:33,553 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 999 transitions, 14370 flow
[2023-11-03 11:24:33,554 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 91.18181818181819) internal successors, (1003), 11 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:33,554 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:24:33,554 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:24:33,563 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-03 11:24:33,755 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-11-03 11:24:33,756 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:24:33,756 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:24:33,756 INFO  L85        PathProgramCache]: Analyzing trace with hash -1403000896, now seen corresponding path program 1 times
[2023-11-03 11:24:33,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:24:33,757 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557184274]
[2023-11-03 11:24:33,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:24:33,757 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:24:33,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:24:34,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:24:34,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:24:34,090 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557184274]
[2023-11-03 11:24:34,090 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557184274] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:24:34,090 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053621423]
[2023-11-03 11:24:34,091 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:24:34,091 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:24:34,091 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:24:34,092 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:24:34,094 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-11-03 11:24:34,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:24:34,215 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-11-03 11:24:34,218 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:24:34,231 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:24:34,235 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2023-11-03 11:24:34,340 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:24:34,340 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-11-03 11:24:34,372 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:24:34,373 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 11:24:34,409 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 11:24:34,423 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:24:34,432 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:24:34,446 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:24:34,446 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:24:34,465 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:24:34,465 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:24:34,485 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:24:34,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:24:34,497 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:24:34,497 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053621423] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:24:34,497 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:24:34,497 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12
[2023-11-03 11:24:34,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973757327]
[2023-11-03 11:24:34,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:24:34,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-03 11:24:34,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:24:34,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-03 11:24:34,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2023-11-03 11:24:35,195 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217
[2023-11-03 11:24:35,196 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 999 transitions, 14370 flow. Second operand  has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:35,196 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:24:35,196 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217
[2023-11-03 11:24:35,196 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:24:41,404 INFO  L130       PetriNetUnfolder]: 14478/26890 cut-off events.
[2023-11-03 11:24:41,405 INFO  L131       PetriNetUnfolder]: For 258288/259655 co-relation queries the response was YES.
[2023-11-03 11:24:41,566 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 169027 conditions, 26890 events. 14478/26890 cut-off events. For 258288/259655 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 223662 event pairs, 1217 based on Foata normal form. 518/26956 useless extension candidates. Maximal degree in co-relation 168975. Up to 10035 conditions per place. 
[2023-11-03 11:24:41,679 INFO  L137   encePairwiseOnDemand]: 206/217 looper letters, 1230 selfloop transitions, 93 changer transitions 15/1486 dead transitions.
[2023-11-03 11:24:41,679 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1486 transitions, 23687 flow
[2023-11-03 11:24:41,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-03 11:24:41,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-03 11:24:41,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions.
[2023-11-03 11:24:41,682 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5412186379928315
[2023-11-03 11:24:41,682 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions.
[2023-11-03 11:24:41,682 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions.
[2023-11-03 11:24:41,682 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:24:41,682 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions.
[2023-11-03 11:24:41,683 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:41,685 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:41,685 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:41,685 INFO  L175             Difference]: Start difference. First operand has 163 places, 999 transitions, 14370 flow. Second operand 9 states and 1057 transitions.
[2023-11-03 11:24:41,685 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1486 transitions, 23687 flow
[2023-11-03 11:24:43,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 1486 transitions, 23017 flow, removed 328 selfloop flow, removed 3 redundant places.
[2023-11-03 11:24:43,854 INFO  L231             Difference]: Finished difference. Result has 165 places, 998 transitions, 13986 flow
[2023-11-03 11:24:43,855 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=13800, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13986, PETRI_PLACES=165, PETRI_TRANSITIONS=998}
[2023-11-03 11:24:43,855 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 98 predicate places.
[2023-11-03 11:24:43,855 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 998 transitions, 13986 flow
[2023-11-03 11:24:43,856 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:24:43,856 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:24:43,856 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:24:43,864 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2023-11-03 11:24:44,056 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:24:44,057 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:24:44,058 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:24:44,058 INFO  L85        PathProgramCache]: Analyzing trace with hash 1127119439, now seen corresponding path program 3 times
[2023-11-03 11:24:44,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:24:44,059 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256132016]
[2023-11-03 11:24:44,059 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:24:44,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:24:44,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:24:44,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:24:44,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:24:44,629 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256132016]
[2023-11-03 11:24:44,629 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256132016] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:24:44,629 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631251334]
[2023-11-03 11:24:44,630 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-03 11:24:44,630 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:24:44,630 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:24:44,631 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:24:44,633 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-11-03 11:24:44,777 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-03 11:24:44,778 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:24:44,780 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 58 conjunts are in the unsatisfiable core
[2023-11-03 11:24:44,785 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:24:44,800 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2023-11-03 11:24:44,987 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:24:44,988 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-11-03 11:24:44,993 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:24:44,993 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 11:24:45,125 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 11:24:45,143 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 11:24:45,216 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:24:45,264 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:24:45,335 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2023-11-03 11:24:45,343 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 11:24:45,389 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:24:45,439 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-11-03 11:24:45,470 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:24:45,534 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:24:45,561 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:24:45,583 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:24:45,681 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:24:45,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:24:45,733 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:24:45,760 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_964 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-11-03 11:25:06,397 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))))))) is different from false
[2023-11-03 11:25:06,434 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse2))) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse0 c_~datas~0.base (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse3 c_~datas~0.base (store (select .cse3 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse4 c_~datas~0.base (store (select .cse4 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse5 c_~datas~0.base (store (select .cse5 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-03 11:25:06,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:25:06,784 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631251334] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:25:06,785 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:25:06,785 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27
[2023-11-03 11:25:06,785 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510006923]
[2023-11-03 11:25:06,785 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:25:06,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-11-03 11:25:06,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:25:06,787 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-11-03 11:25:06,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=522, Unknown=24, NotChecked=150, Total=812
[2023-11-03 11:25:06,791 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2023-11-03 11:25:06,792 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 998 transitions, 13986 flow. Second operand  has 29 states, 29 states have (on average 68.44827586206897) internal successors, (1985), 29 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:06,792 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:25:06,792 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2023-11-03 11:25:06,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:25:21,204 INFO  L130       PetriNetUnfolder]: 25390/41997 cut-off events.
[2023-11-03 11:25:21,204 INFO  L131       PetriNetUnfolder]: For 365076/365076 co-relation queries the response was YES.
[2023-11-03 11:25:21,494 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 261786 conditions, 41997 events. 25390/41997 cut-off events. For 365076/365076 co-relation queries the response was YES. Maximal size of possible extension queue 1168. Compared 316922 event pairs, 4210 based on Foata normal form. 201/42198 useless extension candidates. Maximal degree in co-relation 261736. Up to 17367 conditions per place. 
[2023-11-03 11:25:21,678 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 1213 selfloop transitions, 584 changer transitions 59/1859 dead transitions.
[2023-11-03 11:25:21,678 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1859 transitions, 27522 flow
[2023-11-03 11:25:21,679 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-11-03 11:25:21,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-11-03 11:25:21,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1827 transitions.
[2023-11-03 11:25:21,681 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38269794721407624
[2023-11-03 11:25:21,681 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1827 transitions.
[2023-11-03 11:25:21,681 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1827 transitions.
[2023-11-03 11:25:21,682 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:25:21,682 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1827 transitions.
[2023-11-03 11:25:21,684 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 83.04545454545455) internal successors, (1827), 22 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:21,687 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:21,687 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:21,688 INFO  L175             Difference]: Start difference. First operand has 165 places, 998 transitions, 13986 flow. Second operand 22 states and 1827 transitions.
[2023-11-03 11:25:21,688 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1859 transitions, 27522 flow
[2023-11-03 11:25:24,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 1859 transitions, 27148 flow, removed 0 selfloop flow, removed 8 redundant places.
[2023-11-03 11:25:24,271 INFO  L231             Difference]: Finished difference. Result has 186 places, 1230 transitions, 19430 flow
[2023-11-03 11:25:24,272 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=13800, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=19430, PETRI_PLACES=186, PETRI_TRANSITIONS=1230}
[2023-11-03 11:25:24,272 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 119 predicate places.
[2023-11-03 11:25:24,272 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 1230 transitions, 19430 flow
[2023-11-03 11:25:24,273 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 68.44827586206897) internal successors, (1985), 29 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:24,273 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:25:24,273 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:25:24,281 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2023-11-03 11:25:24,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:25:24,477 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:25:24,477 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:25:24,477 INFO  L85        PathProgramCache]: Analyzing trace with hash -1195414565, now seen corresponding path program 4 times
[2023-11-03 11:25:24,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:25:24,478 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707676928]
[2023-11-03 11:25:24,478 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:25:24,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:25:24,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:25:25,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:25:25,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:25:25,052 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707676928]
[2023-11-03 11:25:25,053 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707676928] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:25:25,053 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513878634]
[2023-11-03 11:25:25,053 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-03 11:25:25,053 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:25:25,054 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:25:25,056 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:25:25,058 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-11-03 11:25:25,240 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-03 11:25:25,241 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:25:25,243 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-11-03 11:25:25,248 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:25:25,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:25:25,280 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2023-11-03 11:25:25,572 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:25:25,572 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-11-03 11:25:25,584 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:25:25,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 11:25:25,793 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:25:25,795 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-11-03 11:25:25,817 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:25:25,818 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-11-03 11:25:25,920 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:25:25,994 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-03 11:25:26,008 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2023-11-03 11:25:26,171 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:25:26,259 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:25:26,350 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:25:26,452 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:25:26,453 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:25:26,506 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:25:26,507 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:25:26,547 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:25:26,549 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:25:26,590 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:25:26,591 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:25:26,758 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:25:26,760 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:25:26,762 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60
[2023-11-03 11:25:26,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:25:26,839 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:25:26,871 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))))) is different from false
[2023-11-03 11:25:27,016 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))) is different from false
[2023-11-03 11:25:27,174 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2023-11-03 11:25:27,224 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse2)) (.cse1 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse1))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse3))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2023-11-03 11:25:27,544 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse5 (+ c_~datas~0.offset .cse4 1)) (.cse3 (+ c_~datas~0.offset 2 .cse4)) (.cse2 (+ c_~datas~0.offset 3 .cse4))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse2))))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|)))))))) is different from false
[2023-11-03 11:25:27,578 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:25:27,579 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 74
[2023-11-03 11:25:27,588 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:25:27,589 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 315 treesize of output 172
[2023-11-03 11:25:27,597 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 116
[2023-11-03 11:25:27,612 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:25:27,612 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 69
[2023-11-03 11:25:27,664 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-11-03 11:25:27,664 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2023-11-03 11:25:27,674 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-11-03 11:25:27,675 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 1
[2023-11-03 11:25:27,685 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-11-03 11:25:27,685 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2023-11-03 11:25:27,893 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:25:27,894 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513878634] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:25:27,894 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:25:27,894 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2023-11-03 11:25:27,895 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136071335]
[2023-11-03 11:25:27,895 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:25:27,896 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-11-03 11:25:27,896 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:25:27,897 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-11-03 11:25:27,898 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=564, Unknown=28, NotChecked=270, Total=992
[2023-11-03 11:25:28,082 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2023-11-03 11:25:28,084 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 1230 transitions, 19430 flow. Second operand  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:28,084 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:25:28,084 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2023-11-03 11:25:28,085 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:25:45,631 INFO  L130       PetriNetUnfolder]: 27440/45388 cut-off events.
[2023-11-03 11:25:45,631 INFO  L131       PetriNetUnfolder]: For 564676/564682 co-relation queries the response was YES.
[2023-11-03 11:25:45,979 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 322571 conditions, 45388 events. 27440/45388 cut-off events. For 564676/564682 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 345636 event pairs, 5129 based on Foata normal form. 191/45577 useless extension candidates. Maximal degree in co-relation 322513. Up to 33578 conditions per place. 
[2023-11-03 11:25:46,186 INFO  L137   encePairwiseOnDemand]: 181/217 looper letters, 1829 selfloop transitions, 414 changer transitions 43/2289 dead transitions.
[2023-11-03 11:25:46,187 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 2289 transitions, 37478 flow
[2023-11-03 11:25:46,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-11-03 11:25:46,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-11-03 11:25:46,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1846 transitions.
[2023-11-03 11:25:46,189 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38667783829074154
[2023-11-03 11:25:46,190 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1846 transitions.
[2023-11-03 11:25:46,190 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1846 transitions.
[2023-11-03 11:25:46,190 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:25:46,190 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1846 transitions.
[2023-11-03 11:25:46,192 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 83.9090909090909) internal successors, (1846), 22 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:46,196 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:46,196 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:46,196 INFO  L175             Difference]: Start difference. First operand has 186 places, 1230 transitions, 19430 flow. Second operand 22 states and 1846 transitions.
[2023-11-03 11:25:46,196 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 2289 transitions, 37478 flow
[2023-11-03 11:25:51,436 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 2289 transitions, 36669 flow, removed 317 selfloop flow, removed 9 redundant places.
[2023-11-03 11:25:51,464 INFO  L231             Difference]: Finished difference. Result has 211 places, 1540 transitions, 25666 flow
[2023-11-03 11:25:51,465 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=18681, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=25666, PETRI_PLACES=211, PETRI_TRANSITIONS=1540}
[2023-11-03 11:25:51,466 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 144 predicate places.
[2023-11-03 11:25:51,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 1540 transitions, 25666 flow
[2023-11-03 11:25:51,467 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:51,467 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:25:51,467 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-11-03 11:25:51,475 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-11-03 11:25:51,667 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-11-03 11:25:51,668 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-03 11:25:51,668 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:25:51,669 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108278345, now seen corresponding path program 1 times
[2023-11-03 11:25:51,669 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:25:51,669 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400022114]
[2023-11-03 11:25:51,669 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:25:51,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:25:51,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 11:25:51,702 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 11:25:51,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 11:25:51,717 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 11:25:51,717 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 11:25:51,717 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-11-03 11:25:51,718 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-11-03 11:25:51,718 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-11-03 11:25:51,718 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-11-03 11:25:51,718 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-11-03 11:25:51,718 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-11-03 11:25:51,718 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-11-03 11:25:51,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2023-11-03 11:25:51,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-11-03 11:25:51,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-11-03 11:25:51,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-11-03 11:25:51,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-11-03 11:25:51,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-11-03 11:25:51,719 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-03 11:25:51,720 INFO  L445         BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:25:51,720 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 11:25:51,720 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-03 11:25:51,738 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-11-03 11:25:51,740 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 155 transitions, 340 flow
[2023-11-03 11:25:51,770 INFO  L130       PetriNetUnfolder]: 21/500 cut-off events.
[2023-11-03 11:25:51,770 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-03 11:25:51,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 500 events. 21/500 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1504 event pairs, 1 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 297. Up to 16 conditions per place. 
[2023-11-03 11:25:51,771 INFO  L82        GeneralOperation]: Start removeDead. Operand has 156 places, 155 transitions, 340 flow
[2023-11-03 11:25:51,773 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 156 places, 155 transitions, 340 flow
[2023-11-03 11:25:51,773 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 11:25:51,773 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 155 transitions, 340 flow
[2023-11-03 11:25:51,773 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 155 transitions, 340 flow
[2023-11-03 11:25:51,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 155 transitions, 340 flow
[2023-11-03 11:25:51,803 INFO  L130       PetriNetUnfolder]: 21/500 cut-off events.
[2023-11-03 11:25:51,804 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-03 11:25:51,805 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 500 events. 21/500 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1504 event pairs, 1 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 297. Up to 16 conditions per place. 
[2023-11-03 11:25:51,812 INFO  L119        LiptonReduction]: Number of co-enabled transitions 8964
[2023-11-03 11:25:54,849 INFO  L134        LiptonReduction]: Checked pairs total: 51687
[2023-11-03 11:25:54,849 INFO  L136        LiptonReduction]: Total number of compositions: 90
[2023-11-03 11:25:54,851 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 11:25:54,852 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;@204fc40a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 11:25:54,852 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-11-03 11:25:54,852 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-11-03 11:25:54,853 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 11:25:54,853 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:25:54,853 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 11:25:54,853 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:25:54,854 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:25:54,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 881, now seen corresponding path program 1 times
[2023-11-03 11:25:54,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:25:54,854 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745111099]
[2023-11-03 11:25:54,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:25:54,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:25:54,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:25:54,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:25:54,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:25:54,860 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745111099]
[2023-11-03 11:25:54,860 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745111099] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:25:54,861 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:25:54,861 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 11:25:54,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681689465]
[2023-11-03 11:25:54,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:25:54,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 11:25:54,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:25:54,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 11:25:54,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 11:25:54,862 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 245
[2023-11-03 11:25:54,863 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 182 flow. Second operand  has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:54,863 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:25:54,863 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 245
[2023-11-03 11:25:54,863 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:25:55,413 INFO  L130       PetriNetUnfolder]: 3680/8504 cut-off events.
[2023-11-03 11:25:55,414 INFO  L131       PetriNetUnfolder]: For 651/1631 co-relation queries the response was YES.
[2023-11-03 11:25:55,427 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14271 conditions, 8504 events. 3680/8504 cut-off events. For 651/1631 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 72254 event pairs, 3637 based on Foata normal form. 0/7834 useless extension candidates. Maximal degree in co-relation 11836. Up to 5535 conditions per place. 
[2023-11-03 11:25:55,456 INFO  L137   encePairwiseOnDemand]: 244/245 looper letters, 28 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2023-11-03 11:25:55,456 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 236 flow
[2023-11-03 11:25:55,457 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 11:25:55,457 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 11:25:55,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions.
[2023-11-03 11:25:55,458 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6551020408163265
[2023-11-03 11:25:55,458 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 321 transitions.
[2023-11-03 11:25:55,458 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 321 transitions.
[2023-11-03 11:25:55,459 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:25:55,459 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 321 transitions.
[2023-11-03 11:25:55,459 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:55,460 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:55,460 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:55,461 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 321 transitions.
[2023-11-03 11:25:55,461 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 236 flow
[2023-11-03 11:25:55,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:25:55,463 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2023-11-03 11:25:55,464 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=80, PETRI_TRANSITIONS=75}
[2023-11-03 11:25:55,464 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2023-11-03 11:25:55,465 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2023-11-03 11:25:55,465 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:55,465 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:25:55,465 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:25:55,465 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-11-03 11:25:55,466 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:25:55,466 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:25:55,466 INFO  L85        PathProgramCache]: Analyzing trace with hash 847683071, now seen corresponding path program 1 times
[2023-11-03 11:25:55,466 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:25:55,467 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582112864]
[2023-11-03 11:25:55,467 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:25:55,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:25:55,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:25:55,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:25:55,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:25:55,592 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582112864]
[2023-11-03 11:25:55,592 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582112864] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:25:55,592 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:25:55,592 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:25:55,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499009657]
[2023-11-03 11:25:55,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:25:55,593 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:25:55,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:25:55,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:25:55,594 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:25:55,817 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245
[2023-11-03 11:25:55,818 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 180 flow. Second operand  has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:25:55,818 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:25:55,819 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245
[2023-11-03 11:25:55,819 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:26:03,130 INFO  L130       PetriNetUnfolder]: 75663/120904 cut-off events.
[2023-11-03 11:26:03,131 INFO  L131       PetriNetUnfolder]: For 3763/4244 co-relation queries the response was YES.
[2023-11-03 11:26:03,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 231350 conditions, 120904 events. 75663/120904 cut-off events. For 3763/4244 co-relation queries the response was YES. Maximal size of possible extension queue 2764. Compared 1003932 event pairs, 19231 based on Foata normal form. 157/116594 useless extension candidates. Maximal degree in co-relation 231344. Up to 73144 conditions per place. 
[2023-11-03 11:26:03,719 INFO  L137   encePairwiseOnDemand]: 214/245 looper letters, 111 selfloop transitions, 64 changer transitions 0/196 dead transitions.
[2023-11-03 11:26:03,719 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 196 transitions, 793 flow
[2023-11-03 11:26:03,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:26:03,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:26:03,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions.
[2023-11-03 11:26:03,721 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.582312925170068
[2023-11-03 11:26:03,721 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 856 transitions.
[2023-11-03 11:26:03,721 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 856 transitions.
[2023-11-03 11:26:03,721 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:26:03,721 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 856 transitions.
[2023-11-03 11:26:03,722 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.66666666666666) internal successors, (856), 6 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:03,723 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:03,724 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:03,724 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 856 transitions.
[2023-11-03 11:26:03,724 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 196 transitions, 793 flow
[2023-11-03 11:26:03,728 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 196 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:26:03,729 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2023-11-03 11:26:03,729 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=139}
[2023-11-03 11:26:03,730 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2023-11-03 11:26:03,730 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2023-11-03 11:26:03,730 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:03,730 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:26:03,730 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:26:03,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-11-03 11:26:03,730 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:26:03,730 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:26:03,731 INFO  L85        PathProgramCache]: Analyzing trace with hash -309025520, now seen corresponding path program 1 times
[2023-11-03 11:26:03,731 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:26:03,731 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012481649]
[2023-11-03 11:26:03,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:26:03,731 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:26:03,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:26:03,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:26:03,750 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:26:03,750 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012481649]
[2023-11-03 11:26:03,750 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012481649] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:26:03,750 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:26:03,750 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 11:26:03,750 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257004965]
[2023-11-03 11:26:03,750 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:26:03,751 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 11:26:03,751 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:26:03,751 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 11:26:03,751 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 11:26:03,778 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 245
[2023-11-03 11:26:03,779 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 139 transitions, 626 flow. Second operand  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:03,779 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:26:03,779 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 245
[2023-11-03 11:26:03,779 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:26:06,513 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [120#L1016-3true, 83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), 126#L1016-1true, threadThread3of3ForFork0InUse])
[2023-11-03 11:26:06,513 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-11-03 11:26:06,513 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:26:06,513 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:26:06,513 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:26:06,514 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, 79#L1016-3true, 47#L1016-1true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-03 11:26:06,514 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-11-03 11:26:06,514 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:26:06,514 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:26:06,514 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-03 11:26:06,739 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [120#L1016-3true, 83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, 79#L1016-3true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-03 11:26:06,739 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,740 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1016-4-->L1016-6: Formula: (= (store |v_#race_176| v_~datas~0.base_115 (store (select |v_#race_176| v_~datas~0.base_115) (+ (* v_threadThread2of3ForFork0_~i~0_21 4) v_~datas~0.offset_103) |v_threadThread2of3ForFork0_#t~nondet4_21|)) |v_#race_175|)  InVars {#race=|v_#race_176|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  OutVars{#race=|v_#race_175|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 95#L1016-6true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), 126#L1016-1true, threadThread3of3ForFork0InUse])
[2023-11-03 11:26:06,740 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,740 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([763] L1016-4-->L1016-6: Formula: (= |v_#race_161| (store |v_#race_162| v_~datas~0.base_105 (store (select |v_#race_162| v_~datas~0.base_105) (+ v_~datas~0.offset_93 (* v_threadThread3of3ForFork0_~i~0_19 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_162|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  OutVars{#race=|v_#race_161|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, 47#L1016-1true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 51#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-03 11:26:06,740 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,740 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,741 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-03 11:26:06,959 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1016-4-->L1016-6: Formula: (= (store |v_#race_176| v_~datas~0.base_115 (store (select |v_#race_176| v_~datas~0.base_115) (+ (* v_threadThread2of3ForFork0_~i~0_21 4) v_~datas~0.offset_103) |v_threadThread2of3ForFork0_#t~nondet4_21|)) |v_#race_175|)  InVars {#race=|v_#race_176|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  OutVars{#race=|v_#race_175|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, 79#L1016-3true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 95#L1016-6true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-03 11:26:06,959 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-11-03 11:26:06,959 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:26:06,959 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:26:06,959 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:26:06,959 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([763] L1016-4-->L1016-6: Formula: (= |v_#race_161| (store |v_#race_162| v_~datas~0.base_105 (store (select |v_#race_162| v_~datas~0.base_105) (+ v_~datas~0.offset_93 (* v_threadThread3of3ForFork0_~i~0_19 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_162|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  OutVars{#race=|v_#race_161|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [120#L1016-3true, 37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 51#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-03 11:26:06,959 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-11-03 11:26:06,960 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:26:06,960 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:26:06,960 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-03 11:26:08,559 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_183| v_~datas~0.base_131)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_27 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)))))  InVars {#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [83#threadEXITtrue, 162#true, 80#L1028-1true, 6#threadEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-03 11:26:08,560 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-11-03 11:26:08,560 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:26:08,560 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:26:08,560 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:26:08,560 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_183| v_~datas~0.base_131)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_27 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)))))  InVars {#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [83#threadEXITtrue, 162#true, 6#threadEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse, 92#L1030true])
[2023-11-03 11:26:08,560 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-11-03 11:26:08,560 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:26:08,560 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:26:08,560 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-03 11:26:08,725 INFO  L130       PetriNetUnfolder]: 36197/69251 cut-off events.
[2023-11-03 11:26:08,725 INFO  L131       PetriNetUnfolder]: For 38254/44798 co-relation queries the response was YES.
[2023-11-03 11:26:08,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 166379 conditions, 69251 events. 36197/69251 cut-off events. For 38254/44798 co-relation queries the response was YES. Maximal size of possible extension queue 2423. Compared 691296 event pairs, 15592 based on Foata normal form. 967/64854 useless extension candidates. Maximal degree in co-relation 166368. Up to 32701 conditions per place. 
[2023-11-03 11:26:09,134 INFO  L137   encePairwiseOnDemand]: 237/245 looper letters, 50 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2023-11-03 11:26:09,134 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 764 flow
[2023-11-03 11:26:09,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 11:26:09,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 11:26:09,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions.
[2023-11-03 11:26:09,136 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6027210884353742
[2023-11-03 11:26:09,136 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 443 transitions.
[2023-11-03 11:26:09,136 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions.
[2023-11-03 11:26:09,136 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:26:09,136 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions.
[2023-11-03 11:26:09,137 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:09,137 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:09,137 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:09,137 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 443 transitions.
[2023-11-03 11:26:09,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 764 flow
[2023-11-03 11:26:09,710 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 764 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:26:09,711 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2023-11-03 11:26:09,712 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=139}
[2023-11-03 11:26:09,712 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2023-11-03 11:26:09,712 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2023-11-03 11:26:09,714 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:09,714 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:26:09,715 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:26:09,715 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-11-03 11:26:09,715 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:26:09,716 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:26:09,716 INFO  L85        PathProgramCache]: Analyzing trace with hash 871548223, now seen corresponding path program 1 times
[2023-11-03 11:26:09,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:26:09,717 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521226042]
[2023-11-03 11:26:09,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:26:09,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:26:09,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:26:09,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:26:09,852 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:26:09,852 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521226042]
[2023-11-03 11:26:09,853 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521226042] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:26:09,853 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:26:09,853 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:26:09,853 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804510650]
[2023-11-03 11:26:09,853 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:26:09,853 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:26:09,854 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:26:09,854 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:26:09,854 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:26:10,136 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 245
[2023-11-03 11:26:10,137 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 139 transitions, 646 flow. Second operand  has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:10,137 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:26:10,137 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 245
[2023-11-03 11:26:10,137 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:26:20,037 INFO  L130       PetriNetUnfolder]: 78201/123586 cut-off events.
[2023-11-03 11:26:20,038 INFO  L131       PetriNetUnfolder]: For 93941/95137 co-relation queries the response was YES.
[2023-11-03 11:26:20,357 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 340505 conditions, 123586 events. 78201/123586 cut-off events. For 93941/95137 co-relation queries the response was YES. Maximal size of possible extension queue 2848. Compared 1012760 event pairs, 27187 based on Foata normal form. 0/117879 useless extension candidates. Maximal degree in co-relation 340493. Up to 88234 conditions per place. 
[2023-11-03 11:26:20,804 INFO  L137   encePairwiseOnDemand]: 226/245 looper letters, 148 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2023-11-03 11:26:20,804 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1807 flow
[2023-11-03 11:26:20,805 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:26:20,805 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:26:20,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 875 transitions.
[2023-11-03 11:26:20,806 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5952380952380952
[2023-11-03 11:26:20,806 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 875 transitions.
[2023-11-03 11:26:20,806 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 875 transitions.
[2023-11-03 11:26:20,806 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:26:20,806 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 875 transitions.
[2023-11-03 11:26:20,807 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:20,808 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:20,809 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:20,809 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 875 transitions.
[2023-11-03 11:26:20,809 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1807 flow
[2023-11-03 11:26:20,927 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1807 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:26:20,929 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2023-11-03 11:26:20,929 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1604, PETRI_PLACES=99, PETRI_TRANSITIONS=240}
[2023-11-03 11:26:20,930 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2023-11-03 11:26:20,930 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2023-11-03 11:26:20,930 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:20,930 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:26:20,930 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:26:20,930 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-11-03 11:26:20,930 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:26:20,931 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:26:20,931 INFO  L85        PathProgramCache]: Analyzing trace with hash 1259099398, now seen corresponding path program 1 times
[2023-11-03 11:26:20,931 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:26:20,931 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993582953]
[2023-11-03 11:26:20,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:26:20,931 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:26:20,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:26:21,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:26:21,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:26:21,073 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993582953]
[2023-11-03 11:26:21,073 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993582953] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:26:21,073 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:26:21,073 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:26:21,074 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730304696]
[2023-11-03 11:26:21,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:26:21,074 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:26:21,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:26:21,075 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:26:21,075 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:26:21,277 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245
[2023-11-03 11:26:21,278 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 240 transitions, 1604 flow. Second operand  has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:21,278 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:26:21,278 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245
[2023-11-03 11:26:21,278 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:26:43,533 INFO  L130       PetriNetUnfolder]: 165587/252270 cut-off events.
[2023-11-03 11:26:43,533 INFO  L131       PetriNetUnfolder]: For 287960/290697 co-relation queries the response was YES.
[2023-11-03 11:26:44,313 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 817394 conditions, 252270 events. 165587/252270 cut-off events. For 287960/290697 co-relation queries the response was YES. Maximal size of possible extension queue 5144. Compared 2087933 event pairs, 47460 based on Foata normal form. 0/237885 useless extension candidates. Maximal degree in co-relation 817377. Up to 165386 conditions per place. 
[2023-11-03 11:26:45,340 INFO  L137   encePairwiseOnDemand]: 215/245 looper letters, 334 selfloop transitions, 162 changer transitions 0/517 dead transitions.
[2023-11-03 11:26:45,340 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 517 transitions, 4078 flow
[2023-11-03 11:26:45,341 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:26:45,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:26:45,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions.
[2023-11-03 11:26:45,342 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6163265306122448
[2023-11-03 11:26:45,342 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 906 transitions.
[2023-11-03 11:26:45,342 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 906 transitions.
[2023-11-03 11:26:45,342 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:26:45,342 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 906 transitions.
[2023-11-03 11:26:45,343 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 151.0) internal successors, (906), 6 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:45,344 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:45,344 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:45,344 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 906 transitions.
[2023-11-03 11:26:45,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 517 transitions, 4078 flow
[2023-11-03 11:26:46,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 517 transitions, 4078 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:26:46,789 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2023-11-03 11:26:46,790 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3161, PETRI_PLACES=108, PETRI_TRANSITIONS=395}
[2023-11-03 11:26:46,790 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2023-11-03 11:26:46,790 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2023-11-03 11:26:46,790 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:46,790 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:26:46,790 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:26:46,791 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2023-11-03 11:26:46,791 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:26:46,791 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:26:46,791 INFO  L85        PathProgramCache]: Analyzing trace with hash -610559931, now seen corresponding path program 1 times
[2023-11-03 11:26:46,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:26:46,792 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299008449]
[2023-11-03 11:26:46,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:26:46,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:26:46,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:26:47,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 11:26:47,015 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:26:47,015 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299008449]
[2023-11-03 11:26:47,015 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299008449] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:26:47,015 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153722160]
[2023-11-03 11:26:47,016 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:26:47,016 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:26:47,016 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:26:47,017 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:26:47,023 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-11-03 11:26:47,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:26:47,139 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-11-03 11:26:47,142 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:26:47,218 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 11:26:47,243 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:26:47,244 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 11:26:47,285 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:26:47,287 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:26:47,288 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 11:26:47,332 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:26:47,334 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:26:47,335 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:26:47,336 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 11:26:47,402 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:26:47,403 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 11:26:47,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 11:26:47,436 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:26:47,463 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2023-11-03 11:26:47,498 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))) is different from false
[2023-11-03 11:26:47,519 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2)))))) is different from false
[2023-11-03 11:26:47,542 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))) is different from false
[2023-11-03 11:26:47,563 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:26:47,563 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-11-03 11:26:47,569 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:26:47,570 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2023-11-03 11:26:47,577 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2023-11-03 11:26:47,583 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:26:47,584 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-11-03 11:26:47,590 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:26:47,590 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 11:26:47,596 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:26:47,596 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 11:26:47,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked.
[2023-11-03 11:26:47,623 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [153722160] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:26:47,623 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:26:47,624 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2023-11-03 11:26:47,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239621440]
[2023-11-03 11:26:47,624 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:26:47,624 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-11-03 11:26:47,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:26:47,625 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-11-03 11:26:47,625 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=122, Unknown=4, NotChecked=108, Total=306
[2023-11-03 11:26:47,627 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 245
[2023-11-03 11:26:47,628 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 395 transitions, 3161 flow. Second operand  has 18 states, 18 states have (on average 92.33333333333333) internal successors, (1662), 18 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:26:47,628 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:26:47,628 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 245
[2023-11-03 11:26:47,628 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:27:31,344 INFO  L130       PetriNetUnfolder]: 291944/413543 cut-off events.
[2023-11-03 11:27:31,344 INFO  L131       PetriNetUnfolder]: For 908623/908623 co-relation queries the response was YES.
[2023-11-03 11:27:32,875 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1581123 conditions, 413543 events. 291944/413543 cut-off events. For 908623/908623 co-relation queries the response was YES. Maximal size of possible extension queue 6781. Compared 3087256 event pairs, 146441 based on Foata normal form. 6822/389908 useless extension candidates. Maximal degree in co-relation 1581101. Up to 397760 conditions per place. 
[2023-11-03 11:27:34,659 INFO  L137   encePairwiseOnDemand]: 228/245 looper letters, 440 selfloop transitions, 7 changer transitions 11/464 dead transitions.
[2023-11-03 11:27:34,660 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 464 transitions, 4550 flow
[2023-11-03 11:27:34,660 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 11:27:34,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 11:27:34,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 739 transitions.
[2023-11-03 11:27:34,661 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.43090379008746355
[2023-11-03 11:27:34,661 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 739 transitions.
[2023-11-03 11:27:34,662 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 739 transitions.
[2023-11-03 11:27:34,662 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:27:34,662 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 739 transitions.
[2023-11-03 11:27:34,663 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:27:34,664 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:27:34,664 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:27:34,664 INFO  L175             Difference]: Start difference. First operand has 108 places, 395 transitions, 3161 flow. Second operand 7 states and 739 transitions.
[2023-11-03 11:27:34,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 464 transitions, 4550 flow
[2023-11-03 11:28:21,520 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 464 transitions, 4454 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-11-03 11:28:21,524 INFO  L231             Difference]: Finished difference. Result has 115 places, 396 transitions, 3125 flow
[2023-11-03 11:28:21,525 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=3053, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3125, PETRI_PLACES=115, PETRI_TRANSITIONS=396}
[2023-11-03 11:28:21,525 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 35 predicate places.
[2023-11-03 11:28:21,525 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 396 transitions, 3125 flow
[2023-11-03 11:28:21,526 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 92.33333333333333) internal successors, (1662), 18 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:21,526 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:28:21,526 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:28:21,534 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-11-03 11:28:21,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2023-11-03 11:28:21,727 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:28:21,728 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:28:21,728 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345210140, now seen corresponding path program 1 times
[2023-11-03 11:28:21,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:28:21,729 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358464038]
[2023-11-03 11:28:21,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:28:21,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:28:21,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:28:21,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:28:21,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:28:21,973 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358464038]
[2023-11-03 11:28:21,973 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358464038] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:28:21,973 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:28:21,973 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-03 11:28:21,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409138665]
[2023-11-03 11:28:21,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:28:21,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-03 11:28:21,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:28:21,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-03 11:28:21,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-03 11:28:22,346 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245
[2023-11-03 11:28:22,347 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 396 transitions, 3125 flow. Second operand  has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:28:22,347 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:28:22,347 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245
[2023-11-03 11:28:22,347 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:29:00,874 INFO  L130       PetriNetUnfolder]: 228393/343031 cut-off events.
[2023-11-03 11:29:00,875 INFO  L131       PetriNetUnfolder]: For 757384/758365 co-relation queries the response was YES.
[2023-11-03 11:29:02,530 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1360038 conditions, 343031 events. 228393/343031 cut-off events. For 757384/758365 co-relation queries the response was YES. Maximal size of possible extension queue 7498. Compared 2876108 event pairs, 59414 based on Foata normal form. 3134/339928 useless extension candidates. Maximal degree in co-relation 1360011. Up to 157988 conditions per place. 
[2023-11-03 11:29:04,207 INFO  L137   encePairwiseOnDemand]: 225/245 looper letters, 593 selfloop transitions, 254 changer transitions 0/865 dead transitions.
[2023-11-03 11:29:04,207 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 865 transitions, 8001 flow
[2023-11-03 11:29:04,208 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 11:29:04,208 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 11:29:04,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1142 transitions.
[2023-11-03 11:29:04,209 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5826530612244898
[2023-11-03 11:29:04,210 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1142 transitions.
[2023-11-03 11:29:04,210 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1142 transitions.
[2023-11-03 11:29:04,210 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:29:04,210 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1142 transitions.
[2023-11-03 11:29:04,211 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 142.75) internal successors, (1142), 8 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:04,212 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:04,213 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:04,213 INFO  L175             Difference]: Start difference. First operand has 115 places, 396 transitions, 3125 flow. Second operand 8 states and 1142 transitions.
[2023-11-03 11:29:04,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 865 transitions, 8001 flow
[2023-11-03 11:29:42,919 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 865 transitions, 7917 flow, removed 31 selfloop flow, removed 2 redundant places.
[2023-11-03 11:29:42,926 INFO  L231             Difference]: Finished difference. Result has 126 places, 588 transitions, 5772 flow
[2023-11-03 11:29:42,927 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=3105, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5772, PETRI_PLACES=126, PETRI_TRANSITIONS=588}
[2023-11-03 11:29:42,927 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 46 predicate places.
[2023-11-03 11:29:42,927 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 588 transitions, 5772 flow
[2023-11-03 11:29:42,927 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:42,927 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:29:42,927 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:29:42,927 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2023-11-03 11:29:42,928 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:29:42,928 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:29:42,928 INFO  L85        PathProgramCache]: Analyzing trace with hash 228363183, now seen corresponding path program 1 times
[2023-11-03 11:29:42,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:29:42,928 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204184183]
[2023-11-03 11:29:42,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:29:42,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:29:42,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:29:43,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-03 11:29:43,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:29:43,101 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204184183]
[2023-11-03 11:29:43,101 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204184183] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:29:43,101 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:29:43,101 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:29:43,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008802007]
[2023-11-03 11:29:43,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:29:43,102 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:29:43,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:29:43,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:29:43,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:29:43,340 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245
[2023-11-03 11:29:43,341 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 588 transitions, 5772 flow. Second operand  has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:29:43,341 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:29:43,341 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245
[2023-11-03 11:29:43,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:30:43,815 INFO  L130       PetriNetUnfolder]: 308170/464788 cut-off events.
[2023-11-03 11:30:43,816 INFO  L131       PetriNetUnfolder]: For 2081507/2092589 co-relation queries the response was YES.
[2023-11-03 11:30:46,527 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2167304 conditions, 464788 events. 308170/464788 cut-off events. For 2081507/2092589 co-relation queries the response was YES. Maximal size of possible extension queue 10022. Compared 4060386 event pairs, 85304 based on Foata normal form. 277/434042 useless extension candidates. Maximal degree in co-relation 2167271. Up to 352552 conditions per place. 
[2023-11-03 11:30:48,917 INFO  L137   encePairwiseOnDemand]: 215/245 looper letters, 647 selfloop transitions, 213 changer transitions 0/878 dead transitions.
[2023-11-03 11:30:48,918 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 878 transitions, 9838 flow
[2023-11-03 11:30:48,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:30:48,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:30:48,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 902 transitions.
[2023-11-03 11:30:48,920 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6136054421768707
[2023-11-03 11:30:48,920 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 902 transitions.
[2023-11-03 11:30:48,920 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 902 transitions.
[2023-11-03 11:30:48,920 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:30:48,920 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 902 transitions.
[2023-11-03 11:30:48,921 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 150.33333333333334) internal successors, (902), 6 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:48,923 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:48,923 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:30:48,923 INFO  L175             Difference]: Start difference. First operand has 126 places, 588 transitions, 5772 flow. Second operand 6 states and 902 transitions.
[2023-11-03 11:30:48,923 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 878 transitions, 9838 flow
[2023-11-03 11:31:38,147 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 878 transitions, 9762 flow, removed 38 selfloop flow, removed 0 redundant places.
[2023-11-03 11:31:38,157 INFO  L231             Difference]: Finished difference. Result has 135 places, 756 transitions, 8072 flow
[2023-11-03 11:31:38,157 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=5696, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8072, PETRI_PLACES=135, PETRI_TRANSITIONS=756}
[2023-11-03 11:31:38,158 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 55 predicate places.
[2023-11-03 11:31:38,158 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 756 transitions, 8072 flow
[2023-11-03 11:31:38,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:38,159 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:31:38,159 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:31:38,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2023-11-03 11:31:38,159 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-03 11:31:38,160 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:31:38,160 INFO  L85        PathProgramCache]: Analyzing trace with hash 1129922456, now seen corresponding path program 1 times
[2023-11-03 11:31:38,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:31:38,161 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215123749]
[2023-11-03 11:31:38,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:31:38,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:31:38,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:31:38,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:31:38,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:31:38,482 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215123749]
[2023-11-03 11:31:38,483 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215123749] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:31:38,483 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803221465]
[2023-11-03 11:31:38,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:31:38,483 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:31:38,483 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:31:38,486 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 11:31:38,490 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-03 11:31:38,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:31:38,620 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-11-03 11:31:38,624 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:31:38,637 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-11-03 11:31:38,637 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 70
[2023-11-03 11:31:38,733 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-03 11:31:38,734 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-11-03 11:31:38,761 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-11-03 11:31:38,789 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:31:38,804 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-03 11:31:38,821 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:31:38,822 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-11-03 11:31:38,847 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:31:38,847 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-11-03 11:31:38,885 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-11-03 11:31:38,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:31:38,898 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 11:31:38,898 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803221465] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:31:38,898 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 11:31:38,898 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 10
[2023-11-03 11:31:38,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034639792]
[2023-11-03 11:31:38,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:31:38,899 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-03 11:31:38,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:31:38,900 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-03 11:31:38,900 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2023-11-03 11:31:39,558 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 245
[2023-11-03 11:31:39,559 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 756 transitions, 8072 flow. Second operand  has 10 states, 10 states have (on average 102.4) internal successors, (1024), 10 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 11:31:39,559 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:31:39,559 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 245
[2023-11-03 11:31:39,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
