./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-struct-in-array.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-struct-in-array.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 81158b50f242c86171ca71449256e85a5ba990b96d32623e947acdc387b5ed11
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-26 08:51:09,377 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-26 08:51:09,379 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-26 08:51:09,445 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-26 08:51:09,445 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-26 08:51:09,448 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-26 08:51:09,450 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-26 08:51:09,452 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-26 08:51:09,454 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-26 08:51:09,460 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-26 08:51:09,462 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-26 08:51:09,463 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-26 08:51:09,463 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-26 08:51:09,466 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-26 08:51:09,467 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-26 08:51:09,469 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-26 08:51:09,470 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-26 08:51:09,471 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-26 08:51:09,472 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-26 08:51:09,486 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-26 08:51:09,487 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-26 08:51:09,489 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-26 08:51:09,490 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-26 08:51:09,491 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-26 08:51:09,499 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-26 08:51:09,499 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-26 08:51:09,499 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-26 08:51:09,501 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-26 08:51:09,501 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-26 08:51:09,502 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-26 08:51:09,517 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-26 08:51:09,518 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-26 08:51:09,520 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-26 08:51:09,521 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-26 08:51:09,523 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-26 08:51:09,523 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-26 08:51:09,523 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-26 08:51:09,524 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-26 08:51:09,524 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-26 08:51:09,525 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-26 08:51:09,525 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-26 08:51:09,526 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-26 08:51:09,562 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-26 08:51:09,563 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-26 08:51:09,563 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-26 08:51:09,563 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-26 08:51:09,564 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-26 08:51:09,564 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-26 08:51:09,564 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-26 08:51:09,565 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-26 08:51:09,565 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-26 08:51:09,565 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-26 08:51:09,565 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-26 08:51:09,565 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-26 08:51:09,566 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-26 08:51:09,566 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-26 08:51:09,566 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-26 08:51:09,566 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-26 08:51:09,566 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-26 08:51:09,566 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-26 08:51:09,567 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-26 08:51:09,567 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-26 08:51:09,567 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-26 08:51:09,567 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-26 08:51:09,567 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-26 08:51:09,568 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-26 08:51:09,568 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-26 08:51:09,568 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-26 08:51:09,568 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:51:09,568 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-26 08:51:09,569 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-26 08:51:09,569 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-26 08:51:09,569 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-26 08:51:09,569 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-26 08:51:09,569 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-26 08:51:09,569 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-26 08:51:09,570 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-26 08:51:09,570 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-26 08:51:09,570 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-26 08:51:09,570 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 -> 81158b50f242c86171ca71449256e85a5ba990b96d32623e947acdc387b5ed11
[2023-10-26 08:51:09,982 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 08:51:10,026 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 08:51:10,029 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 08:51:10,030 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 08:51:10,030 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 08:51:10,032 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i
[2023-10-26 08:51:11,820 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 08:51:12,271 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 08:51:12,272 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i
[2023-10-26 08:51:12,297 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/f49c9ae5d/66a28b65e9c847dcabcb9e8b2d8ef025/FLAG5c829ab69
[2023-10-26 08:51:12,321 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/f49c9ae5d/66a28b65e9c847dcabcb9e8b2d8ef025
[2023-10-26 08:51:12,325 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 08:51:12,326 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 08:51:12,330 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 08:51:12,330 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 08:51:12,332 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 08:51:12,335 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:51:12" (1/1) ...
[2023-10-26 08:51:12,343 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c74798f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:12, skipping insertion in model container
[2023-10-26 08:51:12,344 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:51:12" (1/1) ...
[2023-10-26 08:51:12,353 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 08:51:12,413 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 08:51:12,673 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:51:13,065 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:51:13,075 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 08:51:13,111 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:51:13,158 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:51:13,251 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 08:51:13,252 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13 WrapperNode
[2023-10-26 08:51:13,252 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 08:51:13,265 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 08:51:13,265 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 08:51:13,265 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 08:51:13,271 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,320 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,362 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2023-10-26 08:51:13,362 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 08:51:13,363 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 08:51:13,363 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 08:51:13,364 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 08:51:13,387 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,388 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,396 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,397 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,412 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,431 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,432 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,438 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,451 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 08:51:13,452 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 08:51:13,457 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 08:51:13,457 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 08:51:13,458 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (1/1) ...
[2023-10-26 08:51:13,462 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:51:13,483 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:13,504 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-26 08:51:13,543 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-26 08:51:13,549 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-26 08:51:13,550 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-26 08:51:13,550 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 08:51:13,551 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-26 08:51:13,551 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-26 08:51:13,551 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-26 08:51:13,551 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-26 08:51:13,552 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 08:51:13,552 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 08:51:13,552 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 08:51:13,552 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 08:51:13,553 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-26 08:51:13,760 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 08:51:13,770 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 08:51:14,248 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 08:51:14,254 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 08:51:14,265 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 08:51:14,272 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:51:14 BoogieIcfgContainer
[2023-10-26 08:51:14,272 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 08:51:14,274 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 08:51:14,274 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 08:51:14,276 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 08:51:14,278 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:51:12" (1/3) ...
[2023-10-26 08:51:14,278 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3278e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:51:14, skipping insertion in model container
[2023-10-26 08:51:14,293 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:13" (2/3) ...
[2023-10-26 08:51:14,293 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3278e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:51:14, skipping insertion in model container
[2023-10-26 08:51:14,294 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:51:14" (3/3) ...
[2023-10-26 08:51:14,296 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i
[2023-10-26 08:51:14,303 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 08:51:14,310 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 08:51:14,314 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2023-10-26 08:51:14,314 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 08:51:14,454 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-26 08:51:14,519 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-10-26 08:51:14,659 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-10-26 08:51:14,660 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:51:14,664 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-10-26 08:51:14,664 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2023-10-26 08:51:14,678 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2023-10-26 08:51:14,682 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:51:14,703 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2023-10-26 08:51:14,705 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2023-10-26 08:51:14,705 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-10-26 08:51:14,803 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-10-26 08:51:14,803 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:51:14,804 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-10-26 08:51:14,806 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2023-10-26 08:51:18,685 INFO  L134        LiptonReduction]: Checked pairs total: 10638
[2023-10-26 08:51:18,685 INFO  L136        LiptonReduction]: Total number of compositions: 70
[2023-10-26 08:51:18,703 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:51:18,722 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;@1f136fd2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:51:18,723 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-10-26 08:51:18,730 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-10-26 08:51:18,730 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:51:18,731 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:18,731 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:18,732 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:18,736 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:18,736 INFO  L85        PathProgramCache]: Analyzing trace with hash 1440899133, now seen corresponding path program 1 times
[2023-10-26 08:51:18,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:18,758 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473702290]
[2023-10-26 08:51:18,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:18,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:19,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:19,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:19,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:19,800 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473702290]
[2023-10-26 08:51:19,801 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473702290] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:19,809 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:19,810 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:19,811 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940888438]
[2023-10-26 08:51:19,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:19,818 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:19,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:19,852 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:19,860 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:20,342 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-10-26 08:51:20,345 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:20,345 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:20,346 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-10-26 08:51:20,346 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:20,618 INFO  L130       PetriNetUnfolder]: 152/518 cut-off events.
[2023-10-26 08:51:20,618 INFO  L131       PetriNetUnfolder]: For 8/12 co-relation queries the response was YES.
[2023-10-26 08:51:20,635 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 895 conditions, 518 events. 152/518 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2766 event pairs, 47 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 808. Up to 237 conditions per place. 
[2023-10-26 08:51:20,641 INFO  L137   encePairwiseOnDemand]: 176/192 looper letters, 49 selfloop transitions, 23 changer transitions 0/99 dead transitions.
[2023-10-26 08:51:20,641 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 350 flow
[2023-10-26 08:51:20,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:20,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:20,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions.
[2023-10-26 08:51:20,667 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5746527777777778
[2023-10-26 08:51:20,667 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 662 transitions.
[2023-10-26 08:51:20,668 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 662 transitions.
[2023-10-26 08:51:20,673 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:20,687 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 662 transitions.
[2023-10-26 08:51:20,694 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 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-10-26 08:51:20,706 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:20,707 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:20,709 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 662 transitions.
[2023-10-26 08:51:20,709 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 350 flow
[2023-10-26 08:51:20,728 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:20,731 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2023-10-26 08:51:20,733 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2023-10-26 08:51:20,737 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2023-10-26 08:51:20,753 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2023-10-26 08:51:20,753 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:20,753 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:20,754 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:20,754 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-26 08:51:20,755 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:20,756 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:20,757 INFO  L85        PathProgramCache]: Analyzing trace with hash 1491761304, now seen corresponding path program 1 times
[2023-10-26 08:51:20,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:20,760 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776409099]
[2023-10-26 08:51:20,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:20,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:20,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:21,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:21,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:21,145 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776409099]
[2023-10-26 08:51:21,145 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776409099] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:21,146 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:21,149 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:21,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418676318]
[2023-10-26 08:51:21,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:21,151 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:21,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:21,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:21,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:21,488 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 192
[2023-10-26 08:51:21,488 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 292 flow. Second operand  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:21,489 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:21,489 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 192
[2023-10-26 08:51:21,489 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:21,946 INFO  L130       PetriNetUnfolder]: 294/866 cut-off events.
[2023-10-26 08:51:21,946 INFO  L131       PetriNetUnfolder]: For 338/344 co-relation queries the response was YES.
[2023-10-26 08:51:21,947 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 866 events. 294/866 cut-off events. For 338/344 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5224 event pairs, 52 based on Foata normal form. 5/829 useless extension candidates. Maximal degree in co-relation 1919. Up to 411 conditions per place. 
[2023-10-26 08:51:21,958 INFO  L137   encePairwiseOnDemand]: 169/192 looper letters, 75 selfloop transitions, 50 changer transitions 0/153 dead transitions.
[2023-10-26 08:51:21,958 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 153 transitions, 805 flow
[2023-10-26 08:51:21,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:21,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:21,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions.
[2023-10-26 08:51:21,960 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5598958333333334
[2023-10-26 08:51:21,960 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 645 transitions.
[2023-10-26 08:51:21,969 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions.
[2023-10-26 08:51:21,970 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:21,970 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions.
[2023-10-26 08:51:21,971 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:21,981 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:21,982 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:21,982 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 6 states and 645 transitions.
[2023-10-26 08:51:21,982 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 153 transitions, 805 flow
[2023-10-26 08:51:21,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 805 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:21,999 INFO  L231             Difference]: Finished difference. Result has 79 places, 129 transitions, 770 flow
[2023-10-26 08:51:22,000 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=79, PETRI_TRANSITIONS=129}
[2023-10-26 08:51:22,001 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places.
[2023-10-26 08:51:22,001 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 129 transitions, 770 flow
[2023-10-26 08:51:22,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:22,002 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:22,002 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:22,002 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-26 08:51:22,002 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:22,002 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:22,003 INFO  L85        PathProgramCache]: Analyzing trace with hash 365353206, now seen corresponding path program 1 times
[2023-10-26 08:51:22,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:22,003 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357398980]
[2023-10-26 08:51:22,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:22,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:22,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:22,463 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:22,463 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:22,463 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357398980]
[2023-10-26 08:51:22,464 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357398980] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:22,465 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:22,481 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:22,482 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650801090]
[2023-10-26 08:51:22,482 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:22,483 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:22,483 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:22,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:22,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:22,949 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 192
[2023-10-26 08:51:22,950 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 129 transitions, 770 flow. Second operand  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:22,950 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:22,950 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 192
[2023-10-26 08:51:22,950 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:23,254 INFO  L130       PetriNetUnfolder]: 290/850 cut-off events.
[2023-10-26 08:51:23,255 INFO  L131       PetriNetUnfolder]: For 1132/1151 co-relation queries the response was YES.
[2023-10-26 08:51:23,256 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 850 events. 290/850 cut-off events. For 1132/1151 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5134 event pairs, 54 based on Foata normal form. 1/820 useless extension candidates. Maximal degree in co-relation 2430. Up to 452 conditions per place. 
[2023-10-26 08:51:23,260 INFO  L137   encePairwiseOnDemand]: 181/192 looper letters, 77 selfloop transitions, 33 changer transitions 8/171 dead transitions.
[2023-10-26 08:51:23,262 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1245 flow
[2023-10-26 08:51:23,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:23,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:23,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions.
[2023-10-26 08:51:23,284 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5807291666666666
[2023-10-26 08:51:23,284 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 669 transitions.
[2023-10-26 08:51:23,284 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions.
[2023-10-26 08:51:23,284 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:23,285 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions.
[2023-10-26 08:51:23,286 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:23,288 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:23,289 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:23,289 INFO  L175             Difference]: Start difference. First operand has 79 places, 129 transitions, 770 flow. Second operand 6 states and 669 transitions.
[2023-10-26 08:51:23,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 1245 flow
[2023-10-26 08:51:23,298 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1245 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:23,303 INFO  L231             Difference]: Finished difference. Result has 89 places, 159 transitions, 1135 flow
[2023-10-26 08:51:23,304 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1135, PETRI_PLACES=89, PETRI_TRANSITIONS=159}
[2023-10-26 08:51:23,305 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2023-10-26 08:51:23,312 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1135 flow
[2023-10-26 08:51:23,313 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:23,313 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:23,313 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]
[2023-10-26 08:51:23,313 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-26 08:51:23,316 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:23,317 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:23,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -1763579770, now seen corresponding path program 1 times
[2023-10-26 08:51:23,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:23,318 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593997687]
[2023-10-26 08:51:23,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:23,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:23,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:23,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-10-26 08:51:23,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:23,803 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593997687]
[2023-10-26 08:51:23,803 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593997687] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:23,803 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:23,803 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:23,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239197225]
[2023-10-26 08:51:23,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:23,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:23,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:23,805 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:23,806 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:23,965 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192
[2023-10-26 08:51:23,966 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 159 transitions, 1135 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:23,966 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:23,966 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192
[2023-10-26 08:51:23,966 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:24,555 INFO  L130       PetriNetUnfolder]: 555/1369 cut-off events.
[2023-10-26 08:51:24,556 INFO  L131       PetriNetUnfolder]: For 1875/1889 co-relation queries the response was YES.
[2023-10-26 08:51:24,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4980 conditions, 1369 events. 555/1369 cut-off events. For 1875/1889 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8623 event pairs, 99 based on Foata normal form. 0/1280 useless extension candidates. Maximal degree in co-relation 4798. Up to 1020 conditions per place. 
[2023-10-26 08:51:24,586 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 172 selfloop transitions, 111 changer transitions 10/308 dead transitions.
[2023-10-26 08:51:24,586 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 308 transitions, 2383 flow
[2023-10-26 08:51:24,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:24,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:24,588 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions.
[2023-10-26 08:51:24,589 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5972222222222222
[2023-10-26 08:51:24,589 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 688 transitions.
[2023-10-26 08:51:24,589 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 688 transitions.
[2023-10-26 08:51:24,590 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:24,591 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 688 transitions.
[2023-10-26 08:51:24,593 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:24,595 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:24,596 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:24,597 INFO  L175             Difference]: Start difference. First operand has 89 places, 159 transitions, 1135 flow. Second operand 6 states and 688 transitions.
[2023-10-26 08:51:24,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 308 transitions, 2383 flow
[2023-10-26 08:51:24,611 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 308 transitions, 2383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:24,637 INFO  L231             Difference]: Finished difference. Result has 97 places, 262 transitions, 2045 flow
[2023-10-26 08:51:24,638 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2045, PETRI_PLACES=97, PETRI_TRANSITIONS=262}
[2023-10-26 08:51:24,639 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places.
[2023-10-26 08:51:24,639 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 262 transitions, 2045 flow
[2023-10-26 08:51:24,640 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:24,640 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:24,640 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:24,640 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-26 08:51:24,641 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:24,641 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:24,641 INFO  L85        PathProgramCache]: Analyzing trace with hash -766543501, now seen corresponding path program 1 times
[2023-10-26 08:51:24,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:24,642 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413644025]
[2023-10-26 08:51:24,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:24,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:24,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:25,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:25,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:25,480 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413644025]
[2023-10-26 08:51:25,480 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413644025] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:25,480 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992776301]
[2023-10-26 08:51:25,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:25,480 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:25,481 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:25,499 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:51:25,535 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-26 08:51:25,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:25,666 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-26 08:51:25,689 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:25,851 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 17 treesize of output 9
[2023-10-26 08:51:26,088 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-10-26 08:51:26,124 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:26,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 21 treesize of output 20
[2023-10-26 08:51:26,197 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:26,198 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:26,203 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-10-26 08:51:26,262 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:26,263 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:26,265 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:26,273 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-10-26 08:51:26,361 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:26,362 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-10-26 08:51:26,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:26,412 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:26,468 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2023-10-26 08:51:26,515 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0))))) is different from false
[2023-10-26 08:51:26,551 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false
[2023-10-26 08:51:26,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-26 08:51:26,721 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992776301] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:26,721 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:26,721 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-10-26 08:51:26,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798219884]
[2023-10-26 08:51:26,723 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:26,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-26 08:51:26,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:26,727 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-26 08:51:26,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=460, Unknown=3, NotChecked=138, Total=702
[2023-10-26 08:51:26,810 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 192
[2023-10-26 08:51:26,812 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 262 transitions, 2045 flow. Second operand  has 27 states, 27 states have (on average 61.592592592592595) internal successors, (1663), 27 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:26,813 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:26,813 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 192
[2023-10-26 08:51:26,813 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:28,295 INFO  L130       PetriNetUnfolder]: 631/1458 cut-off events.
[2023-10-26 08:51:28,309 INFO  L131       PetriNetUnfolder]: For 3368/3368 co-relation queries the response was YES.
[2023-10-26 08:51:28,313 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6500 conditions, 1458 events. 631/1458 cut-off events. For 3368/3368 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9140 event pairs, 83 based on Foata normal form. 10/1368 useless extension candidates. Maximal degree in co-relation 6377. Up to 1331 conditions per place. 
[2023-10-26 08:51:28,320 INFO  L137   encePairwiseOnDemand]: 182/192 looper letters, 304 selfloop transitions, 12 changer transitions 12/330 dead transitions.
[2023-10-26 08:51:28,333 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 330 transitions, 3086 flow
[2023-10-26 08:51:28,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-10-26 08:51:28,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-10-26 08:51:28,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2023-10-26 08:51:28,336 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3692708333333333
[2023-10-26 08:51:28,336 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2023-10-26 08:51:28,336 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2023-10-26 08:51:28,337 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:28,337 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2023-10-26 08:51:28,339 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.9) internal successors, (709), 10 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:28,341 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:28,341 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:28,342 INFO  L175             Difference]: Start difference. First operand has 97 places, 262 transitions, 2045 flow. Second operand 10 states and 709 transitions.
[2023-10-26 08:51:28,342 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 330 transitions, 3086 flow
[2023-10-26 08:51:28,413 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 2942 flow, removed 72 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:28,417 INFO  L231             Difference]: Finished difference. Result has 107 places, 265 transitions, 1941 flow
[2023-10-26 08:51:28,417 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1941, PETRI_PLACES=107, PETRI_TRANSITIONS=265}
[2023-10-26 08:51:28,419 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places.
[2023-10-26 08:51:28,420 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 265 transitions, 1941 flow
[2023-10-26 08:51:28,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 61.592592592592595) internal successors, (1663), 27 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:28,421 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:28,421 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:28,437 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-26 08:51:28,625 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:28,626 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:28,626 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:28,626 INFO  L85        PathProgramCache]: Analyzing trace with hash 140689641, now seen corresponding path program 1 times
[2023-10-26 08:51:28,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:28,627 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173654939]
[2023-10-26 08:51:28,627 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:28,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:28,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:29,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:29,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:29,257 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173654939]
[2023-10-26 08:51:29,257 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173654939] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:29,257 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253012978]
[2023-10-26 08:51:29,257 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:29,258 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:29,258 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:29,259 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-10-26 08:51:29,305 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-10-26 08:51:29,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:29,434 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-26 08:51:29,437 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:29,457 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 17 treesize of output 9
[2023-10-26 08:51:29,560 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-10-26 08:51:29,595 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:51:29,647 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:29,656 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32
[2023-10-26 08:51:29,703 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:29,706 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:51:29,786 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:29,787 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-10-26 08:51:29,795 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:29,795 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:29,843 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:51:29,871 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:51:29,904 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:51:30,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:51:30,060 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [253012978] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:30,060 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:30,060 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-26 08:51:30,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205569417]
[2023-10-26 08:51:30,061 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:30,061 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:51:30,061 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:30,062 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:51:30,063 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-26 08:51:30,064 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2023-10-26 08:51:30,066 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 265 transitions, 1941 flow. Second operand  has 26 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:30,066 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:30,067 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2023-10-26 08:51:30,067 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:32,820 INFO  L130       PetriNetUnfolder]: 674/1547 cut-off events.
[2023-10-26 08:51:32,821 INFO  L131       PetriNetUnfolder]: For 3758/3764 co-relation queries the response was YES.
[2023-10-26 08:51:32,825 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6977 conditions, 1547 events. 674/1547 cut-off events. For 3758/3764 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9797 event pairs, 106 based on Foata normal form. 2/1468 useless extension candidates. Maximal degree in co-relation 6844. Up to 962 conditions per place. 
[2023-10-26 08:51:32,831 INFO  L137   encePairwiseOnDemand]: 141/192 looper letters, 305 selfloop transitions, 163 changer transitions 40/510 dead transitions.
[2023-10-26 08:51:32,845 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 510 transitions, 4404 flow
[2023-10-26 08:51:32,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-26 08:51:32,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-26 08:51:32,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1396 transitions.
[2023-10-26 08:51:32,850 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3826754385964912
[2023-10-26 08:51:32,851 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1396 transitions.
[2023-10-26 08:51:32,851 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1396 transitions.
[2023-10-26 08:51:32,852 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:32,852 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1396 transitions.
[2023-10-26 08:51:32,855 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 73.47368421052632) internal successors, (1396), 19 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:32,859 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:32,874 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:32,874 INFO  L175             Difference]: Start difference. First operand has 107 places, 265 transitions, 1941 flow. Second operand 19 states and 1396 transitions.
[2023-10-26 08:51:32,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 510 transitions, 4404 flow
[2023-10-26 08:51:32,908 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 510 transitions, 4376 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-26 08:51:32,917 INFO  L231             Difference]: Finished difference. Result has 127 places, 328 transitions, 3030 flow
[2023-10-26 08:51:32,918 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3030, PETRI_PLACES=127, PETRI_TRANSITIONS=328}
[2023-10-26 08:51:32,935 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 68 predicate places.
[2023-10-26 08:51:32,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 328 transitions, 3030 flow
[2023-10-26 08:51:32,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:32,937 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:32,937 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]
[2023-10-26 08:51:32,944 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-26 08:51:33,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:33,142 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:33,143 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:33,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 1201166498, now seen corresponding path program 1 times
[2023-10-26 08:51:33,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:33,143 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690270048]
[2023-10-26 08:51:33,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:33,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:33,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:33,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:33,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:33,301 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690270048]
[2023-10-26 08:51:33,305 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690270048] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:33,305 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359697407]
[2023-10-26 08:51:33,306 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:33,306 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:33,306 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:33,322 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-10-26 08:51:33,355 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-10-26 08:51:33,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:33,497 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-26 08:51:33,498 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:33,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:33,555 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:33,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:33,610 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359697407] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:33,610 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:33,610 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-26 08:51:33,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241906004]
[2023-10-26 08:51:33,611 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:33,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-26 08:51:33,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:33,612 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-26 08:51:33,612 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-26 08:51:33,756 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 192
[2023-10-26 08:51:33,757 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 328 transitions, 3030 flow. Second operand  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:33,757 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:33,758 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 192
[2023-10-26 08:51:33,758 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:34,004 INFO  L130       PetriNetUnfolder]: 274/808 cut-off events.
[2023-10-26 08:51:34,004 INFO  L131       PetriNetUnfolder]: For 2711/2727 co-relation queries the response was YES.
[2023-10-26 08:51:34,007 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 808 events. 274/808 cut-off events. For 2711/2727 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5020 event pairs, 11 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 3727. Up to 246 conditions per place. 
[2023-10-26 08:51:34,011 INFO  L137   encePairwiseOnDemand]: 186/192 looper letters, 24 selfloop transitions, 10 changer transitions 3/248 dead transitions.
[2023-10-26 08:51:34,025 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 248 transitions, 2348 flow
[2023-10-26 08:51:34,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 08:51:34,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 08:51:34,027 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions.
[2023-10-26 08:51:34,028 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5729166666666666
[2023-10-26 08:51:34,028 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 770 transitions.
[2023-10-26 08:51:34,028 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions.
[2023-10-26 08:51:34,028 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:34,028 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions.
[2023-10-26 08:51:34,030 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:34,031 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:34,032 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:34,032 INFO  L175             Difference]: Start difference. First operand has 127 places, 328 transitions, 3030 flow. Second operand 7 states and 770 transitions.
[2023-10-26 08:51:34,032 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 248 transitions, 2348 flow
[2023-10-26 08:51:34,071 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 248 transitions, 2248 flow, removed 28 selfloop flow, removed 8 redundant places.
[2023-10-26 08:51:34,074 INFO  L231             Difference]: Finished difference. Result has 113 places, 240 transitions, 2156 flow
[2023-10-26 08:51:34,074 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2156, PETRI_PLACES=113, PETRI_TRANSITIONS=240}
[2023-10-26 08:51:34,075 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 54 predicate places.
[2023-10-26 08:51:34,075 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 240 transitions, 2156 flow
[2023-10-26 08:51:34,075 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:34,075 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:34,076 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]
[2023-10-26 08:51:34,096 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-10-26 08:51:34,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:34,280 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:34,280 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:34,280 INFO  L85        PathProgramCache]: Analyzing trace with hash 2116465637, now seen corresponding path program 1 times
[2023-10-26 08:51:34,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:34,280 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213372201]
[2023-10-26 08:51:34,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:34,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:34,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:34,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:34,824 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:34,824 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213372201]
[2023-10-26 08:51:34,825 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213372201] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:34,825 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312145142]
[2023-10-26 08:51:34,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:34,825 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:34,827 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:34,842 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-10-26 08:51:34,874 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-10-26 08:51:34,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:34,992 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-26 08:51:34,995 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:35,024 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 17 treesize of output 9
[2023-10-26 08:51:35,094 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-10-26 08:51:35,134 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:51:35,179 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:35,180 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32
[2023-10-26 08:51:35,264 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:35,264 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:51:35,330 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:35,331 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-10-26 08:51:35,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:35,353 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:35,374 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:51:35,410 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:51:35,457 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:51:35,596 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:51:35,597 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312145142] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:35,597 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:35,597 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-26 08:51:35,597 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13606879]
[2023-10-26 08:51:35,597 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:35,598 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:51:35,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:35,598 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:51:35,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-26 08:51:35,650 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 192
[2023-10-26 08:51:35,652 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 240 transitions, 2156 flow. Second operand  has 26 states, 26 states have (on average 56.73076923076923) internal successors, (1475), 26 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:35,652 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:35,652 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 192
[2023-10-26 08:51:35,652 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:39,114 INFO  L130       PetriNetUnfolder]: 523/1237 cut-off events.
[2023-10-26 08:51:39,114 INFO  L131       PetriNetUnfolder]: For 4531/4531 co-relation queries the response was YES.
[2023-10-26 08:51:39,120 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6650 conditions, 1237 events. 523/1237 cut-off events. For 4531/4531 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7532 event pairs, 30 based on Foata normal form. 43/1280 useless extension candidates. Maximal degree in co-relation 6497. Up to 649 conditions per place. 
[2023-10-26 08:51:39,139 INFO  L137   encePairwiseOnDemand]: 154/192 looper letters, 266 selfloop transitions, 192 changer transitions 8/468 dead transitions.
[2023-10-26 08:51:39,140 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 468 transitions, 4660 flow
[2023-10-26 08:51:39,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-10-26 08:51:39,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-10-26 08:51:39,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1344 transitions.
[2023-10-26 08:51:39,144 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35
[2023-10-26 08:51:39,144 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1344 transitions.
[2023-10-26 08:51:39,144 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1344 transitions.
[2023-10-26 08:51:39,144 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:39,145 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1344 transitions.
[2023-10-26 08:51:39,147 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 67.2) internal successors, (1344), 20 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:39,152 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 192.0) internal successors, (4032), 21 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:39,166 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 192.0) internal successors, (4032), 21 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:39,166 INFO  L175             Difference]: Start difference. First operand has 113 places, 240 transitions, 2156 flow. Second operand 20 states and 1344 transitions.
[2023-10-26 08:51:39,166 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 468 transitions, 4660 flow
[2023-10-26 08:51:39,187 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 468 transitions, 4632 flow, removed 8 selfloop flow, removed 4 redundant places.
[2023-10-26 08:51:39,214 INFO  L231             Difference]: Finished difference. Result has 133 places, 339 transitions, 3801 flow
[2023-10-26 08:51:39,214 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3801, PETRI_PLACES=133, PETRI_TRANSITIONS=339}
[2023-10-26 08:51:39,216 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 74 predicate places.
[2023-10-26 08:51:39,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 339 transitions, 3801 flow
[2023-10-26 08:51:39,216 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.73076923076923) internal successors, (1475), 26 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:39,217 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:39,217 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]
[2023-10-26 08:51:39,224 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-26 08:51:39,421 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:39,422 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:39,422 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:39,422 INFO  L85        PathProgramCache]: Analyzing trace with hash -831584502, now seen corresponding path program 1 times
[2023-10-26 08:51:39,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:39,422 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446500454]
[2023-10-26 08:51:39,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:39,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:39,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:40,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:40,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:40,041 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446500454]
[2023-10-26 08:51:40,041 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446500454] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:40,041 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547976916]
[2023-10-26 08:51:40,041 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:40,041 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:40,041 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:40,048 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-10-26 08:51:40,097 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-10-26 08:51:40,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:40,234 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-26 08:51:40,237 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:40,255 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 17 treesize of output 9
[2023-10-26 08:51:40,361 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-10-26 08:51:40,405 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:40,406 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-10-26 08:51:40,456 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:40,457 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:40,459 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-10-26 08:51:40,511 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:40,512 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:40,513 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:40,514 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-10-26 08:51:40,622 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:40,623 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-10-26 08:51:40,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:40,667 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:40,699 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false
[2023-10-26 08:51:40,732 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-10-26 08:51:41,208 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |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) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))))) is different from false
[2023-10-26 08:51:41,466 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:41,467 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 33 treesize of output 49
[2023-10-26 08:51:41,479 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:41,479 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 60 treesize of output 34
[2023-10-26 08:51:41,485 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 5 treesize of output 3
[2023-10-26 08:51:41,573 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:41,573 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547976916] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:41,574 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:41,574 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-10-26 08:51:41,574 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968990847]
[2023-10-26 08:51:41,574 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:41,574 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-26 08:51:41,574 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:41,574 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-26 08:51:41,575 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=513, Unknown=24, NotChecked=150, Total=812
[2023-10-26 08:51:41,893 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 192
[2023-10-26 08:51:41,895 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 339 transitions, 3801 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:41,895 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:41,895 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 192
[2023-10-26 08:51:41,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:42,957 INFO  L130       PetriNetUnfolder]: 497/1175 cut-off events.
[2023-10-26 08:51:42,957 INFO  L131       PetriNetUnfolder]: For 7183/7185 co-relation queries the response was YES.
[2023-10-26 08:51:42,961 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7793 conditions, 1175 events. 497/1175 cut-off events. For 7183/7185 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7026 event pairs, 34 based on Foata normal form. 30/1204 useless extension candidates. Maximal degree in co-relation 7627. Up to 1087 conditions per place. 
[2023-10-26 08:51:42,979 INFO  L137   encePairwiseOnDemand]: 183/192 looper letters, 346 selfloop transitions, 13 changer transitions 1/362 dead transitions.
[2023-10-26 08:51:42,980 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 362 transitions, 4660 flow
[2023-10-26 08:51:42,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-10-26 08:51:42,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-10-26 08:51:42,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 643 transitions.
[2023-10-26 08:51:42,983 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.33489583333333334
[2023-10-26 08:51:42,983 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 643 transitions.
[2023-10-26 08:51:42,983 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 643 transitions.
[2023-10-26 08:51:42,984 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:42,984 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 643 transitions.
[2023-10-26 08:51:42,985 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 64.3) internal successors, (643), 10 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:42,987 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:42,987 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:42,987 INFO  L175             Difference]: Start difference. First operand has 133 places, 339 transitions, 3801 flow. Second operand 10 states and 643 transitions.
[2023-10-26 08:51:42,988 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 362 transitions, 4660 flow
[2023-10-26 08:51:43,075 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 362 transitions, 4471 flow, removed 58 selfloop flow, removed 12 redundant places.
[2023-10-26 08:51:43,079 INFO  L231             Difference]: Finished difference. Result has 129 places, 330 transitions, 3543 flow
[2023-10-26 08:51:43,080 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=3509, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3543, PETRI_PLACES=129, PETRI_TRANSITIONS=330}
[2023-10-26 08:51:43,081 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 70 predicate places.
[2023-10-26 08:51:43,081 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 330 transitions, 3543 flow
[2023-10-26 08:51:43,081 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:43,081 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:43,082 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:43,104 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-10-26 08:51:43,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:43,286 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:43,286 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:43,287 INFO  L85        PathProgramCache]: Analyzing trace with hash 2140873883, now seen corresponding path program 2 times
[2023-10-26 08:51:43,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:43,287 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88718228]
[2023-10-26 08:51:43,287 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:43,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:43,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:44,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:44,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:44,155 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88718228]
[2023-10-26 08:51:44,155 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88718228] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:44,155 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377797379]
[2023-10-26 08:51:44,155 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:51:44,155 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:44,155 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:44,156 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-10-26 08:51:44,193 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-10-26 08:51:44,412 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:51:44,412 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:51:44,413 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-10-26 08:51:44,417 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:44,444 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 26 treesize of output 14
[2023-10-26 08:51:44,660 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-10-26 08:51:44,707 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:51:44,770 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:44,770 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32
[2023-10-26 08:51:44,855 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:44,856 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:51:44,939 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:44,942 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:44,942 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56
[2023-10-26 08:51:45,115 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:45,116 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:45,140 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-10-26 08:51:45,141 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56
[2023-10-26 08:51:45,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:45,166 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:46,303 INFO  L321             Elim1Store]: treesize reduction 242, result has 32.0 percent of original size
[2023-10-26 08:51:46,304 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 6 case distinctions, treesize of input 656 treesize of output 539
[2023-10-26 08:51:46,426 INFO  L321             Elim1Store]: treesize reduction 37, result has 63.4 percent of original size
[2023-10-26 08:51:46,426 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 723 treesize of output 592
[2023-10-26 08:51:46,455 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 55 treesize of output 53
[2023-10-26 08:51:46,475 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 53 treesize of output 49
[2023-10-26 08:51:46,496 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 49 treesize of output 45
[2023-10-26 08:51:46,522 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 45 treesize of output 41
[2023-10-26 08:51:47,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:47,164 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377797379] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:47,164 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:47,164 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30
[2023-10-26 08:51:47,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379877565]
[2023-10-26 08:51:47,164 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:47,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-10-26 08:51:47,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:47,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-10-26 08:51:47,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=828, Unknown=3, NotChecked=0, Total=992
[2023-10-26 08:51:52,676 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 192
[2023-10-26 08:51:52,677 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 330 transitions, 3543 flow. Second operand  has 32 states, 32 states have (on average 56.75) internal successors, (1816), 32 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:52,677 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:52,677 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 192
[2023-10-26 08:51:52,677 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:56,264 INFO  L130       PetriNetUnfolder]: 482/1137 cut-off events.
[2023-10-26 08:51:56,265 INFO  L131       PetriNetUnfolder]: For 6525/6527 co-relation queries the response was YES.
[2023-10-26 08:51:56,268 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7201 conditions, 1137 events. 482/1137 cut-off events. For 6525/6527 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6756 event pairs, 10 based on Foata normal form. 20/1156 useless extension candidates. Maximal degree in co-relation 7043. Up to 402 conditions per place. 
[2023-10-26 08:51:56,294 INFO  L137   encePairwiseOnDemand]: 174/192 looper letters, 335 selfloop transitions, 147 changer transitions 6/490 dead transitions.
[2023-10-26 08:51:56,294 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 490 transitions, 5841 flow
[2023-10-26 08:51:56,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-26 08:51:56,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-26 08:51:56,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1228 transitions.
[2023-10-26 08:51:56,299 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3366228070175439
[2023-10-26 08:51:56,299 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1228 transitions.
[2023-10-26 08:51:56,299 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1228 transitions.
[2023-10-26 08:51:56,300 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:56,300 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1228 transitions.
[2023-10-26 08:51:56,303 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 64.63157894736842) internal successors, (1228), 19 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:56,306 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:56,307 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:56,307 INFO  L175             Difference]: Start difference. First operand has 129 places, 330 transitions, 3543 flow. Second operand 19 states and 1228 transitions.
[2023-10-26 08:51:56,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 490 transitions, 5841 flow
[2023-10-26 08:51:56,384 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 490 transitions, 5823 flow, removed 0 selfloop flow, removed 7 redundant places.
[2023-10-26 08:51:56,413 INFO  L231             Difference]: Finished difference. Result has 145 places, 342 transitions, 4132 flow
[2023-10-26 08:51:56,413 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=3525, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4132, PETRI_PLACES=145, PETRI_TRANSITIONS=342}
[2023-10-26 08:51:56,414 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 86 predicate places.
[2023-10-26 08:51:56,414 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 342 transitions, 4132 flow
[2023-10-26 08:51:56,415 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 56.75) internal successors, (1816), 32 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:56,415 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:56,415 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-26 08:51:56,436 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-10-26 08:51:56,619 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-10-26 08:51:56,620 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:51:56,620 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:56,620 INFO  L85        PathProgramCache]: Analyzing trace with hash 1212047773, now seen corresponding path program 1 times
[2023-10-26 08:51:56,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:56,620 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488659072]
[2023-10-26 08:51:56,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:56,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:56,689 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:51:56,690 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:51:56,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:51:56,752 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:51:56,753 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:51:56,766 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-10-26 08:51:56,768 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-10-26 08:51:56,768 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-10-26 08:51:56,769 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-10-26 08:51:56,769 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-10-26 08:51:56,769 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-10-26 08:51:56,769 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-10-26 08:51:56,769 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-10-26 08:51:56,769 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-10-26 08:51:56,769 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-26 08:51:56,770 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:56,772 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:51:56,772 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-26 08:51:56,809 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-26 08:51:56,812 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-10-26 08:51:56,854 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-10-26 08:51:56,869 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:51:56,870 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-10-26 08:51:56,870 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2023-10-26 08:51:56,873 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2023-10-26 08:51:56,873 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:51:56,873 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2023-10-26 08:51:56,874 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2023-10-26 08:51:56,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-10-26 08:51:56,896 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-10-26 08:51:56,903 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:51:56,904 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-10-26 08:51:56,906 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2023-10-26 08:52:00,191 INFO  L134        LiptonReduction]: Checked pairs total: 23741
[2023-10-26 08:52:00,191 INFO  L136        LiptonReduction]: Total number of compositions: 76
[2023-10-26 08:52:00,193 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:52:00,193 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;@1f136fd2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:52:00,193 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-10-26 08:52:00,195 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-10-26 08:52:00,195 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:52:00,195 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:00,195 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:00,195 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:52:00,195 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:00,196 INFO  L85        PathProgramCache]: Analyzing trace with hash -708344653, now seen corresponding path program 1 times
[2023-10-26 08:52:00,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:00,196 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610255687]
[2023-10-26 08:52:00,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:00,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:00,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:00,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:00,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:00,409 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610255687]
[2023-10-26 08:52:00,409 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610255687] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:00,410 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:00,410 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:52:00,410 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91772477]
[2023-10-26 08:52:00,410 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:00,410 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:52:00,410 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:00,411 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:52:00,419 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:52:00,669 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 215
[2023-10-26 08:52:00,669 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 154 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:00,669 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:00,670 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 215
[2023-10-26 08:52:00,670 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:01,722 INFO  L130       PetriNetUnfolder]: 2976/6074 cut-off events.
[2023-10-26 08:52:01,722 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2023-10-26 08:52:01,728 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11160 conditions, 6074 events. 2976/6074 cut-off events. For 191/349 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 41972 event pairs, 888 based on Foata normal form. 0/5674 useless extension candidates. Maximal degree in co-relation 5347. Up to 3609 conditions per place. 
[2023-10-26 08:52:01,760 INFO  L137   encePairwiseOnDemand]: 195/215 looper letters, 71 selfloop transitions, 42 changer transitions 0/143 dead transitions.
[2023-10-26 08:52:01,760 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 143 transitions, 538 flow
[2023-10-26 08:52:01,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:52:01,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:52:01,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-10-26 08:52:01,762 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5961240310077519
[2023-10-26 08:52:01,766 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-10-26 08:52:01,766 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-10-26 08:52:01,766 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:01,766 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-10-26 08:52:01,767 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 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-10-26 08:52:01,769 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:01,770 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:01,770 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 769 transitions.
[2023-10-26 08:52:01,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 143 transitions, 538 flow
[2023-10-26 08:52:01,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:52:01,781 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2023-10-26 08:52:01,781 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=81, PETRI_TRANSITIONS=110}
[2023-10-26 08:52:01,782 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2023-10-26 08:52:01,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2023-10-26 08:52:01,782 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:01,782 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:01,782 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:01,783 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-26 08:52:01,783 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:52:01,783 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:01,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -555411616, now seen corresponding path program 1 times
[2023-10-26 08:52:01,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:01,783 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37087353]
[2023-10-26 08:52:01,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:01,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:01,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:01,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:01,851 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:01,852 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37087353]
[2023-10-26 08:52:01,852 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37087353] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:01,852 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:01,852 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:52:01,852 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325565401]
[2023-10-26 08:52:01,852 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:01,853 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:52:01,853 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:01,854 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:52:01,854 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:52:01,918 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 215
[2023-10-26 08:52:01,919 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 446 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:01,919 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:01,919 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 215
[2023-10-26 08:52:01,919 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:02,727 INFO  L130       PetriNetUnfolder]: 1575/4192 cut-off events.
[2023-10-26 08:52:02,727 INFO  L131       PetriNetUnfolder]: For 1357/1534 co-relation queries the response was YES.
[2023-10-26 08:52:02,734 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9133 conditions, 4192 events. 1575/4192 cut-off events. For 1357/1534 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32502 event pairs, 572 based on Foata normal form. 0/3855 useless extension candidates. Maximal degree in co-relation 3935. Up to 1547 conditions per place. 
[2023-10-26 08:52:02,759 INFO  L137   encePairwiseOnDemand]: 211/215 looper letters, 38 selfloop transitions, 3 changer transitions 3/122 dead transitions.
[2023-10-26 08:52:02,759 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 568 flow
[2023-10-26 08:52:02,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:52:02,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:52:02,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions.
[2023-10-26 08:52:02,761 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6267441860465116
[2023-10-26 08:52:02,761 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 539 transitions.
[2023-10-26 08:52:02,761 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions.
[2023-10-26 08:52:02,761 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:02,761 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions.
[2023-10-26 08:52:02,762 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:02,775 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:02,775 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:02,776 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 539 transitions.
[2023-10-26 08:52:02,776 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 568 flow
[2023-10-26 08:52:02,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 122 transitions, 568 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:52:02,781 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2023-10-26 08:52:02,782 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2023-10-26 08:52:02,782 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2023-10-26 08:52:02,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2023-10-26 08:52:02,790 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:02,791 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:02,791 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:02,791 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-26 08:52:02,791 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:52:02,791 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:02,791 INFO  L85        PathProgramCache]: Analyzing trace with hash 33476867, now seen corresponding path program 1 times
[2023-10-26 08:52:02,792 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:02,792 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674054487]
[2023-10-26 08:52:02,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:02,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:02,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:02,976 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:02,976 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:02,977 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674054487]
[2023-10-26 08:52:02,997 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674054487] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:02,997 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:02,998 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:52:02,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207772397]
[2023-10-26 08:52:02,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:02,999 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:52:02,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:03,000 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:52:03,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:52:03,382 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 215
[2023-10-26 08:52:03,382 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 466 flow. Second operand  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:03,382 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:03,382 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 215
[2023-10-26 08:52:03,382 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:05,144 INFO  L130       PetriNetUnfolder]: 6417/12066 cut-off events.
[2023-10-26 08:52:05,144 INFO  L131       PetriNetUnfolder]: For 6131/6288 co-relation queries the response was YES.
[2023-10-26 08:52:05,178 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30858 conditions, 12066 events. 6417/12066 cut-off events. For 6131/6288 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 87978 event pairs, 1317 based on Foata normal form. 19/11724 useless extension candidates. Maximal degree in co-relation 30728. Up to 7055 conditions per place. 
[2023-10-26 08:52:05,282 INFO  L137   encePairwiseOnDemand]: 188/215 looper letters, 118 selfloop transitions, 104 changer transitions 1/254 dead transitions.
[2023-10-26 08:52:05,282 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 254 transitions, 1510 flow
[2023-10-26 08:52:05,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:52:05,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:52:05,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions.
[2023-10-26 08:52:05,284 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821705426356589
[2023-10-26 08:52:05,284 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 751 transitions.
[2023-10-26 08:52:05,284 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions.
[2023-10-26 08:52:05,284 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:05,284 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions.
[2023-10-26 08:52:05,295 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:05,297 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:05,297 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:05,297 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 751 transitions.
[2023-10-26 08:52:05,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 254 transitions, 1510 flow
[2023-10-26 08:52:05,327 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 254 transitions, 1507 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:52:05,329 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2023-10-26 08:52:05,329 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=95, PETRI_TRANSITIONS=215}
[2023-10-26 08:52:05,330 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2023-10-26 08:52:05,330 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2023-10-26 08:52:05,331 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:05,331 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:05,331 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]
[2023-10-26 08:52:05,331 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-26 08:52:05,331 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:52:05,332 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:05,332 INFO  L85        PathProgramCache]: Analyzing trace with hash 163438136, now seen corresponding path program 1 times
[2023-10-26 08:52:05,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:05,332 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971521294]
[2023-10-26 08:52:05,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:05,332 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:05,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:05,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:05,638 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:05,638 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971521294]
[2023-10-26 08:52:05,638 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971521294] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:05,638 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:05,638 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:52:05,638 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442882241]
[2023-10-26 08:52:05,638 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:05,639 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:52:05,639 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:05,639 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:52:05,640 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:52:05,804 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 215
[2023-10-26 08:52:05,804 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 215 transitions, 1492 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:05,804 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:05,804 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 215
[2023-10-26 08:52:05,805 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:08,424 INFO  L130       PetriNetUnfolder]: 11069/19135 cut-off events.
[2023-10-26 08:52:08,424 INFO  L131       PetriNetUnfolder]: For 23646/23867 co-relation queries the response was YES.
[2023-10-26 08:52:08,456 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64791 conditions, 19135 events. 11069/19135 cut-off events. For 23646/23867 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 135080 event pairs, 3510 based on Foata normal form. 0/18291 useless extension candidates. Maximal degree in co-relation 46355. Up to 15473 conditions per place. 
[2023-10-26 08:52:08,594 INFO  L137   encePairwiseOnDemand]: 181/215 looper letters, 246 selfloop transitions, 178 changer transitions 0/441 dead transitions.
[2023-10-26 08:52:08,594 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 441 transitions, 3416 flow
[2023-10-26 08:52:08,595 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:52:08,595 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:52:08,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions.
[2023-10-26 08:52:08,596 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6201550387596899
[2023-10-26 08:52:08,596 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 800 transitions.
[2023-10-26 08:52:08,596 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions.
[2023-10-26 08:52:08,598 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:08,598 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions.
[2023-10-26 08:52:08,599 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:08,600 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:08,613 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:08,614 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 800 transitions.
[2023-10-26 08:52:08,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 441 transitions, 3416 flow
[2023-10-26 08:52:08,665 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 441 transitions, 3406 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-10-26 08:52:08,677 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2023-10-26 08:52:08,693 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2975, PETRI_PLACES=102, PETRI_TRANSITIONS=377}
[2023-10-26 08:52:08,694 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2023-10-26 08:52:08,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2023-10-26 08:52:08,695 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:08,695 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:08,695 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:08,695 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-26 08:52:08,695 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:52:08,696 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:08,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -1795788423, now seen corresponding path program 1 times
[2023-10-26 08:52:08,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:08,696 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74645822]
[2023-10-26 08:52:08,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:08,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:08,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:09,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:09,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:09,177 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74645822]
[2023-10-26 08:52:09,177 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74645822] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:09,177 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043017952]
[2023-10-26 08:52:09,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:09,178 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:09,178 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:09,179 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-10-26 08:52:09,219 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-10-26 08:52:09,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:09,376 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-26 08:52:09,380 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:09,393 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 17 treesize of output 9
[2023-10-26 08:52:09,476 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-10-26 08:52:09,516 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:52:09,545 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:09,545 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32
[2023-10-26 08:52:09,596 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:09,597 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:52:09,663 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:09,664 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-10-26 08:52:09,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:09,671 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:09,805 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1098 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-26 08:52:09,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:09,953 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043017952] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:09,953 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:09,953 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23
[2023-10-26 08:52:09,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064133982]
[2023-10-26 08:52:09,953 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:09,953 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2023-10-26 08:52:09,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:09,953 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-10-26 08:52:09,954 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=451, Unknown=7, NotChecked=44, Total=600
[2023-10-26 08:52:09,988 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 215
[2023-10-26 08:52:09,989 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 25 states, 25 states have (on average 67.84) internal successors, (1696), 25 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:09,989 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:09,989 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 215
[2023-10-26 08:52:09,989 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:16,206 INFO  L130       PetriNetUnfolder]: 17059/27855 cut-off events.
[2023-10-26 08:52:16,206 INFO  L131       PetriNetUnfolder]: For 54148/54154 co-relation queries the response was YES.
[2023-10-26 08:52:16,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 113331 conditions, 27855 events. 17059/27855 cut-off events. For 54148/54154 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 194158 event pairs, 4731 based on Foata normal form. 6/25308 useless extension candidates. Maximal degree in co-relation 75608. Up to 19388 conditions per place. 
[2023-10-26 08:52:16,465 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 551 selfloop transitions, 440 changer transitions 1/995 dead transitions.
[2023-10-26 08:52:16,481 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 995 transitions, 9034 flow
[2023-10-26 08:52:16,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-26 08:52:16,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-26 08:52:16,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1684 transitions.
[2023-10-26 08:52:16,486 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.41223990208078337
[2023-10-26 08:52:16,486 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1684 transitions.
[2023-10-26 08:52:16,486 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1684 transitions.
[2023-10-26 08:52:16,486 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:16,486 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1684 transitions.
[2023-10-26 08:52:16,488 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 88.63157894736842) internal successors, (1684), 19 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:16,491 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 215.0) internal successors, (4300), 20 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:16,492 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 215.0) internal successors, (4300), 20 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:16,492 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 19 states and 1684 transitions.
[2023-10-26 08:52:16,492 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 995 transitions, 9034 flow
[2023-10-26 08:52:17,267 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 995 transitions, 8884 flow, removed 75 selfloop flow, removed 0 redundant places.
[2023-10-26 08:52:17,285 INFO  L231             Difference]: Finished difference. Result has 129 places, 727 transitions, 7651 flow
[2023-10-26 08:52:17,285 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7651, PETRI_PLACES=129, PETRI_TRANSITIONS=727}
[2023-10-26 08:52:17,286 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 58 predicate places.
[2023-10-26 08:52:17,286 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 727 transitions, 7651 flow
[2023-10-26 08:52:17,286 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 67.84) internal successors, (1696), 25 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:17,286 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:17,286 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:17,293 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-26 08:52:17,491 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,SelfDestructingSolverStorable15
[2023-10-26 08:52:17,491 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:52:17,491 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:17,492 INFO  L85        PathProgramCache]: Analyzing trace with hash 405194917, now seen corresponding path program 1 times
[2023-10-26 08:52:17,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:17,492 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204205590]
[2023-10-26 08:52:17,492 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:17,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:17,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:18,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:18,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:18,013 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204205590]
[2023-10-26 08:52:18,013 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204205590] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:18,013 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957743620]
[2023-10-26 08:52:18,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:18,014 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:18,014 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:18,030 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-10-26 08:52:18,064 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-10-26 08:52:18,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:18,219 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-26 08:52:18,221 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:18,239 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 17 treesize of output 9
[2023-10-26 08:52:18,356 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-10-26 08:52:18,406 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:18,406 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-10-26 08:52:18,446 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:18,447 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:18,448 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-10-26 08:52:18,488 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:18,513 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:18,514 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:18,515 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-10-26 08:52:18,558 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:18,559 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-10-26 08:52:18,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:18,587 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:18,624 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2023-10-26 08:52:18,743 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))))) is different from false
[2023-10-26 08:52:18,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:52:18,851 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957743620] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:18,851 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:18,851 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-10-26 08:52:18,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382385198]
[2023-10-26 08:52:18,852 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:18,852 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-26 08:52:18,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:18,852 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-26 08:52:18,852 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=489, Unknown=11, NotChecked=94, Total=702
[2023-10-26 08:52:18,930 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 215
[2023-10-26 08:52:18,932 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 727 transitions, 7651 flow. Second operand  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:18,932 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:18,932 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 215
[2023-10-26 08:52:18,932 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:25,807 INFO  L130       PetriNetUnfolder]: 19905/32868 cut-off events.
[2023-10-26 08:52:25,808 INFO  L131       PetriNetUnfolder]: For 121458/121466 co-relation queries the response was YES.
[2023-10-26 08:52:25,896 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 170450 conditions, 32868 events. 19905/32868 cut-off events. For 121458/121466 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 236537 event pairs, 3283 based on Foata normal form. 254/30257 useless extension candidates. Maximal degree in co-relation 149719. Up to 16549 conditions per place. 
[2023-10-26 08:52:26,080 INFO  L137   encePairwiseOnDemand]: 185/215 looper letters, 974 selfloop transitions, 520 changer transitions 0/1497 dead transitions.
[2023-10-26 08:52:26,080 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1497 transitions, 17648 flow
[2023-10-26 08:52:26,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-10-26 08:52:26,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-10-26 08:52:26,083 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions.
[2023-10-26 08:52:26,083 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.40174418604651163
[2023-10-26 08:52:26,084 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1382 transitions.
[2023-10-26 08:52:26,092 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1382 transitions.
[2023-10-26 08:52:26,093 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:26,093 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1382 transitions.
[2023-10-26 08:52:26,105 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 86.375) internal successors, (1382), 16 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:26,108 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 215.0) internal successors, (3655), 17 states have internal predecessors, (3655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:26,108 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 215.0) internal successors, (3655), 17 states have internal predecessors, (3655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:26,108 INFO  L175             Difference]: Start difference. First operand has 129 places, 727 transitions, 7651 flow. Second operand 16 states and 1382 transitions.
[2023-10-26 08:52:26,108 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 1497 transitions, 17648 flow
[2023-10-26 08:52:28,696 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 1497 transitions, 17381 flow, removed 132 selfloop flow, removed 1 redundant places.
[2023-10-26 08:52:28,712 INFO  L231             Difference]: Finished difference. Result has 150 places, 1033 transitions, 13043 flow
[2023-10-26 08:52:28,713 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=7541, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=13043, PETRI_PLACES=150, PETRI_TRANSITIONS=1033}
[2023-10-26 08:52:28,718 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 79 predicate places.
[2023-10-26 08:52:28,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 1033 transitions, 13043 flow
[2023-10-26 08:52:28,718 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:28,718 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:28,719 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]
[2023-10-26 08:52:28,725 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-10-26 08:52:28,923 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,SelfDestructingSolverStorable16
[2023-10-26 08:52:28,923 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:52:28,933 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:28,934 INFO  L85        PathProgramCache]: Analyzing trace with hash -1730679491, now seen corresponding path program 1 times
[2023-10-26 08:52:28,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:28,934 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242006434]
[2023-10-26 08:52:28,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:28,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:28,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:29,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:29,037 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:29,037 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242006434]
[2023-10-26 08:52:29,038 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242006434] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:29,038 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566012571]
[2023-10-26 08:52:29,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:29,038 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:29,038 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:29,054 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-10-26 08:52:29,089 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-10-26 08:52:29,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:29,253 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-26 08:52:29,257 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:29,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:29,300 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:29,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:29,352 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [566012571] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:29,352 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:29,352 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2023-10-26 08:52:29,353 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447338173]
[2023-10-26 08:52:29,353 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:29,353 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-10-26 08:52:29,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:29,353 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-10-26 08:52:29,353 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2023-10-26 08:52:29,462 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 215
[2023-10-26 08:52:29,462 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 1033 transitions, 13043 flow. Second operand  has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 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-10-26 08:52:29,463 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:29,463 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 215
[2023-10-26 08:52:29,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:31,031 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([571] L1018-7-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_211| v_threadThread2of2ForFork0_~t~0.base_29))) (and (= |v_threadThread2of2ForFork0_#res.base_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ v_threadThread2of2ForFork0_~t~0.offset_29 1))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 3 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#res.offset_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 2 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 v_threadThread2of2ForFork0_~t~0.offset_29))))  InVars {#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_28|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29}  OutVars{#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#res.offset=|v_threadThread2of2ForFork0_#res.offset_9|, threadThread2of2ForFork0_#t~nondet3=|v_threadThread2of2ForFork0_#t~nondet3_15|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29, threadThread2of2ForFork0_#res.base=|v_threadThread2of2ForFork0_#res.base_9|}  AuxVars[]  AssignedVars[threadThread2of2ForFork0_#res.offset, threadThread2of2ForFork0_#t~nondet4, threadThread2of2ForFork0_#t~nondet3, threadThread2of2ForFork0_#res.base][272], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 60#L1029-5true, Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 47#threadEXITtrue, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), 756#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 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|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(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)), 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|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), 5#threadEXITtrue, Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-10-26 08:52:31,034 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-10-26 08:52:31,034 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-26 08:52:31,034 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-26 08:52:31,034 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-26 08:52:31,236 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([571] L1018-7-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_211| v_threadThread2of2ForFork0_~t~0.base_29))) (and (= |v_threadThread2of2ForFork0_#res.base_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ v_threadThread2of2ForFork0_~t~0.offset_29 1))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 3 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#res.offset_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 2 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 v_threadThread2of2ForFork0_~t~0.offset_29))))  InVars {#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_28|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29}  OutVars{#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#res.offset=|v_threadThread2of2ForFork0_#res.offset_9|, threadThread2of2ForFork0_#t~nondet3=|v_threadThread2of2ForFork0_#t~nondet3_15|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29, threadThread2of2ForFork0_#res.base=|v_threadThread2of2ForFork0_#res.base_9|}  AuxVars[]  AssignedVars[threadThread2of2ForFork0_#res.offset, threadThread2of2ForFork0_#t~nondet4, threadThread2of2ForFork0_#t~nondet3, threadThread2of2ForFork0_#res.base][272], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 47#threadEXITtrue, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), 756#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 71#L1030-1true, 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|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(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)), 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|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), 5#threadEXITtrue, Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-10-26 08:52:31,240 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-10-26 08:52:31,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-26 08:52:31,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-26 08:52:31,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-26 08:52:31,460 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L1018-2-->L1018-4: Formula: (= (store |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19 (store (select |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19) v_threadThread2of2ForFork0_~t~0.offset_19 |v_threadThread2of2ForFork0_#t~nondet4_19|)) |v_#race_191|)  InVars {#race=|v_#race_192|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  OutVars{#race=|v_#race_191|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_19|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][227], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 114#L1018-4true, Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 102#L1018-7true, 91#L1027-11true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 754#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 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|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(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)), 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|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-10-26 08:52:31,461 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-10-26 08:52:31,461 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-10-26 08:52:31,461 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-10-26 08:52:31,461 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-10-26 08:52:31,609 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L1018-2-->L1018-4: Formula: (= (store |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19 (store (select |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19) v_threadThread2of2ForFork0_~t~0.offset_19 |v_threadThread2of2ForFork0_#t~nondet4_19|)) |v_#race_191|)  InVars {#race=|v_#race_192|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  OutVars{#race=|v_#race_191|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_19|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][227], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 114#L1018-4true, Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 102#L1018-7true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 754#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 21#L1027-12true, 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 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|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(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)), 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|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-10-26 08:52:31,610 INFO  L383   tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event
[2023-10-26 08:52:31,610 INFO  L386   tUnfolder$Statistics]:   existing Event has 50 ancestors and is cut-off event
[2023-10-26 08:52:31,610 INFO  L386   tUnfolder$Statistics]:   existing Event has 50 ancestors and is cut-off event
[2023-10-26 08:52:31,610 INFO  L386   tUnfolder$Statistics]:   existing Event has 50 ancestors and is cut-off event
[2023-10-26 08:52:32,993 INFO  L130       PetriNetUnfolder]: 8983/17386 cut-off events.
[2023-10-26 08:52:32,993 INFO  L131       PetriNetUnfolder]: For 96850/101238 co-relation queries the response was YES.
[2023-10-26 08:52:33,059 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88452 conditions, 17386 events. 8983/17386 cut-off events. For 96850/101238 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 139766 event pairs, 1459 based on Foata normal form. 804/17245 useless extension candidates. Maximal degree in co-relation 81369. Up to 6267 conditions per place. 
[2023-10-26 08:52:33,130 INFO  L137   encePairwiseOnDemand]: 209/215 looper letters, 199 selfloop transitions, 9 changer transitions 18/947 dead transitions.
[2023-10-26 08:52:33,131 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 947 transitions, 12139 flow
[2023-10-26 08:52:33,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:52:33,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:52:33,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 772 transitions.
[2023-10-26 08:52:33,132 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5984496124031008
[2023-10-26 08:52:33,133 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 772 transitions.
[2023-10-26 08:52:33,133 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 772 transitions.
[2023-10-26 08:52:33,133 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:33,133 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 772 transitions.
[2023-10-26 08:52:33,134 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 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-10-26 08:52:33,135 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:33,136 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:33,136 INFO  L175             Difference]: Start difference. First operand has 150 places, 1033 transitions, 13043 flow. Second operand 6 states and 772 transitions.
[2023-10-26 08:52:33,136 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 947 transitions, 12139 flow
[2023-10-26 08:52:34,241 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 947 transitions, 11957 flow, removed 72 selfloop flow, removed 5 redundant places.
[2023-10-26 08:52:34,255 INFO  L231             Difference]: Finished difference. Result has 152 places, 881 transitions, 10765 flow
[2023-10-26 08:52:34,255 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=10904, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10765, PETRI_PLACES=152, PETRI_TRANSITIONS=881}
[2023-10-26 08:52:34,270 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 81 predicate places.
[2023-10-26 08:52:34,270 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 881 transitions, 10765 flow
[2023-10-26 08:52:34,270 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 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-10-26 08:52:34,270 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:34,270 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]
[2023-10-26 08:52:34,279 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-10-26 08:52:34,475 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-26 08:52:34,476 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:52:34,476 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:34,477 INFO  L85        PathProgramCache]: Analyzing trace with hash 84688353, now seen corresponding path program 1 times
[2023-10-26 08:52:34,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:34,477 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575333531]
[2023-10-26 08:52:34,477 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:34,477 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:34,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:34,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:34,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:34,964 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575333531]
[2023-10-26 08:52:34,964 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575333531] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:34,964 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381263974]
[2023-10-26 08:52:34,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:34,964 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:34,965 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:34,965 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:52:35,006 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-10-26 08:52:35,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:35,137 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-26 08:52:35,140 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:35,152 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 17 treesize of output 9
[2023-10-26 08:52:35,239 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-10-26 08:52:35,268 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:52:35,322 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:35,322 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32
[2023-10-26 08:52:35,360 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:35,360 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:52:35,435 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:35,436 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-10-26 08:52:35,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:35,443 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:35,476 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2023-10-26 08:52:35,507 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2023-10-26 08:52:35,536 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:52:35,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:52:35,658 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381263974] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:35,658 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:35,658 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-26 08:52:35,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486464764]
[2023-10-26 08:52:35,658 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:35,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:52:35,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:35,658 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:52:35,659 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-26 08:52:35,853 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 215
[2023-10-26 08:52:35,854 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 881 transitions, 10765 flow. Second operand  has 26 states, 26 states have (on average 64.8076923076923) internal successors, (1685), 26 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:35,854 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:35,854 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 215
[2023-10-26 08:52:35,855 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:44,977 INFO  L130       PetriNetUnfolder]: 17230/28784 cut-off events.
[2023-10-26 08:52:44,978 INFO  L131       PetriNetUnfolder]: For 145653/145659 co-relation queries the response was YES.
[2023-10-26 08:52:45,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 162156 conditions, 28784 events. 17230/28784 cut-off events. For 145653/145659 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 205325 event pairs, 3822 based on Foata normal form. 6/26614 useless extension candidates. Maximal degree in co-relation 155020. Up to 19262 conditions per place. 
[2023-10-26 08:52:45,218 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 874 selfloop transitions, 671 changer transitions 8/1556 dead transitions.
[2023-10-26 08:52:45,218 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1556 transitions, 19935 flow
[2023-10-26 08:52:45,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-26 08:52:45,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-26 08:52:45,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1659 transitions.
[2023-10-26 08:52:45,221 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.40611995104039167
[2023-10-26 08:52:45,221 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1659 transitions.
[2023-10-26 08:52:45,221 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1659 transitions.
[2023-10-26 08:52:45,222 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:45,222 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1659 transitions.
[2023-10-26 08:52:45,233 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 87.3157894736842) internal successors, (1659), 19 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:45,236 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 215.0) internal successors, (4300), 20 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:45,237 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 215.0) internal successors, (4300), 20 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:45,237 INFO  L175             Difference]: Start difference. First operand has 152 places, 881 transitions, 10765 flow. Second operand 19 states and 1659 transitions.
[2023-10-26 08:52:45,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1556 transitions, 19935 flow
[2023-10-26 08:52:47,192 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1556 transitions, 19503 flow, removed 6 selfloop flow, removed 5 redundant places.
[2023-10-26 08:52:47,215 INFO  L231             Difference]: Finished difference. Result has 170 places, 1268 transitions, 17043 flow
[2023-10-26 08:52:47,216 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=10362, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=17043, PETRI_PLACES=170, PETRI_TRANSITIONS=1268}
[2023-10-26 08:52:47,223 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 99 predicate places.
[2023-10-26 08:52:47,223 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 1268 transitions, 17043 flow
[2023-10-26 08:52:47,223 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.8076923076923) internal successors, (1685), 26 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:47,224 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:47,224 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]
[2023-10-26 08:52:47,231 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2023-10-26 08:52:47,428 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:47,429 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:52:47,432 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:47,432 INFO  L85        PathProgramCache]: Analyzing trace with hash 1752528282, now seen corresponding path program 1 times
[2023-10-26 08:52:47,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:47,437 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672900161]
[2023-10-26 08:52:47,437 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:47,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:47,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:47,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:47,878 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:47,878 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672900161]
[2023-10-26 08:52:47,878 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672900161] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:47,878 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210638298]
[2023-10-26 08:52:47,878 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:47,878 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:47,879 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:47,894 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:52:47,929 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-10-26 08:52:48,112 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:48,113 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-26 08:52:48,117 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:48,134 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 17 treesize of output 9
[2023-10-26 08:52:48,279 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-10-26 08:52:48,317 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,318 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-10-26 08:52:48,360 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,361 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,362 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-10-26 08:52:48,414 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,415 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,416 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,418 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-10-26 08:52:48,473 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,474 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-10-26 08:52:48,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:48,516 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:48,839 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_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2023-10-26 08:52:48,863 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse3 (+ 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 (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))) is different from false
[2023-10-26 08:52:48,875 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:48,876 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-10-26 08:52:48,884 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:48,884 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-10-26 08:52:48,887 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-10-26 08:52:48,892 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:52:48,892 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-10-26 08:52:48,903 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:52:48,904 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-10-26 08:52:48,914 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:52:48,914 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-10-26 08:52:49,009 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:49,009 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [210638298] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:49,009 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:49,009 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26
[2023-10-26 08:52:49,009 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918356025]
[2023-10-26 08:52:49,009 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:49,009 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-10-26 08:52:49,009 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:49,010 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-10-26 08:52:49,010 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=525, Unknown=22, NotChecked=98, Total=756
[2023-10-26 08:52:49,234 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 215
[2023-10-26 08:52:49,235 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 1268 transitions, 17043 flow. Second operand  has 28 states, 28 states have (on average 66.60714285714286) internal successors, (1865), 28 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:49,235 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:49,235 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 215
[2023-10-26 08:52:49,235 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:59,287 INFO  L130       PetriNetUnfolder]: 20037/33573 cut-off events.
[2023-10-26 08:52:59,289 INFO  L131       PetriNetUnfolder]: For 242114/242124 co-relation queries the response was YES.
[2023-10-26 08:52:59,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 231238 conditions, 33573 events. 20037/33573 cut-off events. For 242114/242124 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 247554 event pairs, 2351 based on Foata normal form. 408/32242 useless extension candidates. Maximal degree in co-relation 195838. Up to 14770 conditions per place. 
[2023-10-26 08:52:59,660 INFO  L137   encePairwiseOnDemand]: 178/215 looper letters, 1396 selfloop transitions, 812 changer transitions 2/2213 dead transitions.
[2023-10-26 08:52:59,661 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 2213 transitions, 33212 flow
[2023-10-26 08:52:59,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-10-26 08:52:59,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-10-26 08:52:59,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1327 transitions.
[2023-10-26 08:52:59,677 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38575581395348835
[2023-10-26 08:52:59,678 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1327 transitions.
[2023-10-26 08:52:59,678 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1327 transitions.
[2023-10-26 08:52:59,678 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:59,680 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1327 transitions.
[2023-10-26 08:52:59,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 82.9375) internal successors, (1327), 16 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:59,690 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 215.0) internal successors, (3655), 17 states have internal predecessors, (3655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:59,690 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 215.0) internal successors, (3655), 17 states have internal predecessors, (3655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:59,691 INFO  L175             Difference]: Start difference. First operand has 170 places, 1268 transitions, 17043 flow. Second operand 16 states and 1327 transitions.
[2023-10-26 08:52:59,691 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 2213 transitions, 33212 flow
[2023-10-26 08:53:07,384 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 2213 transitions, 32536 flow, removed 316 selfloop flow, removed 9 redundant places.
[2023-10-26 08:53:07,414 INFO  L231             Difference]: Finished difference. Result has 184 places, 1755 transitions, 27082 flow
[2023-10-26 08:53:07,415 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=16793, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=27082, PETRI_PLACES=184, PETRI_TRANSITIONS=1755}
[2023-10-26 08:53:07,416 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 113 predicate places.
[2023-10-26 08:53:07,416 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 1755 transitions, 27082 flow
[2023-10-26 08:53:07,416 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 66.60714285714286) internal successors, (1865), 28 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:07,416 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:53:07,416 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, 1, 1]
[2023-10-26 08:53:07,427 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2023-10-26 08:53:07,625 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:53:07,626 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:53:07,627 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:53:07,628 INFO  L85        PathProgramCache]: Analyzing trace with hash -1139698224, now seen corresponding path program 1 times
[2023-10-26 08:53:07,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:53:07,629 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688313178]
[2023-10-26 08:53:07,630 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:07,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:53:07,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:07,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:53:07,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:53:07,977 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688313178]
[2023-10-26 08:53:07,977 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688313178] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:53:07,978 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:53:07,978 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:53:07,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543542671]
[2023-10-26 08:53:07,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:53:07,978 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:53:07,978 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:53:07,979 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:53:07,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:53:08,389 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 215
[2023-10-26 08:53:08,389 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 1755 transitions, 27082 flow. Second operand  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:08,389 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:53:08,389 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 215
[2023-10-26 08:53:08,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:53:17,400 INFO  L130       PetriNetUnfolder]: 17500/30900 cut-off events.
[2023-10-26 08:53:17,401 INFO  L131       PetriNetUnfolder]: For 332725/340692 co-relation queries the response was YES.
[2023-10-26 08:53:17,632 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 223929 conditions, 30900 events. 17500/30900 cut-off events. For 332725/340692 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 244192 event pairs, 3013 based on Foata normal form. 866/30828 useless extension candidates. Maximal degree in co-relation 184179. Up to 19203 conditions per place. 
[2023-10-26 08:53:17,828 INFO  L137   encePairwiseOnDemand]: 200/215 looper letters, 1313 selfloop transitions, 176 changer transitions 1/1942 dead transitions.
[2023-10-26 08:53:17,828 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1942 transitions, 33000 flow
[2023-10-26 08:53:17,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:53:17,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:53:17,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-10-26 08:53:17,837 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5961240310077519
[2023-10-26 08:53:17,837 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-10-26 08:53:17,837 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-10-26 08:53:17,837 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:53:17,838 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-10-26 08:53:17,838 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 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-10-26 08:53:17,839 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:17,840 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:17,840 INFO  L175             Difference]: Start difference. First operand has 184 places, 1755 transitions, 27082 flow. Second operand 6 states and 769 transitions.
[2023-10-26 08:53:17,840 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1942 transitions, 33000 flow
[2023-10-26 08:53:23,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 1942 transitions, 32655 flow, removed 155 selfloop flow, removed 6 redundant places.
[2023-10-26 08:53:23,994 INFO  L231             Difference]: Finished difference. Result has 188 places, 1914 transitions, 30208 flow
[2023-10-26 08:53:23,996 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=26761, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=30208, PETRI_PLACES=188, PETRI_TRANSITIONS=1914}
[2023-10-26 08:53:23,996 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 117 predicate places.
[2023-10-26 08:53:23,996 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 1914 transitions, 30208 flow
[2023-10-26 08:53:23,997 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:23,997 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:53:23,997 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:53:23,997 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-10-26 08:53:23,997 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:53:23,997 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:53:23,998 INFO  L85        PathProgramCache]: Analyzing trace with hash 370424642, now seen corresponding path program 2 times
[2023-10-26 08:53:23,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:53:23,998 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567360206]
[2023-10-26 08:53:23,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:23,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:53:24,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:24,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:53:24,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:53:24,803 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567360206]
[2023-10-26 08:53:24,803 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567360206] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:53:24,803 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317076826]
[2023-10-26 08:53:24,803 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:53:24,803 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:53:24,803 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:53:24,805 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:53:24,863 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-10-26 08:53:25,009 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:53:25,010 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:53:25,011 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-10-26 08:53:25,013 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:53:25,056 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 15 treesize of output 7
[2023-10-26 08:53:25,062 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 26 treesize of output 14
[2023-10-26 08:53:25,212 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-10-26 08:53:25,240 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,242 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-10-26 08:53:25,308 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,309 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,310 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-10-26 08:53:25,355 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,356 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,356 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,359 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-10-26 08:53:25,432 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,433 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-10-26 08:53:25,451 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,452 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-10-26 08:53:25,475 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,476 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-10-26 08:53:25,498 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,499 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-10-26 08:53:25,572 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:25,574 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-10-26 08:53:25,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:53:25,602 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:53:25,623 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1726 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-10-26 08:53:25,665 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:53:25,740 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:53:25,774 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-10-26 08:53:25,833 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:53:25,848 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:25,849 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 38 treesize of output 54
[2023-10-26 08:53:25,866 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:25,867 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 204 treesize of output 130
[2023-10-26 08:53:25,871 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 102 treesize of output 86
[2023-10-26 08:53:25,873 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 86 treesize of output 78
[2023-10-26 08:53:25,911 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:53:25,911 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 36 treesize of output 1
[2023-10-26 08:53:25,915 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:53:25,915 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 38 treesize of output 1
[2023-10-26 08:53:25,920 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:53:25,920 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 38 treesize of output 1
[2023-10-26 08:53:25,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2023-10-26 08:53:25,971 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [317076826] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:53:25,971 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:53:25,972 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26
[2023-10-26 08:53:25,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871779948]
[2023-10-26 08:53:25,972 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:53:25,972 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-10-26 08:53:25,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:53:25,973 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-10-26 08:53:25,973 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=417, Unknown=5, NotChecked=230, Total=756
[2023-10-26 08:53:26,177 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 215
[2023-10-26 08:53:26,178 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1914 transitions, 30208 flow. Second operand  has 28 states, 28 states have (on average 60.17857142857143) internal successors, (1685), 28 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:26,178 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:53:26,178 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 215
[2023-10-26 08:53:26,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:53:44,580 INFO  L130       PetriNetUnfolder]: 21616/36166 cut-off events.
[2023-10-26 08:53:44,581 INFO  L131       PetriNetUnfolder]: For 381904/381919 co-relation queries the response was YES.
[2023-10-26 08:53:44,821 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 282319 conditions, 36166 events. 21616/36166 cut-off events. For 381904/381919 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 269577 event pairs, 2431 based on Foata normal form. 404/34964 useless extension candidates. Maximal degree in co-relation 243035. Up to 20201 conditions per place. 
[2023-10-26 08:53:44,984 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 1198 selfloop transitions, 1545 changer transitions 46/2793 dead transitions.
[2023-10-26 08:53:44,984 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 2793 transitions, 47112 flow
[2023-10-26 08:53:44,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-10-26 08:53:44,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-10-26 08:53:44,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1632 transitions.
[2023-10-26 08:53:44,987 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37953488372093025
[2023-10-26 08:53:44,987 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1632 transitions.
[2023-10-26 08:53:44,987 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1632 transitions.
[2023-10-26 08:53:44,988 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:53:44,988 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1632 transitions.
[2023-10-26 08:53:44,990 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 81.6) internal successors, (1632), 20 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:44,992 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 215.0) internal successors, (4515), 21 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:44,992 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 215.0) internal successors, (4515), 21 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:44,993 INFO  L175             Difference]: Start difference. First operand has 188 places, 1914 transitions, 30208 flow. Second operand 20 states and 1632 transitions.
[2023-10-26 08:53:44,993 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 2793 transitions, 47112 flow
[2023-10-26 08:53:55,244 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 2793 transitions, 46872 flow, removed 120 selfloop flow, removed 0 redundant places.
[2023-10-26 08:53:55,314 INFO  L231             Difference]: Finished difference. Result has 214 places, 2271 transitions, 41225 flow
[2023-10-26 08:53:55,315 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=29974, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=41225, PETRI_PLACES=214, PETRI_TRANSITIONS=2271}
[2023-10-26 08:53:55,315 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 143 predicate places.
[2023-10-26 08:53:55,316 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 2271 transitions, 41225 flow
[2023-10-26 08:53:55,316 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 60.17857142857143) internal successors, (1685), 28 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:55,316 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:53:55,316 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, 1, 1, 1, 1]
[2023-10-26 08:53:55,328 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2023-10-26 08:53:55,526 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2023-10-26 08:53:55,526 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:53:55,527 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:53:55,527 INFO  L85        PathProgramCache]: Analyzing trace with hash -614487279, now seen corresponding path program 1 times
[2023-10-26 08:53:55,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:53:55,528 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426457065]
[2023-10-26 08:53:55,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:55,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:53:55,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:56,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:53:56,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:53:56,704 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426457065]
[2023-10-26 08:53:56,704 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426457065] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:53:56,704 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779541341]
[2023-10-26 08:53:56,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:56,704 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:53:56,705 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:53:56,708 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:53:56,737 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2023-10-26 08:53:56,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:56,877 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core
[2023-10-26 08:53:56,882 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:53:56,919 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:56,920 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:56,922 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:56,926 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-10-26 08:53:56,927 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 31 treesize of output 19
[2023-10-26 08:53:57,349 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-26 08:53:57,349 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 62
[2023-10-26 08:53:57,511 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-10-26 08:53:57,512 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 40
[2023-10-26 08:53:57,591 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 11 treesize of output 7
[2023-10-26 08:53:57,637 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-10-26 08:53:57,694 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:57,694 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 30 treesize of output 32
[2023-10-26 08:53:57,749 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:57,750 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 39 treesize of output 44
[2023-10-26 08:53:57,821 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-10-26 08:53:57,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:53:57,829 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:53:57,847 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:53:58,051 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-10-26 08:53:58,091 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-10-26 08:53:58,116 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:58,116 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 33 treesize of output 49
[2023-10-26 08:53:58,121 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:58,121 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 80 treesize of output 30
[2023-10-26 08:53:58,129 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:53:58,129 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-10-26 08:53:58,142 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:53:58,142 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-10-26 08:53:58,147 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:53:58,147 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-10-26 08:53:58,280 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1853) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2023-10-26 08:53:58,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:53:58,343 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [779541341] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:53:58,343 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:53:58,343 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33
[2023-10-26 08:53:58,343 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258884418]
[2023-10-26 08:53:58,343 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:53:58,343 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2023-10-26 08:53:58,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:53:58,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2023-10-26 08:53:58,344 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=801, Unknown=13, NotChecked=244, Total=1190
[2023-10-26 08:53:58,538 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 215
[2023-10-26 08:53:58,539 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 2271 transitions, 41225 flow. Second operand  has 35 states, 35 states have (on average 47.51428571428571) internal successors, (1663), 35 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:58,539 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:53:58,539 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 215
[2023-10-26 08:53:58,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:54:38,943 INFO  L130       PetriNetUnfolder]: 48391/80337 cut-off events.
[2023-10-26 08:54:38,944 INFO  L131       PetriNetUnfolder]: For 1226289/1226289 co-relation queries the response was YES.
[2023-10-26 08:54:39,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 715788 conditions, 80337 events. 48391/80337 cut-off events. For 1226289/1226289 co-relation queries the response was YES. Maximal size of possible extension queue 2100. Compared 661070 event pairs, 7467 based on Foata normal form. 235/77059 useless extension candidates. Maximal degree in co-relation 670912. Up to 35860 conditions per place. 
[2023-10-26 08:54:40,201 INFO  L137   encePairwiseOnDemand]: 179/215 looper letters, 5603 selfloop transitions, 709 changer transitions 31/6344 dead transitions.
[2023-10-26 08:54:40,201 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 6344 transitions, 122822 flow
[2023-10-26 08:54:40,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2023-10-26 08:54:40,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2023-10-26 08:54:40,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2212 transitions.
[2023-10-26 08:54:40,226 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.28578811369509044
[2023-10-26 08:54:40,226 INFO  L72            ComplementDD]: Start complementDD. Operand 36 states and 2212 transitions.
[2023-10-26 08:54:40,226 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 36 states and 2212 transitions.
[2023-10-26 08:54:40,227 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:54:40,228 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2212 transitions.
[2023-10-26 08:54:40,233 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 37 states, 36 states have (on average 61.44444444444444) internal successors, (2212), 36 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:40,241 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 37 states, 37 states have (on average 215.0) internal successors, (7955), 37 states have internal predecessors, (7955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:40,244 INFO  L81            ComplementDD]: Finished complementDD. Result  has 37 states, 37 states have (on average 215.0) internal successors, (7955), 37 states have internal predecessors, (7955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:40,244 INFO  L175             Difference]: Start difference. First operand has 214 places, 2271 transitions, 41225 flow. Second operand 36 states and 2212 transitions.
[2023-10-26 08:54:40,244 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 6344 transitions, 122822 flow
[2023-10-26 08:55:41,267 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 6344 transitions, 122026 flow, removed 351 selfloop flow, removed 12 redundant places.
[2023-10-26 08:55:41,358 INFO  L231             Difference]: Finished difference. Result has 258 places, 2968 transitions, 57139 flow
[2023-10-26 08:55:41,360 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=40843, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=57139, PETRI_PLACES=258, PETRI_TRANSITIONS=2968}
[2023-10-26 08:55:41,360 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 187 predicate places.
[2023-10-26 08:55:41,360 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 2968 transitions, 57139 flow
[2023-10-26 08:55:41,361 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 47.51428571428571) internal successors, (1663), 35 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:41,361 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:41,361 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, 1, 1, 1, 1]
[2023-10-26 08:55:41,367 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2023-10-26 08:55:41,565 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2023-10-26 08:55:41,566 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:55:41,567 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:41,567 INFO  L85        PathProgramCache]: Analyzing trace with hash 564881149, now seen corresponding path program 2 times
[2023-10-26 08:55:41,567 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:41,568 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132352103]
[2023-10-26 08:55:41,568 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:41,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:41,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:42,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:55:42,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:42,416 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132352103]
[2023-10-26 08:55:42,416 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132352103] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:55:42,416 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039512775]
[2023-10-26 08:55:42,416 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:55:42,416 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:55:42,416 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:55:42,417 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:55:42,448 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2023-10-26 08:55:42,607 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:55:42,608 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:55:42,609 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 77 conjunts are in the unsatisfiable core
[2023-10-26 08:55:42,612 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:55:42,646 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:42,648 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:42,654 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-10-26 08:55:42,654 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 39 treesize of output 27
[2023-10-26 08:55:43,292 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-26 08:55:43,292 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 66
[2023-10-26 08:55:43,299 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:43,310 INFO  L321             Elim1Store]: treesize reduction 15, result has 46.4 percent of original size
[2023-10-26 08:55:43,310 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 1 case distinctions, treesize of input 32 treesize of output 43
[2023-10-26 08:55:43,318 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 11 treesize of output 7
[2023-10-26 08:55:43,334 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 30 treesize of output 22
[2023-10-26 08:55:43,732 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-26 08:55:43,732 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 85
[2023-10-26 08:55:43,763 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-26 08:55:43,763 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 84
[2023-10-26 08:55:43,785 WARN  L207             Elim1Store]: Array PQE input equivalent to false
[2023-10-26 08:55:43,977 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-10-26 08:55:44,144 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:55:44,367 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:44,368 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 87 treesize of output 63
[2023-10-26 08:55:44,380 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:44,380 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 62 treesize of output 54
[2023-10-26 08:55:44,516 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,516 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,517 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 30 treesize of output 32
[2023-10-26 08:55:44,586 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,587 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 32 treesize of output 30
[2023-10-26 08:55:44,617 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,618 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,619 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,620 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 39 treesize of output 44
[2023-10-26 08:55:44,693 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,693 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 41 treesize of output 37
[2023-10-26 08:55:44,713 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,714 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 41 treesize of output 37
[2023-10-26 08:55:44,742 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,743 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 41 treesize of output 37
[2023-10-26 08:55:44,858 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,859 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,860 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:44,861 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-10-26 08:55:44,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:55:44,902 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:55:45,130 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2023-10-26 08:55:47,064 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select .cse7 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-10-26 08:55:47,088 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse5))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse6 (store (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select .cse7 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse8 (store (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (let ((.cse11 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse11 c_threadThread1of2ForFork0_~t~0.base (store (select .cse11 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse10 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse10 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-26 08:55:47,119 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse0 (store (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse6 (store (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select .cse7 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse8 (store (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse10) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse11 (store (let ((.cse12 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse12 c_threadThread1of2ForFork0_~t~0.base (store (select .cse12 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse11 .cse1 (store (select .cse11 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:55:47,466 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse11 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse11 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse6))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse8 c_threadThread1of2ForFork0_~t~0.base (store (select .cse8 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (let ((.cse10 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse10 c_threadThread1of2ForFork0_~t~0.base (store (select .cse10 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse11))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse12 (store (let ((.cse13 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse13 c_threadThread1of2ForFork0_~t~0.base (store (select .cse13 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse12 .cse1 (store (select .cse12 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-10-26 08:55:47,535 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:47,535 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 3 case distinctions, treesize of input 139 treesize of output 96
[2023-10-26 08:55:47,569 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:47,569 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3880 treesize of output 3572
[2023-10-26 08:55:47,648 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 3998 treesize of output 3782
[2023-10-26 08:55:47,689 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 4149 treesize of output 3997
[2023-10-26 08:55:53,858 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9
[2023-10-26 08:55:53,871 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:53,872 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-10-26 08:55:53,875 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-26 08:55:53,893 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-26 08:55:53,893 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 2266 treesize of output 2014
[2023-10-26 08:55:53,910 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 2310 treesize of output 2246
[2023-10-26 08:55:53,926 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 1189 treesize of output 1173
[2023-10-26 08:55:53,938 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 2514 treesize of output 2134
[2023-10-26 08:55:54,173 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:54,173 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-10-26 08:55:54,176 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-26 08:55:54,187 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-26 08:55:54,201 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 1900 treesize of output 1776
[2023-10-26 08:55:54,248 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 942 treesize of output 910
[2023-10-26 08:55:54,256 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 932 treesize of output 822
[2023-10-26 08:55:54,447 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:54,461 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 94
[2023-10-26 08:55:54,464 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-26 08:55:54,479 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-26 08:55:54,479 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 580 treesize of output 514
[2023-10-26 08:55:54,488 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 261 treesize of output 259
[2023-10-26 08:55:54,510 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 562 treesize of output 446
[2023-10-26 08:55:54,519 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 354 treesize of output 346
[2023-10-26 08:56:06,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:56:06,250 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039512775] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:56:06,250 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:56:06,250 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 42
[2023-10-26 08:56:06,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262659106]
[2023-10-26 08:56:06,250 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:56:06,251 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2023-10-26 08:56:06,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:56:06,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2023-10-26 08:56:06,251 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1292, Unknown=28, NotChecked=390, Total=1892
[2023-10-26 08:56:06,617 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 215
[2023-10-26 08:56:06,618 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 2968 transitions, 57139 flow. Second operand  has 44 states, 44 states have (on average 51.15909090909091) internal successors, (2251), 44 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:56:06,618 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:56:06,618 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 215
[2023-10-26 08:56:06,618 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:11,461 INFO  L130       PetriNetUnfolder]: 48732/81070 cut-off events.
[2023-10-26 08:57:11,461 INFO  L131       PetriNetUnfolder]: For 1718028/1718028 co-relation queries the response was YES.
[2023-10-26 08:57:12,331 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 802352 conditions, 81070 events. 48732/81070 cut-off events. For 1718028/1718028 co-relation queries the response was YES. Maximal size of possible extension queue 2083. Compared 667843 event pairs, 10215 based on Foata normal form. 48/77605 useless extension candidates. Maximal degree in co-relation 772700. Up to 77105 conditions per place. 
[2023-10-26 08:57:12,785 INFO  L137   encePairwiseOnDemand]: 191/215 looper letters, 3438 selfloop transitions, 170 changer transitions 128/3737 dead transitions.
[2023-10-26 08:57:12,786 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 3737 transitions, 76564 flow
[2023-10-26 08:57:12,787 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-26 08:57:12,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-26 08:57:12,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1346 transitions.
[2023-10-26 08:57:12,788 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2981173864894795
[2023-10-26 08:57:12,788 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1346 transitions.
[2023-10-26 08:57:12,788 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1346 transitions.
[2023-10-26 08:57:12,789 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:12,789 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1346 transitions.
[2023-10-26 08:57:12,790 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 64.0952380952381) internal successors, (1346), 21 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:12,797 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 215.0) internal successors, (4730), 22 states have internal predecessors, (4730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:12,797 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 215.0) internal successors, (4730), 22 states have internal predecessors, (4730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:12,798 INFO  L175             Difference]: Start difference. First operand has 258 places, 2968 transitions, 57139 flow. Second operand 21 states and 1346 transitions.
[2023-10-26 08:57:12,798 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 3737 transitions, 76564 flow
[2023-10-26 08:58:17,832 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 3737 transitions, 75368 flow, removed 596 selfloop flow, removed 2 redundant places.
[2023-10-26 08:58:17,884 INFO  L231             Difference]: Finished difference. Result has 287 places, 3124 transitions, 60028 flow
[2023-10-26 08:58:17,886 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=56187, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2827, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=60028, PETRI_PLACES=287, PETRI_TRANSITIONS=3124}
[2023-10-26 08:58:17,900 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 216 predicate places.
[2023-10-26 08:58:17,901 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 3124 transitions, 60028 flow
[2023-10-26 08:58:17,901 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 44 states, 44 states have (on average 51.15909090909091) internal successors, (2251), 44 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:17,901 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:17,901 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, 1, 1, 1, 1]
[2023-10-26 08:58:17,914 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2023-10-26 08:58:18,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:58:18,106 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:58:18,107 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:18,107 INFO  L85        PathProgramCache]: Analyzing trace with hash 1792801883, now seen corresponding path program 3 times
[2023-10-26 08:58:18,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:18,108 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453603948]
[2023-10-26 08:58:18,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:18,109 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:18,140 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:18,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:58:18,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:18,983 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453603948]
[2023-10-26 08:58:18,984 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453603948] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:58:18,984 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838563336]
[2023-10-26 08:58:18,984 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-26 08:58:18,984 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:58:18,984 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:58:18,986 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:58:19,013 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2023-10-26 08:58:19,251 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-26 08:58:19,251 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:58:19,257 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 64 conjunts are in the unsatisfiable core
[2023-10-26 08:58:19,260 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:58:19,282 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:19,285 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:19,290 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-10-26 08:58:19,291 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 56 treesize of output 44
[2023-10-26 08:58:19,890 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-26 08:58:19,890 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 66
[2023-10-26 08:58:19,913 INFO  L321             Elim1Store]: treesize reduction 23, result has 36.1 percent of original size
[2023-10-26 08:58:19,914 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 43
[2023-10-26 08:58:19,949 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 11 treesize of output 7
[2023-10-26 08:58:19,965 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 30 treesize of output 22
[2023-10-26 08:58:20,422 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-26 08:58:20,422 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 85
[2023-10-26 08:58:20,462 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-26 08:58:20,462 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 84
[2023-10-26 08:58:20,545 WARN  L207             Elim1Store]: Array PQE input equivalent to false
[2023-10-26 08:58:20,831 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:58:20,831 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 87 treesize of output 67
[2023-10-26 08:58:20,845 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:58:20,845 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 62 treesize of output 58
[2023-10-26 08:58:21,006 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 11 treesize of output 7
[2023-10-26 08:58:21,061 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:21,062 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 21 treesize of output 20
[2023-10-26 08:58:21,114 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:21,116 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:21,116 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 30 treesize of output 32
[2023-10-26 08:58:21,190 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:21,192 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:21,193 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:21,194 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 39 treesize of output 44
[2023-10-26 08:58:21,261 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:21,262 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:21,263 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:21,264 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-10-26 08:58:21,313 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:58:21,313 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:58:22,588 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2134 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (or .cse0 (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 1))))) (or .cse0 (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 3) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 2) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))))) is different from false
[2023-10-26 08:58:23,539 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:58:23,539 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838563336] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:58:23,539 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:58:23,539 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38
[2023-10-26 08:58:23,540 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472139795]
[2023-10-26 08:58:23,540 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:58:23,540 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2023-10-26 08:58:23,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:23,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2023-10-26 08:58:23,541 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1264, Unknown=27, NotChecked=74, Total=1560
[2023-10-26 08:58:23,752 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 215
[2023-10-26 08:58:23,753 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 3124 transitions, 60028 flow. Second operand  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:23,753 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:23,753 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 215
[2023-10-26 08:58:23,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:59:18,824 INFO  L130       PetriNetUnfolder]: 48747/81216 cut-off events.
[2023-10-26 08:59:18,824 INFO  L131       PetriNetUnfolder]: For 1990043/1990043 co-relation queries the response was YES.
[2023-10-26 08:59:19,802 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 836938 conditions, 81216 events. 48747/81216 cut-off events. For 1990043/1990043 co-relation queries the response was YES. Maximal size of possible extension queue 2083. Compared 669957 event pairs, 10146 based on Foata normal form. 32/77735 useless extension candidates. Maximal degree in co-relation 806166. Up to 77103 conditions per place. 
[2023-10-26 08:59:20,280 INFO  L137   encePairwiseOnDemand]: 198/215 looper letters, 3734 selfloop transitions, 151 changer transitions 140/4026 dead transitions.
[2023-10-26 08:59:20,280 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 4026 transitions, 83159 flow
[2023-10-26 08:59:20,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-26 08:59:20,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-26 08:59:20,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1346 transitions.
[2023-10-26 08:59:20,305 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2981173864894795
[2023-10-26 08:59:20,305 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1346 transitions.
[2023-10-26 08:59:20,305 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1346 transitions.
[2023-10-26 08:59:20,305 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:59:20,306 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1346 transitions.
[2023-10-26 08:59:20,307 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 64.0952380952381) internal successors, (1346), 21 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:59:20,310 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 215.0) internal successors, (4730), 22 states have internal predecessors, (4730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:59:20,310 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 215.0) internal successors, (4730), 22 states have internal predecessors, (4730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:59:20,310 INFO  L175             Difference]: Start difference. First operand has 287 places, 3124 transitions, 60028 flow. Second operand 21 states and 1346 transitions.
[2023-10-26 08:59:20,310 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 4026 transitions, 83159 flow
[2023-10-26 09:01:17,548 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 4026 transitions, 82892 flow, removed 121 selfloop flow, removed 9 redundant places.
[2023-10-26 09:01:17,608 INFO  L231             Difference]: Finished difference. Result has 310 places, 3223 transitions, 62889 flow
[2023-10-26 09:01:17,612 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=59839, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3024, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=62889, PETRI_PLACES=310, PETRI_TRANSITIONS=3223}
[2023-10-26 09:01:17,612 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 239 predicate places.
[2023-10-26 09:01:17,612 INFO  L495      AbstractCegarLoop]: Abstraction has has 310 places, 3223 transitions, 62889 flow
[2023-10-26 09:01:17,613 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:01:17,613 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:01:17,613 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, 1, 1, 1, 1]
[2023-10-26 09:01:17,620 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2023-10-26 09:01:17,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:01:17,819 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 09:01:17,824 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:01:17,825 INFO  L85        PathProgramCache]: Analyzing trace with hash 2001051211, now seen corresponding path program 4 times
[2023-10-26 09:01:17,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:01:17,825 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273064586]
[2023-10-26 09:01:17,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:01:17,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:01:17,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:01:18,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:01:18,720 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:01:18,720 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273064586]
[2023-10-26 09:01:18,720 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273064586] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 09:01:18,720 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426705090]
[2023-10-26 09:01:18,720 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-26 09:01:18,721 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:01:18,721 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:01:18,722 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 09:01:18,750 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2023-10-26 09:01:19,012 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-26 09:01:19,012 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 09:01:19,018 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 69 conjunts are in the unsatisfiable core
[2023-10-26 09:01:19,021 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 09:01:19,039 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 38 treesize of output 32
[2023-10-26 09:01:19,286 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-26 09:01:19,286 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10
[2023-10-26 09:01:19,477 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-26 09:01:19,478 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 57
[2023-10-26 09:01:19,491 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 22 treesize of output 16
[2023-10-26 09:01:19,601 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-10-26 09:01:19,658 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 11 treesize of output 7
[2023-10-26 09:01:19,724 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-10-26 09:01:19,774 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-10-26 09:01:19,793 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:01:19,794 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 21 treesize of output 20
[2023-10-26 09:01:19,847 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 23 treesize of output 23
[2023-10-26 09:01:19,866 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 23 treesize of output 23
[2023-10-26 09:01:19,896 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 23 treesize of output 23
[2023-10-26 09:01:19,913 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:01:19,914 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:01:19,914 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 30 treesize of output 32
[2023-10-26 09:01:19,985 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:01:19,987 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:01:19,987 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:01:19,988 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 39 treesize of output 44
[2023-10-26 09:01:20,156 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:01:20,157 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 55 treesize of output 52
[2023-10-26 09:01:20,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 09:01:20,217 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 09:01:20,236 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2283 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-10-26 09:01:20,915 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse7 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2278 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) .cse3))))))) (forall ((v_ArrVal_2278 (Array Int Int))) (let ((.cse8 (let ((.cse10 (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse10 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse10 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or (forall ((v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= 0 (select .cse9 .cse1))) (not (= (select .cse9 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))) (forall ((v_ArrVal_2278 (Array Int Int))) (let ((.cse12 (let ((.cse13 (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse13 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse13 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or (not (= 0 (select .cse11 .cse1))) (not (= (select .cse11 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_2283 (Array Int Int))) (= (select (select (store .cse12 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))))))))) is different from false
