./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-race.i --full-output --architecture 32bit


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44aeaf855edc431e525116b12fa66fa37a231a2b904458be73e2cabf32a3a1d4
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-01 17:11:20,008 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-01 17:11:20,009 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-01 17:11:20,031 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-01 17:11:20,031 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-01 17:11:20,032 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-01 17:11:20,033 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-01 17:11:20,034 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-01 17:11:20,035 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-01 17:11:20,036 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-01 17:11:20,036 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-01 17:11:20,037 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-01 17:11:20,037 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-01 17:11:20,038 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-01 17:11:20,039 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-01 17:11:20,040 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-01 17:11:20,040 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-01 17:11:20,041 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-01 17:11:20,042 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-01 17:11:20,043 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-01 17:11:20,044 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-01 17:11:20,046 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-01 17:11:20,046 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-01 17:11:20,047 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-01 17:11:20,049 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-01 17:11:20,050 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-01 17:11:20,050 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-01 17:11:20,050 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-01 17:11:20,051 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-01 17:11:20,051 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-01 17:11:20,051 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-01 17:11:20,052 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-01 17:11:20,052 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-01 17:11:20,053 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-01 17:11:20,053 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-01 17:11:20,054 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-01 17:11:20,054 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-01 17:11:20,054 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-01 17:11:20,054 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-01 17:11:20,055 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-01 17:11:20,055 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-01 17:11:20,056 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-01 17:11:20,072 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-01 17:11:20,072 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-01 17:11:20,072 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-01 17:11:20,072 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-01 17:11:20,073 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-01 17:11:20,073 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-01 17:11:20,073 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-01 17:11:20,073 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-01 17:11:20,074 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-01 17:11:20,074 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-01 17:11:20,074 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-01 17:11:20,074 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-01 17:11:20,074 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-01 17:11:20,074 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-01 17:11:20,074 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-01 17:11:20,074 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-01 17:11:20,074 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-01 17:11:20,074 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-01 17:11:20,075 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-01 17:11:20,075 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-01 17:11:20,075 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-01 17:11:20,075 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-01 17:11:20,075 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-01 17:11:20,075 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-01 17:11:20,075 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-01 17:11:20,075 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-01 17:11:20,076 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 17:11:20,076 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-01 17:11:20,076 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-01 17:11:20,076 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-01 17:11:20,076 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-01 17:11:20,076 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-01 17:11:20,076 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-01 17:11:20,076 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-01 17:11:20,076 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-01 17:11:20,077 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-01 17:11:20,077 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-01 17:11:20,077 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 -> 44aeaf855edc431e525116b12fa66fa37a231a2b904458be73e2cabf32a3a1d4
[2023-11-01 17:11:20,276 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-01 17:11:20,299 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-01 17:11:20,301 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-01 17:11:20,303 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-01 17:11:20,303 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-01 17:11:20,305 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array-race.i
[2023-11-01 17:11:21,353 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-01 17:11:21,609 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-01 17:11:21,610 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array-race.i
[2023-11-01 17:11:21,620 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/5b103d73e/5edbb9a3b074404c9438da21b4014886/FLAG7764f7380
[2023-11-01 17:11:21,975 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/5b103d73e/5edbb9a3b074404c9438da21b4014886
[2023-11-01 17:11:21,978 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-01 17:11:21,979 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-01 17:11:21,981 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-01 17:11:21,981 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-01 17:11:21,986 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-01 17:11:21,986 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:11:21" (1/1) ...
[2023-11-01 17:11:21,987 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f75611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:21, skipping insertion in model container
[2023-11-01 17:11:21,987 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:11:21" (1/1) ...
[2023-11-01 17:11:21,993 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-01 17:11:22,026 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-01 17:11:22,143 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-01 17:11:22,307 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 17:11:22,314 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-01 17:11:22,323 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-01 17:11:22,349 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 17:11:22,383 INFO  L208         MainTranslator]: Completed translation
[2023-11-01 17:11:22,384 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22 WrapperNode
[2023-11-01 17:11:22,384 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-01 17:11:22,385 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-01 17:11:22,385 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-01 17:11:22,385 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-01 17:11:22,391 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,407 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,427 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2023-11-01 17:11:22,427 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-01 17:11:22,428 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-01 17:11:22,428 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-01 17:11:22,428 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-01 17:11:22,436 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,436 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,440 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,440 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,448 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,451 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,452 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,454 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,456 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-01 17:11:22,457 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-01 17:11:22,457 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-01 17:11:22,457 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-01 17:11:22,458 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (1/1) ...
[2023-11-01 17:11:22,463 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 17:11:22,471 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:11:22,485 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-01 17:11:22,489 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-01 17:11:22,529 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-01 17:11:22,529 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-01 17:11:22,529 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-01 17:11:22,530 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-01 17:11:22,530 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-01 17:11:22,530 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-01 17:11:22,530 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-01 17:11:22,530 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-01 17:11:22,530 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-01 17:11:22,531 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-01 17:11:22,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-01 17:11:22,532 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-01 17:11:22,646 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-01 17:11:22,648 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-01 17:11:22,887 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-01 17:11:22,894 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-01 17:11:22,894 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-01 17:11:22,896 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:11:22 BoogieIcfgContainer
[2023-11-01 17:11:22,896 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-01 17:11:22,898 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-01 17:11:22,898 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-01 17:11:22,901 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-01 17:11:22,901 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 05:11:21" (1/3) ...
[2023-11-01 17:11:22,902 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e92bbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:11:22, skipping insertion in model container
[2023-11-01 17:11:22,902 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:11:22" (2/3) ...
[2023-11-01 17:11:22,902 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e92bbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:11:22, skipping insertion in model container
[2023-11-01 17:11:22,902 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:11:22" (3/3) ...
[2023-11-01 17:11:22,903 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array-race.i
[2023-11-01 17:11:22,910 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-01 17:11:22,918 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-01 17:11:22,918 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2023-11-01 17:11:22,919 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-01 17:11:22,965 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-01 17:11:22,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-11-01 17:11:23,050 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-11-01 17:11:23,051 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 17:11:23,055 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-11-01 17:11:23,055 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2023-11-01 17:11:23,060 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2023-11-01 17:11:23,065 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:11:23,081 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2023-11-01 17:11:23,084 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2023-11-01 17:11:23,084 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-11-01 17:11:23,115 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-11-01 17:11:23,116 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 17:11:23,117 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-11-01 17:11:23,118 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2023-11-01 17:11:25,527 INFO  L134        LiptonReduction]: Checked pairs total: 10638
[2023-11-01 17:11:25,528 INFO  L136        LiptonReduction]: Total number of compositions: 70
[2023-11-01 17:11:25,543 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:11:25,549 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;@2105bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:11:25,549 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-11-01 17:11:25,552 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-11-01 17:11:25,553 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:11:25,553 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:25,553 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:11:25,554 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-11-01 17:11:25,558 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:25,558 INFO  L85        PathProgramCache]: Analyzing trace with hash 1440899133, now seen corresponding path program 1 times
[2023-11-01 17:11:25,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:25,565 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907078386]
[2023-11-01 17:11:25,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:25,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:25,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:25,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:25,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:25,993 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907078386]
[2023-11-01 17:11:25,993 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907078386] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:11:25,994 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:11:25,994 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 17:11:25,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028502247]
[2023-11-01 17:11:25,995 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:11:26,001 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 17:11:26,002 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:26,016 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 17:11:26,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 17:11:26,308 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-01 17:11:26,312 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-11-01 17:11:26,313 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:26,313 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-01 17:11:26,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:26,570 INFO  L130       PetriNetUnfolder]: 152/518 cut-off events.
[2023-11-01 17:11:26,570 INFO  L131       PetriNetUnfolder]: For 8/12 co-relation queries the response was YES.
[2023-11-01 17:11:26,573 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-11-01 17:11:26,577 INFO  L137   encePairwiseOnDemand]: 176/192 looper letters, 49 selfloop transitions, 23 changer transitions 0/99 dead transitions.
[2023-11-01 17:11:26,578 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 350 flow
[2023-11-01 17:11:26,580 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 17:11:26,582 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 17:11:26,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions.
[2023-11-01 17:11:26,597 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5746527777777778
[2023-11-01 17:11:26,598 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 662 transitions.
[2023-11-01 17:11:26,598 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 662 transitions.
[2023-11-01 17:11:26,600 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:26,602 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 662 transitions.
[2023-11-01 17:11:26,607 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-11-01 17:11:26,617 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-11-01 17:11:26,618 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-11-01 17:11:26,620 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 662 transitions.
[2023-11-01 17:11:26,620 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 350 flow
[2023-11-01 17:11:26,623 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:11:26,626 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2023-11-01 17:11:26,627 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-11-01 17:11:26,631 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2023-11-01 17:11:26,631 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2023-11-01 17:11:26,631 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-11-01 17:11:26,632 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:26,632 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:11:26,632 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-01 17:11:26,632 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-11-01 17:11:26,633 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:26,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 1491761304, now seen corresponding path program 1 times
[2023-11-01 17:11:26,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:26,633 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176702432]
[2023-11-01 17:11:26,634 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:26,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:26,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:26,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:26,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:26,820 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176702432]
[2023-11-01 17:11:26,820 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176702432] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:11:26,820 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:11:26,820 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 17:11:26,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378143015]
[2023-11-01 17:11:26,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:11:26,822 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 17:11:26,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:26,822 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 17:11:26,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 17:11:27,029 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 192
[2023-11-01 17:11:27,031 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-11-01 17:11:27,031 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:27,031 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 192
[2023-11-01 17:11:27,032 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:27,296 INFO  L130       PetriNetUnfolder]: 294/866 cut-off events.
[2023-11-01 17:11:27,296 INFO  L131       PetriNetUnfolder]: For 338/344 co-relation queries the response was YES.
[2023-11-01 17:11:27,300 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-11-01 17:11:27,303 INFO  L137   encePairwiseOnDemand]: 169/192 looper letters, 75 selfloop transitions, 50 changer transitions 0/153 dead transitions.
[2023-11-01 17:11:27,303 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 153 transitions, 805 flow
[2023-11-01 17:11:27,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 17:11:27,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 17:11:27,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions.
[2023-11-01 17:11:27,307 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5598958333333334
[2023-11-01 17:11:27,307 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 645 transitions.
[2023-11-01 17:11:27,307 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions.
[2023-11-01 17:11:27,308 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:27,308 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions.
[2023-11-01 17:11:27,309 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-11-01 17:11:27,315 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-11-01 17:11:27,315 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-11-01 17:11:27,316 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 6 states and 645 transitions.
[2023-11-01 17:11:27,316 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 153 transitions, 805 flow
[2023-11-01 17:11:27,322 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 805 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:11:27,324 INFO  L231             Difference]: Finished difference. Result has 79 places, 129 transitions, 770 flow
[2023-11-01 17:11:27,325 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-11-01 17:11:27,325 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places.
[2023-11-01 17:11:27,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 129 transitions, 770 flow
[2023-11-01 17:11:27,326 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-11-01 17:11:27,326 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:27,326 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:11:27,326 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-01 17:11:27,327 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-11-01 17:11:27,327 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:27,327 INFO  L85        PathProgramCache]: Analyzing trace with hash 365353206, now seen corresponding path program 1 times
[2023-11-01 17:11:27,328 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:27,328 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225261810]
[2023-11-01 17:11:27,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:27,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:27,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:27,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:27,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:27,557 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225261810]
[2023-11-01 17:11:27,557 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225261810] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:11:27,558 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:11:27,558 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 17:11:27,558 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483317766]
[2023-11-01 17:11:27,558 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:11:27,559 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 17:11:27,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:27,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 17:11:27,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 17:11:27,845 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 192
[2023-11-01 17:11:27,846 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-11-01 17:11:27,847 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:27,847 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 192
[2023-11-01 17:11:27,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:28,042 INFO  L130       PetriNetUnfolder]: 290/850 cut-off events.
[2023-11-01 17:11:28,043 INFO  L131       PetriNetUnfolder]: For 1132/1151 co-relation queries the response was YES.
[2023-11-01 17:11:28,044 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-11-01 17:11:28,047 INFO  L137   encePairwiseOnDemand]: 181/192 looper letters, 77 selfloop transitions, 33 changer transitions 8/171 dead transitions.
[2023-11-01 17:11:28,047 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1245 flow
[2023-11-01 17:11:28,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 17:11:28,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 17:11:28,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions.
[2023-11-01 17:11:28,050 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5807291666666666
[2023-11-01 17:11:28,050 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 669 transitions.
[2023-11-01 17:11:28,050 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions.
[2023-11-01 17:11:28,050 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:28,051 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions.
[2023-11-01 17:11:28,052 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-11-01 17:11:28,054 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-11-01 17:11:28,054 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-11-01 17:11:28,055 INFO  L175             Difference]: Start difference. First operand has 79 places, 129 transitions, 770 flow. Second operand 6 states and 669 transitions.
[2023-11-01 17:11:28,055 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 1245 flow
[2023-11-01 17:11:28,059 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1245 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:11:28,061 INFO  L231             Difference]: Finished difference. Result has 89 places, 159 transitions, 1135 flow
[2023-11-01 17:11:28,062 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-11-01 17:11:28,062 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2023-11-01 17:11:28,062 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1135 flow
[2023-11-01 17:11:28,063 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-11-01 17:11:28,063 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:28,063 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-11-01 17:11:28,063 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-01 17:11:28,064 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-11-01 17:11:28,064 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:28,064 INFO  L85        PathProgramCache]: Analyzing trace with hash -1763579770, now seen corresponding path program 1 times
[2023-11-01 17:11:28,064 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:28,065 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929216905]
[2023-11-01 17:11:28,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:28,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:28,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:28,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:28,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:28,289 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929216905]
[2023-11-01 17:11:28,289 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929216905] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:11:28,290 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:11:28,290 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 17:11:28,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987070259]
[2023-11-01 17:11:28,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:11:28,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 17:11:28,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:28,291 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 17:11:28,291 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 17:11:28,400 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192
[2023-11-01 17:11:28,401 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-11-01 17:11:28,401 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:28,402 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192
[2023-11-01 17:11:28,402 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:28,865 INFO  L130       PetriNetUnfolder]: 555/1369 cut-off events.
[2023-11-01 17:11:28,865 INFO  L131       PetriNetUnfolder]: For 1875/1889 co-relation queries the response was YES.
[2023-11-01 17:11:28,869 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-11-01 17:11:28,874 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 172 selfloop transitions, 111 changer transitions 10/308 dead transitions.
[2023-11-01 17:11:28,874 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 308 transitions, 2383 flow
[2023-11-01 17:11:28,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 17:11:28,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 17:11:28,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions.
[2023-11-01 17:11:28,877 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5972222222222222
[2023-11-01 17:11:28,877 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 688 transitions.
[2023-11-01 17:11:28,877 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 688 transitions.
[2023-11-01 17:11:28,878 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:28,878 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 688 transitions.
[2023-11-01 17:11:28,879 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-11-01 17:11:28,881 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-11-01 17:11:28,882 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-11-01 17:11:28,882 INFO  L175             Difference]: Start difference. First operand has 89 places, 159 transitions, 1135 flow. Second operand 6 states and 688 transitions.
[2023-11-01 17:11:28,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 308 transitions, 2383 flow
[2023-11-01 17:11:28,888 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 308 transitions, 2383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:11:28,892 INFO  L231             Difference]: Finished difference. Result has 97 places, 262 transitions, 2045 flow
[2023-11-01 17:11:28,892 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-11-01 17:11:28,893 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places.
[2023-11-01 17:11:28,893 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 262 transitions, 2045 flow
[2023-11-01 17:11:28,893 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-11-01 17:11:28,893 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:28,894 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-11-01 17:11:28,894 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-01 17:11:28,894 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-11-01 17:11:28,894 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:28,894 INFO  L85        PathProgramCache]: Analyzing trace with hash -766543501, now seen corresponding path program 1 times
[2023-11-01 17:11:28,895 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:28,895 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882561389]
[2023-11-01 17:11:28,895 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:28,895 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:28,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:29,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:29,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:29,240 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882561389]
[2023-11-01 17:11:29,241 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882561389] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:11:29,241 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289041930]
[2023-11-01 17:11:29,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:29,242 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:11:29,243 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:11:29,245 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:11:29,248 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-01 17:11:29,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:29,367 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-01 17:11:29,374 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:11:29,435 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-11-01 17:11:29,593 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:11:29,627 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:29,628 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 17:11:29,667 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:29,668 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:29,669 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 17:11:29,726 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:29,728 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:29,729 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:29,730 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 17:11:29,781 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:29,782 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:11:29,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:29,818 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:11:30,019 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-11-01 17:11:30,046 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-11-01 17:11:30,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-11-01 17:11:30,183 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [289041930] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:11:30,183 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:11:30,184 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-11-01 17:11:30,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650877640]
[2023-11-01 17:11:30,184 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:11:30,185 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-11-01 17:11:30,186 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:30,187 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-11-01 17:11:30,187 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=488, Unknown=16, NotChecked=94, Total=702
[2023-11-01 17:11:30,230 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 192
[2023-11-01 17:11:30,232 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-11-01 17:11:30,232 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:30,232 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 192
[2023-11-01 17:11:30,232 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:31,299 INFO  L130       PetriNetUnfolder]: 631/1458 cut-off events.
[2023-11-01 17:11:31,300 INFO  L131       PetriNetUnfolder]: For 3368/3368 co-relation queries the response was YES.
[2023-11-01 17:11:31,305 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-11-01 17:11:31,311 INFO  L137   encePairwiseOnDemand]: 182/192 looper letters, 304 selfloop transitions, 12 changer transitions 12/330 dead transitions.
[2023-11-01 17:11:31,311 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 330 transitions, 3086 flow
[2023-11-01 17:11:31,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-11-01 17:11:31,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-11-01 17:11:31,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2023-11-01 17:11:31,314 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3692708333333333
[2023-11-01 17:11:31,314 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2023-11-01 17:11:31,314 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2023-11-01 17:11:31,315 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:31,315 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2023-11-01 17:11:31,316 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-11-01 17:11:31,318 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-11-01 17:11:31,318 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-11-01 17:11:31,319 INFO  L175             Difference]: Start difference. First operand has 97 places, 262 transitions, 2045 flow. Second operand 10 states and 709 transitions.
[2023-11-01 17:11:31,319 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 330 transitions, 3086 flow
[2023-11-01 17:11:31,336 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 2942 flow, removed 72 selfloop flow, removed 0 redundant places.
[2023-11-01 17:11:31,339 INFO  L231             Difference]: Finished difference. Result has 107 places, 265 transitions, 1941 flow
[2023-11-01 17:11:31,340 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-11-01 17:11:31,340 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places.
[2023-11-01 17:11:31,341 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 265 transitions, 1941 flow
[2023-11-01 17:11:31,341 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-11-01 17:11:31,341 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:31,342 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-11-01 17:11:31,352 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-01 17:11:31,542 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-11-01 17:11:31,543 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-11-01 17:11:31,544 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:31,544 INFO  L85        PathProgramCache]: Analyzing trace with hash 140689641, now seen corresponding path program 1 times
[2023-11-01 17:11:31,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:31,545 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791255989]
[2023-11-01 17:11:31,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:31,546 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:31,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:31,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:31,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:31,846 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791255989]
[2023-11-01 17:11:31,846 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791255989] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:11:31,846 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6628982]
[2023-11-01 17:11:31,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:31,847 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:11:31,847 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:11:31,848 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:11:31,850 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-01 17:11:31,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:31,950 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-01 17:11:31,955 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:11:31,977 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-11-01 17:11:32,071 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:11:32,098 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-11-01 17:11:32,133 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:11:32,133 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-11-01 17:11:32,179 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:11:32,179 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-11-01 17:11:32,228 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:32,229 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:11:32,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:32,240 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:11:32,262 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-11-01 17:11:32,281 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-11-01 17:11:32,310 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-11-01 17:11:32,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 17:11:32,423 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [6628982] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:11:32,423 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:11:32,423 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-11-01 17:11:32,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371639780]
[2023-11-01 17:11:32,423 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:11:32,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-01 17:11:32,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:32,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-01 17:11:32,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-11-01 17:11:32,426 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2023-11-01 17:11:32,427 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-11-01 17:11:32,427 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:32,427 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2023-11-01 17:11:32,427 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:35,340 INFO  L130       PetriNetUnfolder]: 674/1547 cut-off events.
[2023-11-01 17:11:35,340 INFO  L131       PetriNetUnfolder]: For 3758/3764 co-relation queries the response was YES.
[2023-11-01 17:11:35,344 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 9796 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-11-01 17:11:35,350 INFO  L137   encePairwiseOnDemand]: 141/192 looper letters, 305 selfloop transitions, 163 changer transitions 40/510 dead transitions.
[2023-11-01 17:11:35,351 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 510 transitions, 4404 flow
[2023-11-01 17:11:35,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-01 17:11:35,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-01 17:11:35,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1396 transitions.
[2023-11-01 17:11:35,355 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3826754385964912
[2023-11-01 17:11:35,355 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1396 transitions.
[2023-11-01 17:11:35,356 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1396 transitions.
[2023-11-01 17:11:35,356 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:35,357 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1396 transitions.
[2023-11-01 17:11:35,359 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-11-01 17:11:35,363 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-11-01 17:11:35,364 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-11-01 17:11:35,364 INFO  L175             Difference]: Start difference. First operand has 107 places, 265 transitions, 1941 flow. Second operand 19 states and 1396 transitions.
[2023-11-01 17:11:35,364 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 510 transitions, 4404 flow
[2023-11-01 17:11:35,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 510 transitions, 4376 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-01 17:11:35,386 INFO  L231             Difference]: Finished difference. Result has 127 places, 328 transitions, 3030 flow
[2023-11-01 17:11:35,386 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-11-01 17:11:35,387 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 68 predicate places.
[2023-11-01 17:11:35,387 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 328 transitions, 3030 flow
[2023-11-01 17:11:35,388 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-11-01 17:11:35,388 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:35,388 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-11-01 17:11:35,394 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-01 17:11:35,588 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-11-01 17:11:35,590 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-11-01 17:11:35,590 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:35,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 1201166498, now seen corresponding path program 1 times
[2023-11-01 17:11:35,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:35,591 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698613368]
[2023-11-01 17:11:35,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:35,592 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:35,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:35,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:35,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:35,680 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698613368]
[2023-11-01 17:11:35,680 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698613368] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:11:35,680 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104981161]
[2023-11-01 17:11:35,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:35,681 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:11:35,681 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:11:35,682 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:11:35,684 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-01 17:11:35,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:35,790 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-01 17:11:35,791 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:11:35,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:35,851 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:11:35,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:35,895 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104981161] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:11:35,895 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:11:35,895 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-01 17:11:35,895 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785308556]
[2023-11-01 17:11:35,896 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:11:35,896 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-01 17:11:35,896 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:35,897 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-01 17:11:35,897 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-01 17:11:36,003 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 192
[2023-11-01 17:11:36,004 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-11-01 17:11:36,004 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:36,004 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 192
[2023-11-01 17:11:36,004 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:36,165 INFO  L130       PetriNetUnfolder]: 274/814 cut-off events.
[2023-11-01 17:11:36,165 INFO  L131       PetriNetUnfolder]: For 2830/2844 co-relation queries the response was YES.
[2023-11-01 17:11:36,167 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3878 conditions, 814 events. 274/814 cut-off events. For 2830/2844 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5031 event pairs, 11 based on Foata normal form. 2/803 useless extension candidates. Maximal degree in co-relation 3747. Up to 246 conditions per place. 
[2023-11-01 17:11:36,171 INFO  L137   encePairwiseOnDemand]: 186/192 looper letters, 24 selfloop transitions, 10 changer transitions 3/248 dead transitions.
[2023-11-01 17:11:36,171 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 248 transitions, 2348 flow
[2023-11-01 17:11:36,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-01 17:11:36,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-01 17:11:36,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions.
[2023-11-01 17:11:36,174 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5729166666666666
[2023-11-01 17:11:36,174 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 770 transitions.
[2023-11-01 17:11:36,174 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions.
[2023-11-01 17:11:36,174 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:36,175 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions.
[2023-11-01 17:11:36,176 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-11-01 17:11:36,177 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-11-01 17:11:36,178 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-11-01 17:11:36,178 INFO  L175             Difference]: Start difference. First operand has 127 places, 328 transitions, 3030 flow. Second operand 7 states and 770 transitions.
[2023-11-01 17:11:36,178 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 248 transitions, 2348 flow
[2023-11-01 17:11:36,192 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 248 transitions, 2248 flow, removed 28 selfloop flow, removed 8 redundant places.
[2023-11-01 17:11:36,195 INFO  L231             Difference]: Finished difference. Result has 113 places, 240 transitions, 2156 flow
[2023-11-01 17:11:36,195 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-11-01 17:11:36,195 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 54 predicate places.
[2023-11-01 17:11:36,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 240 transitions, 2156 flow
[2023-11-01 17:11:36,196 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-11-01 17:11:36,196 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:36,196 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-11-01 17:11:36,204 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-01 17:11:36,397 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-11-01 17:11:36,398 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-11-01 17:11:36,398 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:36,399 INFO  L85        PathProgramCache]: Analyzing trace with hash -1881773305, now seen corresponding path program 1 times
[2023-11-01 17:11:36,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:36,399 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641360677]
[2023-11-01 17:11:36,400 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:36,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:36,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:37,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:37,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:37,312 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641360677]
[2023-11-01 17:11:37,313 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641360677] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:11:37,313 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602426125]
[2023-11-01 17:11:37,313 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:37,313 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:11:37,314 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:11:37,315 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:11:37,316 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-01 17:11:37,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:37,437 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-01 17:11:37,441 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:11:37,471 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-11-01 17:11:37,557 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:11:37,592 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-11-01 17:11:37,631 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:11:37,632 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-11-01 17:11:37,704 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:11:37,705 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-11-01 17:11:37,751 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:37,752 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:11:37,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:37,763 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:11:37,788 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-11-01 17:11:37,809 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-11-01 17:11:37,874 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-11-01 17:11:37,978 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:11:37,979 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-11-01 17:11:37,985 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:11:37,986 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 26
[2023-11-01 17:11:38,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 17:11:38,094 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [602426125] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:11:38,095 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:11:38,095 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26
[2023-11-01 17:11:38,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920747399]
[2023-11-01 17:11:38,095 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:11:38,096 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-11-01 17:11:38,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:38,096 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-11-01 17:11:38,097 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=511, Unknown=3, NotChecked=144, Total=756
[2023-11-01 17:11:38,180 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 192
[2023-11-01 17:11:38,182 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 240 transitions, 2156 flow. Second operand  has 28 states, 28 states have (on average 51.607142857142854) internal successors, (1445), 28 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:11:38,182 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:38,182 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 192
[2023-11-01 17:11:38,182 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:45,306 INFO  L130       PetriNetUnfolder]: 977/2322 cut-off events.
[2023-11-01 17:11:45,307 INFO  L131       PetriNetUnfolder]: For 9274/9280 co-relation queries the response was YES.
[2023-11-01 17:11:45,313 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12490 conditions, 2322 events. 977/2322 cut-off events. For 9274/9280 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16785 event pairs, 66 based on Foata normal form. 88/2410 useless extension candidates. Maximal degree in co-relation 12281. Up to 730 conditions per place. 
[2023-11-01 17:11:45,323 INFO  L137   encePairwiseOnDemand]: 154/192 looper letters, 489 selfloop transitions, 337 changer transitions 15/843 dead transitions.
[2023-11-01 17:11:45,323 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 843 transitions, 8516 flow
[2023-11-01 17:11:45,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2023-11-01 17:11:45,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2023-11-01 17:11:45,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1768 transitions.
[2023-11-01 17:11:45,329 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3410493827160494
[2023-11-01 17:11:45,329 INFO  L72            ComplementDD]: Start complementDD. Operand 27 states and 1768 transitions.
[2023-11-01 17:11:45,329 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 27 states and 1768 transitions.
[2023-11-01 17:11:45,330 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:45,330 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1768 transitions.
[2023-11-01 17:11:45,333 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 28 states, 27 states have (on average 65.48148148148148) internal successors, (1768), 27 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:11:45,338 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 28 states, 28 states have (on average 192.0) internal successors, (5376), 28 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:11:45,339 INFO  L81            ComplementDD]: Finished complementDD. Result  has 28 states, 28 states have (on average 192.0) internal successors, (5376), 28 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:11:45,339 INFO  L175             Difference]: Start difference. First operand has 113 places, 240 transitions, 2156 flow. Second operand 27 states and 1768 transitions.
[2023-11-01 17:11:45,339 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 843 transitions, 8516 flow
[2023-11-01 17:11:45,371 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 843 transitions, 8478 flow, removed 13 selfloop flow, removed 4 redundant places.
[2023-11-01 17:11:45,378 INFO  L231             Difference]: Finished difference. Result has 146 places, 492 transitions, 5846 flow
[2023-11-01 17:11:45,379 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=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5846, PETRI_PLACES=146, PETRI_TRANSITIONS=492}
[2023-11-01 17:11:45,379 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 87 predicate places.
[2023-11-01 17:11:45,379 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 492 transitions, 5846 flow
[2023-11-01 17:11:45,380 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 51.607142857142854) internal successors, (1445), 28 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:11:45,380 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:45,380 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-11-01 17:11:45,387 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-01 17:11:45,581 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-11-01 17:11:45,582 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-11-01 17:11:45,583 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:45,583 INFO  L85        PathProgramCache]: Analyzing trace with hash -831584502, now seen corresponding path program 1 times
[2023-11-01 17:11:45,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:45,584 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629237602]
[2023-11-01 17:11:45,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:45,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:45,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:45,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:45,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:45,909 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629237602]
[2023-11-01 17:11:45,909 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629237602] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:11:45,909 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348284901]
[2023-11-01 17:11:45,909 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:45,910 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:11:45,910 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:11:45,911 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:11:45,913 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-11-01 17:11:46,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:46,049 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-11-01 17:11:46,053 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:11:46,091 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-11-01 17:11:46,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:11:46,210 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:46,211 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 17:11:46,249 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:46,250 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:46,251 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 17:11:46,299 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:46,300 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:46,301 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:46,302 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 17:11:46,389 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:46,390 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:11:46,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:46,431 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:11:46,456 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-11-01 17:11:46,477 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of1ForFork0_#in~arg.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_#in~arg.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_#in~arg.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-11-01 17:11:46,502 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.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 .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-11-01 17:11:46,527 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_680 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.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 .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2023-11-01 17:11:46,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:46,591 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [348284901] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:11:46,592 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:11:46,592 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23
[2023-11-01 17:11:46,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606487490]
[2023-11-01 17:11:46,592 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:11:46,592 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2023-11-01 17:11:46,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:46,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-11-01 17:11:46,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=338, Unknown=4, NotChecked=164, Total=600
[2023-11-01 17:11:46,597 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 192
[2023-11-01 17:11:46,598 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 492 transitions, 5846 flow. Second operand  has 25 states, 25 states have (on average 58.44) internal successors, (1461), 25 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:11:46,598 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:46,598 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 192
[2023-11-01 17:11:46,599 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:47,754 INFO  L130       PetriNetUnfolder]: 927/2206 cut-off events.
[2023-11-01 17:11:47,754 INFO  L131       PetriNetUnfolder]: For 17897/17908 co-relation queries the response was YES.
[2023-11-01 17:11:47,764 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15327 conditions, 2206 events. 927/2206 cut-off events. For 17897/17908 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15711 event pairs, 87 based on Foata normal form. 57/2262 useless extension candidates. Maximal degree in co-relation 15090. Up to 2077 conditions per place. 
[2023-11-01 17:11:47,777 INFO  L137   encePairwiseOnDemand]: 183/192 looper letters, 493 selfloop transitions, 13 changer transitions 1/509 dead transitions.
[2023-11-01 17:11:47,777 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 509 transitions, 6965 flow
[2023-11-01 17:11:47,778 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-11-01 17:11:47,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-11-01 17:11:47,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 643 transitions.
[2023-11-01 17:11:47,780 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.33489583333333334
[2023-11-01 17:11:47,780 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 643 transitions.
[2023-11-01 17:11:47,780 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 643 transitions.
[2023-11-01 17:11:47,781 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:47,781 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 643 transitions.
[2023-11-01 17:11:47,782 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-11-01 17:11:47,784 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-11-01 17:11:47,784 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-11-01 17:11:47,784 INFO  L175             Difference]: Start difference. First operand has 146 places, 492 transitions, 5846 flow. Second operand 10 states and 643 transitions.
[2023-11-01 17:11:47,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 509 transitions, 6965 flow
[2023-11-01 17:11:47,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 509 transitions, 6708 flow, removed 82 selfloop flow, removed 12 redundant places.
[2023-11-01 17:11:47,877 INFO  L231             Difference]: Finished difference. Result has 142 places, 477 transitions, 5452 flow
[2023-11-01 17:11:47,877 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=5418, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5452, PETRI_PLACES=142, PETRI_TRANSITIONS=477}
[2023-11-01 17:11:47,878 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 83 predicate places.
[2023-11-01 17:11:47,878 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 477 transitions, 5452 flow
[2023-11-01 17:11:47,888 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 58.44) internal successors, (1461), 25 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:11:47,888 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:47,888 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-11-01 17:11:47,895 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-11-01 17:11:48,089 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-11-01 17:11:48,090 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-11-01 17:11:48,091 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:48,092 INFO  L85        PathProgramCache]: Analyzing trace with hash 2140873883, now seen corresponding path program 2 times
[2023-11-01 17:11:48,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:48,092 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322972593]
[2023-11-01 17:11:48,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:48,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:48,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:48,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:48,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:48,478 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322972593]
[2023-11-01 17:11:48,478 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322972593] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:11:48,478 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476842071]
[2023-11-01 17:11:48,479 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 17:11:48,479 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:11:48,479 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:11:48,480 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:11:48,482 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-11-01 17:11:48,649 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 17:11:48,649 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 17:11:48,650 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-11-01 17:11:48,653 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:11:48,683 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-11-01 17:11:48,814 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:11:48,846 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-11-01 17:11:48,891 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:11:48,892 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-11-01 17:11:48,930 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:11:48,931 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-11-01 17:11:48,983 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:48,986 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:11:48,986 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-11-01 17:11:49,144 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:49,147 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:11:49,158 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-11-01 17:11:49,158 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-11-01 17:11:49,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:49,187 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:11:49,204 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_811 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_811) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_811 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_811) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_811 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_811) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))) (forall ((v_ArrVal_811 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_811) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-11-01 17:11:50,012 INFO  L321             Elim1Store]: treesize reduction 242, result has 32.0 percent of original size
[2023-11-01 17:11:50,013 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-11-01 17:11:50,082 INFO  L321             Elim1Store]: treesize reduction 37, result has 63.4 percent of original size
[2023-11-01 17:11:50,083 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-11-01 17:11:50,108 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-11-01 17:11:50,141 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-11-01 17:11:50,155 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-11-01 17:11:50,166 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-11-01 17:11:50,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-11-01 17:11:50,654 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [476842071] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:11:50,654 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:11:50,654 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30
[2023-11-01 17:11:50,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521098684]
[2023-11-01 17:11:50,655 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:11:50,656 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-11-01 17:11:50,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:50,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-11-01 17:11:50,657 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=778, Unknown=1, NotChecked=58, Total=992
[2023-11-01 17:11:51,681 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 192
[2023-11-01 17:11:51,684 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 477 transitions, 5452 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-11-01 17:11:51,684 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:51,684 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 192
[2023-11-01 17:11:51,684 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:55,541 INFO  L130       PetriNetUnfolder]: 897/2130 cut-off events.
[2023-11-01 17:11:55,541 INFO  L131       PetriNetUnfolder]: For 16015/16026 co-relation queries the response was YES.
[2023-11-01 17:11:55,550 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14199 conditions, 2130 events. 897/2130 cut-off events. For 16015/16026 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15103 event pairs, 31 based on Foata normal form. 42/2171 useless extension candidates. Maximal degree in co-relation 13982. Up to 769 conditions per place. 
[2023-11-01 17:11:55,560 INFO  L137   encePairwiseOnDemand]: 174/192 looper letters, 408 selfloop transitions, 228 changer transitions 7/645 dead transitions.
[2023-11-01 17:11:55,560 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 645 transitions, 8352 flow
[2023-11-01 17:11:55,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-01 17:11:55,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-01 17:11:55,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1229 transitions.
[2023-11-01 17:11:55,564 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.33689692982456143
[2023-11-01 17:11:55,564 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1229 transitions.
[2023-11-01 17:11:55,564 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1229 transitions.
[2023-11-01 17:11:55,565 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:55,565 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1229 transitions.
[2023-11-01 17:11:55,567 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 64.6842105263158) internal successors, (1229), 19 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:11:55,570 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-11-01 17:11:55,571 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-11-01 17:11:55,571 INFO  L175             Difference]: Start difference. First operand has 142 places, 477 transitions, 5452 flow. Second operand 19 states and 1229 transitions.
[2023-11-01 17:11:55,571 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 645 transitions, 8352 flow
[2023-11-01 17:11:55,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 645 transitions, 8334 flow, removed 0 selfloop flow, removed 7 redundant places.
[2023-11-01 17:11:55,656 INFO  L231             Difference]: Finished difference. Result has 158 places, 495 transitions, 6376 flow
[2023-11-01 17:11:55,657 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=5434, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6376, PETRI_PLACES=158, PETRI_TRANSITIONS=495}
[2023-11-01 17:11:55,657 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 99 predicate places.
[2023-11-01 17:11:55,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 495 transitions, 6376 flow
[2023-11-01 17:11:55,658 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-11-01 17:11:55,658 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:55,658 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-11-01 17:11:55,665 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2023-11-01 17:11:55,859 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-11-01 17:11:55,860 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-11-01 17:11:55,860 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:55,861 INFO  L85        PathProgramCache]: Analyzing trace with hash 1212047773, now seen corresponding path program 1 times
[2023-11-01 17:11:55,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:55,862 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742504948]
[2023-11-01 17:11:55,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:55,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:55,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:11:55,895 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 17:11:55,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 17:11:55,948 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 17:11:55,949 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 17:11:55,949 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-11-01 17:11:55,951 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-11-01 17:11:55,951 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-11-01 17:11:55,951 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-11-01 17:11:55,951 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-11-01 17:11:55,951 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-11-01 17:11:55,952 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-11-01 17:11:55,952 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-11-01 17:11:55,952 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-11-01 17:11:55,952 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-01 17:11:55,952 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:11:55,956 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 17:11:55,956 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-01 17:11:55,998 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-01 17:11:56,000 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-11-01 17:11:56,019 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-11-01 17:11:56,019 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 17:11:56,020 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-11-01 17:11:56,020 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2023-11-01 17:11:56,021 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2023-11-01 17:11:56,021 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 17:11:56,021 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2023-11-01 17:11:56,022 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2023-11-01 17:11:56,022 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-11-01 17:11:56,040 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-11-01 17:11:56,041 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 17:11:56,041 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-11-01 17:11:56,044 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2023-11-01 17:11:58,849 INFO  L134        LiptonReduction]: Checked pairs total: 23741
[2023-11-01 17:11:58,849 INFO  L136        LiptonReduction]: Total number of compositions: 76
[2023-11-01 17:11:58,851 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 17:11:58,851 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;@2105bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 17:11:58,852 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-11-01 17:11:58,853 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-11-01 17:11:58,853 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 17:11:58,853 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:58,853 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:11:58,853 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-11-01 17:11:58,854 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:58,854 INFO  L85        PathProgramCache]: Analyzing trace with hash -708344653, now seen corresponding path program 1 times
[2023-11-01 17:11:58,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:58,854 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771557500]
[2023-11-01 17:11:58,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:58,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:58,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:58,949 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:58,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:58,950 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771557500]
[2023-11-01 17:11:58,950 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771557500] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:11:58,950 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:11:58,950 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 17:11:58,950 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317173732]
[2023-11-01 17:11:58,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:11:58,950 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 17:11:58,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:58,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 17:11:58,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 17:11:59,158 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 215
[2023-11-01 17:11:59,158 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-11-01 17:11:59,158 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:59,158 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 215
[2023-11-01 17:11:59,158 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:11:59,811 INFO  L130       PetriNetUnfolder]: 2976/6074 cut-off events.
[2023-11-01 17:11:59,811 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2023-11-01 17:11:59,817 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-11-01 17:11:59,830 INFO  L137   encePairwiseOnDemand]: 195/215 looper letters, 71 selfloop transitions, 42 changer transitions 0/143 dead transitions.
[2023-11-01 17:11:59,830 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 143 transitions, 538 flow
[2023-11-01 17:11:59,831 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 17:11:59,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 17:11:59,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-11-01 17:11:59,833 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5961240310077519
[2023-11-01 17:11:59,833 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-11-01 17:11:59,833 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-11-01 17:11:59,833 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:11:59,833 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-11-01 17:11:59,834 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-11-01 17:11:59,835 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-11-01 17:11:59,836 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-11-01 17:11:59,836 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 769 transitions.
[2023-11-01 17:11:59,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 143 transitions, 538 flow
[2023-11-01 17:11:59,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:11:59,838 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2023-11-01 17:11:59,838 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-11-01 17:11:59,838 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2023-11-01 17:11:59,839 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2023-11-01 17:11:59,839 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-11-01 17:11:59,839 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:11:59,839 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:11:59,839 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-01 17:11:59,839 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-11-01 17:11:59,839 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:11:59,839 INFO  L85        PathProgramCache]: Analyzing trace with hash -555411616, now seen corresponding path program 1 times
[2023-11-01 17:11:59,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:11:59,840 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253534380]
[2023-11-01 17:11:59,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:11:59,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:11:59,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:11:59,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:11:59,870 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:11:59,870 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253534380]
[2023-11-01 17:11:59,870 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253534380] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:11:59,870 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:11:59,870 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 17:11:59,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752750802]
[2023-11-01 17:11:59,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:11:59,870 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-01 17:11:59,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:11:59,871 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-01 17:11:59,871 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-01 17:11:59,918 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 215
[2023-11-01 17:11:59,918 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-11-01 17:11:59,918 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:11:59,918 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 215
[2023-11-01 17:11:59,918 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:12:00,270 INFO  L130       PetriNetUnfolder]: 1575/4192 cut-off events.
[2023-11-01 17:12:00,271 INFO  L131       PetriNetUnfolder]: For 1357/1534 co-relation queries the response was YES.
[2023-11-01 17:12:00,277 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-11-01 17:12:00,287 INFO  L137   encePairwiseOnDemand]: 211/215 looper letters, 38 selfloop transitions, 3 changer transitions 3/122 dead transitions.
[2023-11-01 17:12:00,287 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 568 flow
[2023-11-01 17:12:00,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-01 17:12:00,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-01 17:12:00,288 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions.
[2023-11-01 17:12:00,288 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6267441860465116
[2023-11-01 17:12:00,288 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 539 transitions.
[2023-11-01 17:12:00,289 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions.
[2023-11-01 17:12:00,289 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:12:00,289 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions.
[2023-11-01 17:12:00,290 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-11-01 17:12:00,291 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-11-01 17:12:00,291 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-11-01 17:12:00,291 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 539 transitions.
[2023-11-01 17:12:00,291 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 568 flow
[2023-11-01 17:12:00,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 122 transitions, 568 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 17:12:00,295 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2023-11-01 17:12:00,295 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-11-01 17:12:00,296 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2023-11-01 17:12:00,296 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2023-11-01 17:12:00,296 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-11-01 17:12:00,297 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:12:00,297 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 17:12:00,297 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-01 17:12:00,297 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-11-01 17:12:00,297 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:12:00,297 INFO  L85        PathProgramCache]: Analyzing trace with hash 33476867, now seen corresponding path program 1 times
[2023-11-01 17:12:00,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:12:00,297 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586353383]
[2023-11-01 17:12:00,297 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:12:00,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:12:00,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:12:00,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:12:00,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:12:00,392 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586353383]
[2023-11-01 17:12:00,392 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586353383] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:12:00,392 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:12:00,392 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 17:12:00,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194245518]
[2023-11-01 17:12:00,392 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:12:00,392 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 17:12:00,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:12:00,393 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 17:12:00,393 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 17:12:00,660 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 215
[2023-11-01 17:12:00,661 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-11-01 17:12:00,661 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:12:00,661 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 215
[2023-11-01 17:12:00,661 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:12:01,738 INFO  L130       PetriNetUnfolder]: 6417/12066 cut-off events.
[2023-11-01 17:12:01,738 INFO  L131       PetriNetUnfolder]: For 6131/6288 co-relation queries the response was YES.
[2023-11-01 17:12:01,755 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-11-01 17:12:01,788 INFO  L137   encePairwiseOnDemand]: 188/215 looper letters, 118 selfloop transitions, 104 changer transitions 1/254 dead transitions.
[2023-11-01 17:12:01,789 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 254 transitions, 1510 flow
[2023-11-01 17:12:01,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 17:12:01,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 17:12:01,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions.
[2023-11-01 17:12:01,790 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821705426356589
[2023-11-01 17:12:01,790 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 751 transitions.
[2023-11-01 17:12:01,790 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions.
[2023-11-01 17:12:01,791 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:12:01,791 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions.
[2023-11-01 17:12:01,792 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-11-01 17:12:01,793 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-11-01 17:12:01,794 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-11-01 17:12:01,794 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 751 transitions.
[2023-11-01 17:12:01,794 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 254 transitions, 1510 flow
[2023-11-01 17:12:01,802 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 254 transitions, 1507 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 17:12:01,804 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2023-11-01 17:12:01,805 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-11-01 17:12:01,805 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2023-11-01 17:12:01,805 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2023-11-01 17:12:01,806 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-11-01 17:12:01,806 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:12:01,806 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-11-01 17:12:01,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-01 17:12:01,806 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-11-01 17:12:01,807 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:12:01,807 INFO  L85        PathProgramCache]: Analyzing trace with hash 163438136, now seen corresponding path program 1 times
[2023-11-01 17:12:01,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:12:01,807 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47578641]
[2023-11-01 17:12:01,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:12:01,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:12:01,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:12:02,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:12:02,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:12:02,032 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47578641]
[2023-11-01 17:12:02,032 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47578641] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:12:02,032 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:12:02,033 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 17:12:02,033 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252433039]
[2023-11-01 17:12:02,033 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:12:02,033 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 17:12:02,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:12:02,034 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 17:12:02,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 17:12:02,142 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 215
[2023-11-01 17:12:02,143 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-11-01 17:12:02,143 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:12:02,143 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 215
[2023-11-01 17:12:02,143 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:12:04,219 INFO  L130       PetriNetUnfolder]: 11069/19135 cut-off events.
[2023-11-01 17:12:04,219 INFO  L131       PetriNetUnfolder]: For 23646/23867 co-relation queries the response was YES.
[2023-11-01 17:12:04,253 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-11-01 17:12:04,312 INFO  L137   encePairwiseOnDemand]: 181/215 looper letters, 246 selfloop transitions, 178 changer transitions 0/441 dead transitions.
[2023-11-01 17:12:04,313 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 441 transitions, 3416 flow
[2023-11-01 17:12:04,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 17:12:04,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 17:12:04,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions.
[2023-11-01 17:12:04,314 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6201550387596899
[2023-11-01 17:12:04,314 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 800 transitions.
[2023-11-01 17:12:04,314 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions.
[2023-11-01 17:12:04,315 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:12:04,315 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions.
[2023-11-01 17:12:04,316 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-11-01 17:12:04,317 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-11-01 17:12:04,317 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-11-01 17:12:04,317 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 800 transitions.
[2023-11-01 17:12:04,317 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 441 transitions, 3416 flow
[2023-11-01 17:12:04,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 441 transitions, 3406 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-11-01 17:12:04,345 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2023-11-01 17:12:04,345 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-11-01 17:12:04,345 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2023-11-01 17:12:04,345 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2023-11-01 17:12:04,346 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-11-01 17:12:04,346 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:12:04,346 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-11-01 17:12:04,346 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-01 17:12:04,346 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-11-01 17:12:04,346 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:12:04,346 INFO  L85        PathProgramCache]: Analyzing trace with hash -1795788423, now seen corresponding path program 1 times
[2023-11-01 17:12:04,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:12:04,346 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295257144]
[2023-11-01 17:12:04,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:12:04,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:12:04,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:12:04,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:12:04,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:12:04,657 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295257144]
[2023-11-01 17:12:04,657 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295257144] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:12:04,657 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291155748]
[2023-11-01 17:12:04,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:12:04,657 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:12:04,657 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:12:04,659 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:12:04,661 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-11-01 17:12:04,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:12:04,807 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-11-01 17:12:04,821 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:12:04,861 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-11-01 17:12:04,864 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-11-01 17:12:05,058 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:12:05,092 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:05,093 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 17:12:05,130 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:05,132 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:05,133 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 17:12:05,186 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:05,187 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:05,188 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:05,190 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 17:12:05,243 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:05,244 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:12:05,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:12:05,277 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:12:05,297 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1098 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1098 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1098 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1098 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |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-11-01 17:12:05,314 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-11-01 17:12:05,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 17:12:05,541 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291155748] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:12:05,541 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:12:05,541 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28
[2023-11-01 17:12:05,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278595149]
[2023-11-01 17:12:05,541 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:12:05,542 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2023-11-01 17:12:05,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:12:05,542 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2023-11-01 17:12:05,543 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=642, Unknown=2, NotChecked=106, Total=870
[2023-11-01 17:12:05,704 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 215
[2023-11-01 17:12:05,705 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 30 states, 30 states have (on average 56.4) internal successors, (1692), 30 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:12:05,705 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:12:05,705 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 215
[2023-11-01 17:12:05,705 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:12:16,174 INFO  L130       PetriNetUnfolder]: 25432/41639 cut-off events.
[2023-11-01 17:12:16,175 INFO  L131       PetriNetUnfolder]: For 82363/82369 co-relation queries the response was YES.
[2023-11-01 17:12:16,276 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 170511 conditions, 41639 events. 25432/41639 cut-off events. For 82363/82369 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 306135 event pairs, 4491 based on Foata normal form. 6/37544 useless extension candidates. Maximal degree in co-relation 112777. Up to 16382 conditions per place. 
[2023-11-01 17:12:16,422 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 983 selfloop transitions, 951 changer transitions 1/1938 dead transitions.
[2023-11-01 17:12:16,422 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 1938 transitions, 18358 flow
[2023-11-01 17:12:16,423 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2023-11-01 17:12:16,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2023-11-01 17:12:16,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2854 transitions.
[2023-11-01 17:12:16,426 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3403697078115683
[2023-11-01 17:12:16,426 INFO  L72            ComplementDD]: Start complementDD. Operand 39 states and 2854 transitions.
[2023-11-01 17:12:16,426 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 39 states and 2854 transitions.
[2023-11-01 17:12:16,427 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:12:16,427 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2854 transitions.
[2023-11-01 17:12:16,430 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 40 states, 39 states have (on average 73.17948717948718) internal successors, (2854), 39 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:12:16,436 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 40 states, 40 states have (on average 215.0) internal successors, (8600), 40 states have internal predecessors, (8600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:12:16,436 INFO  L81            ComplementDD]: Finished complementDD. Result  has 40 states, 40 states have (on average 215.0) internal successors, (8600), 40 states have internal predecessors, (8600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:12:16,436 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 39 states and 2854 transitions.
[2023-11-01 17:12:16,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 1938 transitions, 18358 flow
[2023-11-01 17:12:17,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 1938 transitions, 18136 flow, removed 111 selfloop flow, removed 0 redundant places.
[2023-11-01 17:12:17,541 INFO  L231             Difference]: Finished difference. Result has 159 places, 1349 transitions, 14914 flow
[2023-11-01 17:12:17,541 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=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=14914, PETRI_PLACES=159, PETRI_TRANSITIONS=1349}
[2023-11-01 17:12:17,541 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 88 predicate places.
[2023-11-01 17:12:17,542 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 1349 transitions, 14914 flow
[2023-11-01 17:12:17,542 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 56.4) internal successors, (1692), 30 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:12:17,542 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:12:17,542 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-11-01 17:12:17,550 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-11-01 17:12:17,743 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-11-01 17:12:17,744 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-11-01 17:12:17,744 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:12:17,744 INFO  L85        PathProgramCache]: Analyzing trace with hash 405194917, now seen corresponding path program 1 times
[2023-11-01 17:12:17,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:12:17,745 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780610631]
[2023-11-01 17:12:17,745 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:12:17,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:12:17,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:12:18,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:12:18,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:12:18,028 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780610631]
[2023-11-01 17:12:18,028 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780610631] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:12:18,029 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51182555]
[2023-11-01 17:12:18,029 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:12:18,029 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:12:18,029 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:12:18,031 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:12:18,033 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-11-01 17:12:18,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:12:18,167 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-01 17:12:18,170 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:12:18,199 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-11-01 17:12:18,315 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:12:18,346 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:18,347 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 17:12:18,385 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:18,386 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:18,387 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 17:12:18,432 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:18,433 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:18,434 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:18,436 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 17:12:18,480 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:18,481 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:12:18,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:12:18,512 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:12:18,538 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-11-01 17:12:18,658 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-11-01 17:12:18,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 17:12:18,769 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [51182555] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:12:18,769 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:12:18,769 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-11-01 17:12:18,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533692369]
[2023-11-01 17:12:18,769 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:12:18,770 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-11-01 17:12:18,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:12:18,770 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-11-01 17:12:18,770 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=493, Unknown=7, NotChecked=94, Total=702
[2023-11-01 17:12:18,895 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 215
[2023-11-01 17:12:18,896 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 1349 transitions, 14914 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-11-01 17:12:18,896 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:12:18,896 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 215
[2023-11-01 17:12:18,896 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:12:30,532 INFO  L130       PetriNetUnfolder]: 28874/47604 cut-off events.
[2023-11-01 17:12:30,532 INFO  L131       PetriNetUnfolder]: For 214942/214942 co-relation queries the response was YES.
[2023-11-01 17:12:30,779 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 264652 conditions, 47604 events. 28874/47604 cut-off events. For 214942/214942 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 360053 event pairs, 4009 based on Foata normal form. 357/43597 useless extension candidates. Maximal degree in co-relation 246321. Up to 26720 conditions per place. 
[2023-11-01 17:12:31,003 INFO  L137   encePairwiseOnDemand]: 185/215 looper letters, 1486 selfloop transitions, 1045 changer transitions 0/2534 dead transitions.
[2023-11-01 17:12:31,003 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 2534 transitions, 31759 flow
[2023-11-01 17:12:31,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-11-01 17:12:31,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-11-01 17:12:31,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions.
[2023-11-01 17:12:31,006 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.40174418604651163
[2023-11-01 17:12:31,006 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1382 transitions.
[2023-11-01 17:12:31,006 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1382 transitions.
[2023-11-01 17:12:31,006 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:12:31,006 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1382 transitions.
[2023-11-01 17:12:31,008 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-11-01 17:12:31,011 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-11-01 17:12:31,011 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-11-01 17:12:31,011 INFO  L175             Difference]: Start difference. First operand has 159 places, 1349 transitions, 14914 flow. Second operand 16 states and 1382 transitions.
[2023-11-01 17:12:31,011 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 2534 transitions, 31759 flow
[2023-11-01 17:12:36,403 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 2534 transitions, 31292 flow, removed 228 selfloop flow, removed 2 redundant places.
[2023-11-01 17:12:36,433 INFO  L231             Difference]: Finished difference. Result has 179 places, 1899 transitions, 25096 flow
[2023-11-01 17:12:36,434 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=14736, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=588, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=25096, PETRI_PLACES=179, PETRI_TRANSITIONS=1899}
[2023-11-01 17:12:36,435 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 108 predicate places.
[2023-11-01 17:12:36,435 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 1899 transitions, 25096 flow
[2023-11-01 17:12:36,435 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-11-01 17:12:36,435 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:12:36,435 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-11-01 17:12:36,442 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2023-11-01 17:12:36,636 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-11-01 17:12:36,637 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 17:12:36,638 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:12:36,638 INFO  L85        PathProgramCache]: Analyzing trace with hash 1404171368, now seen corresponding path program 1 times
[2023-11-01 17:12:36,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:12:36,638 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614056008]
[2023-11-01 17:12:36,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:12:36,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:12:36,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:12:36,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:12:36,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:12:36,900 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614056008]
[2023-11-01 17:12:36,900 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614056008] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:12:36,900 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881447166]
[2023-11-01 17:12:36,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:12:36,901 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:12:36,901 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:12:36,902 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 17:12:36,904 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-01 17:12:37,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:12:37,030 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-01 17:12:37,034 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:12:37,068 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-11-01 17:12:37,153 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:12:37,178 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:37,180 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 17:12:37,217 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:37,218 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:37,219 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 17:12:37,261 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:37,261 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:37,262 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:37,265 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 17:12:37,354 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:12:37,355 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:12:37,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:12:37,386 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:12:37,405 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2023-11-01 17:12:37,448 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_37 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_37) (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_37 v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_37 v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_37))) (forall ((v_threadThread1of2ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_37 v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_37))) (forall ((v_threadThread1of2ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_37 v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_37)))) is different from false
[2023-11-01 17:12:37,755 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_threadThread1of2ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_37 v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_37))) (forall ((v_threadThread1of2ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_37 v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_37))) (forall ((v_threadThread1of2ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_37 v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_37)))))) is different from false
[2023-11-01 17:12:37,782 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_37 v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_37))) (forall ((v_threadThread1of2ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_37 v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_37))) (forall ((v_threadThread1of2ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_1324 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_37 v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_37)))))) is different from false
[2023-11-01 17:12:37,805 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:12:37,806 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-11-01 17:12:37,814 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:12:37,814 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2023-11-01 17:12:37,819 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2023-11-01 17:12:37,827 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:12:37,828 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 1
[2023-11-01 17:12:37,836 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:12:37,836 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 1
[2023-11-01 17:12:37,906 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:12:37,906 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881447166] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:12:37,906 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:12:37,906 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-11-01 17:12:37,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467453791]
[2023-11-01 17:12:37,907 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:12:37,907 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-11-01 17:12:37,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:12:37,907 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-11-01 17:12:37,908 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=488, Unknown=9, NotChecked=196, Total=812
[2023-11-01 17:12:38,086 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 215
[2023-11-01 17:12:38,088 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 1899 transitions, 25096 flow. Second operand  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:12:38,088 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:12:38,088 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 215
[2023-11-01 17:12:38,088 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:12:56,552 INFO  L130       PetriNetUnfolder]: 35877/59893 cut-off events.
[2023-11-01 17:12:56,552 INFO  L131       PetriNetUnfolder]: For 353050/353056 co-relation queries the response was YES.
[2023-11-01 17:12:56,911 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 369759 conditions, 59893 events. 35877/59893 cut-off events. For 353050/353056 co-relation queries the response was YES. Maximal size of possible extension queue 1634. Compared 475889 event pairs, 4604 based on Foata normal form. 339/54624 useless extension candidates. Maximal degree in co-relation 316150. Up to 31230 conditions per place. 
[2023-11-01 17:12:57,172 INFO  L137   encePairwiseOnDemand]: 182/215 looper letters, 1802 selfloop transitions, 1314 changer transitions 0/3119 dead transitions.
[2023-11-01 17:12:57,172 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 3119 transitions, 46899 flow
[2023-11-01 17:12:57,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-11-01 17:12:57,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2023-11-01 17:12:57,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1157 transitions.
[2023-11-01 17:12:57,174 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38438538205980066
[2023-11-01 17:12:57,174 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1157 transitions.
[2023-11-01 17:12:57,174 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1157 transitions.
[2023-11-01 17:12:57,174 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:12:57,174 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1157 transitions.
[2023-11-01 17:12:57,176 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 82.64285714285714) internal successors, (1157), 14 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:12:57,178 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 215.0) internal successors, (3225), 15 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:12:57,178 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 215.0) internal successors, (3225), 15 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:12:57,178 INFO  L175             Difference]: Start difference. First operand has 179 places, 1899 transitions, 25096 flow. Second operand 14 states and 1157 transitions.
[2023-11-01 17:12:57,178 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 3119 transitions, 46899 flow
[2023-11-01 17:13:05,932 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 3119 transitions, 46619 flow, removed 85 selfloop flow, removed 5 redundant places.
[2023-11-01 17:13:05,972 INFO  L231             Difference]: Finished difference. Result has 194 places, 2691 transitions, 42773 flow
[2023-11-01 17:13:05,973 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=24858, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=522, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=42773, PETRI_PLACES=194, PETRI_TRANSITIONS=2691}
[2023-11-01 17:13:05,974 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 123 predicate places.
[2023-11-01 17:13:05,974 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 2691 transitions, 42773 flow
[2023-11-01 17:13:05,974 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:13:05,974 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:13:05,974 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-11-01 17:13:05,980 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-11-01 17:13:06,175 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-11-01 17:13:06,176 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-11-01 17:13:06,177 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:13:06,177 INFO  L85        PathProgramCache]: Analyzing trace with hash 534607197, now seen corresponding path program 1 times
[2023-11-01 17:13:06,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:13:06,178 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447986245]
[2023-11-01 17:13:06,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:13:06,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:13:06,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:13:06,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:13:06,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:13:06,440 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447986245]
[2023-11-01 17:13:06,440 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447986245] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:13:06,440 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105950896]
[2023-11-01 17:13:06,440 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:13:06,440 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:13:06,441 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:13:06,442 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-11-01 17:13:06,445 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-11-01 17:13:06,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:13:06,593 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 36 conjunts are in the unsatisfiable core
[2023-11-01 17:13:06,597 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:13:06,633 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-11-01 17:13:06,637 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-11-01 17:13:06,769 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:13:06,802 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:13:06,803 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 17:13:06,833 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:13:06,834 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:13:06,835 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 17:13:06,873 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:13:06,874 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:13:06,875 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:13:06,876 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 17:13:06,950 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:13:06,950 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:13:06,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:13:06,987 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:13:07,011 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1437 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1437 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1437 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2023-11-01 17:13:07,158 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_1437 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1437 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1437 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1437 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-11-01 17:13:07,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 17:13:07,270 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105950896] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:13:07,270 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:13:07,270 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-11-01 17:13:07,271 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845927681]
[2023-11-01 17:13:07,271 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:13:07,271 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-11-01 17:13:07,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:13:07,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-11-01 17:13:07,272 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=495, Unknown=7, NotChecked=94, Total=702
[2023-11-01 17:13:07,345 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 215
[2023-11-01 17:13:07,346 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 2691 transitions, 42773 flow. Second operand  has 27 states, 27 states have (on average 59.74074074074074) internal successors, (1613), 27 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:13:07,346 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:13:07,346 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 215
[2023-11-01 17:13:07,346 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:13:40,188 INFO  L130       PetriNetUnfolder]: 43016/71664 cut-off events.
[2023-11-01 17:13:40,188 INFO  L131       PetriNetUnfolder]: For 573974/573984 co-relation queries the response was YES.
[2023-11-01 17:13:40,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 478421 conditions, 71664 events. 43016/71664 cut-off events. For 573974/573984 co-relation queries the response was YES. Maximal size of possible extension queue 1918. Compared 584249 event pairs, 7295 based on Foata normal form. 10/65578 useless extension candidates. Maximal degree in co-relation 430463. Up to 48983 conditions per place. 
[2023-11-01 17:13:41,106 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 2243 selfloop transitions, 1480 changer transitions 1/3727 dead transitions.
[2023-11-01 17:13:41,106 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 3727 transitions, 61987 flow
[2023-11-01 17:13:41,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-11-01 17:13:41,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-11-01 17:13:41,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1645 transitions.
[2023-11-01 17:13:41,108 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3825581395348837
[2023-11-01 17:13:41,109 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1645 transitions.
[2023-11-01 17:13:41,109 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1645 transitions.
[2023-11-01 17:13:41,109 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:13:41,109 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1645 transitions.
[2023-11-01 17:13:41,111 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 82.25) internal successors, (1645), 20 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:13:41,114 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-11-01 17:13:41,114 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-11-01 17:13:41,114 INFO  L175             Difference]: Start difference. First operand has 194 places, 2691 transitions, 42773 flow. Second operand 20 states and 1645 transitions.
[2023-11-01 17:13:41,114 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 3727 transitions, 61987 flow
[2023-11-01 17:13:57,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 3727 transitions, 61823 flow, removed 0 selfloop flow, removed 6 redundant places.
[2023-11-01 17:13:57,477 INFO  L231             Difference]: Finished difference. Result has 213 places, 3372 transitions, 56709 flow
[2023-11-01 17:13:57,478 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=42661, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=884, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=56709, PETRI_PLACES=213, PETRI_TRANSITIONS=3372}
[2023-11-01 17:13:57,479 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 142 predicate places.
[2023-11-01 17:13:57,479 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 3372 transitions, 56709 flow
[2023-11-01 17:13:57,479 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 59.74074074074074) internal successors, (1613), 27 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:13:57,479 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:13:57,479 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-11-01 17:13:57,488 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-11-01 17:13:57,680 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-11-01 17:13:57,681 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 17:13:57,681 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:13:57,682 INFO  L85        PathProgramCache]: Analyzing trace with hash -1139698224, now seen corresponding path program 1 times
[2023-11-01 17:13:57,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:13:57,682 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121299186]
[2023-11-01 17:13:57,682 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:13:57,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:13:57,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:13:57,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 17:13:57,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:13:57,844 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121299186]
[2023-11-01 17:13:57,844 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121299186] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 17:13:57,844 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 17:13:57,844 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 17:13:57,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036149091]
[2023-11-01 17:13:57,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 17:13:57,844 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 17:13:57,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:13:57,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 17:13:57,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 17:13:58,171 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 215
[2023-11-01 17:13:58,172 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 3372 transitions, 56709 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-11-01 17:13:58,172 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:13:58,172 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 215
[2023-11-01 17:13:58,172 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:14:15,113 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([583] L1033-5-->ULTIMATE.startEXIT: Formula: (let ((.cse0 (select |v_#race_217| |v_ULTIMATE.start_main_~#ts~0#1.base_103|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#ts~0#1.offset_93| 2)) 0) (= |v_#valid_184| (store (store (store |v_#valid_185| |v_ULTIMATE.start_main_#t~mem17#1.base_50| 0) |v_ULTIMATE.start_main_~#tids~0#1.base_130| 0) |v_ULTIMATE.start_main_~#ts~0#1.base_103| 0)) (= |v_ULTIMATE.start_main_#res#1_42| |v_ULTIMATE.start_#t~ret18#1_14|) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#ts~0#1.offset_93| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#ts~0#1.offset_93| 1)) 0) (= |v_ULTIMATE.start_main_#res#1_42| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#ts~0#1.offset_93|) 0)))  InVars {#race=|v_#race_217|, ULTIMATE.start_main_~#ts~0#1.base=|v_ULTIMATE.start_main_~#ts~0#1.base_103|, ULTIMATE.start_main_~#ts~0#1.offset=|v_ULTIMATE.start_main_~#ts~0#1.offset_93|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_50|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_130|, #valid=|v_#valid_185|}  OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_115|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_37|, #race=|v_#race_217|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, #valid=|v_#valid_184|, ULTIMATE.start_#t~ret18#1=|v_ULTIMATE.start_#t~ret18#1_14|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_~#ts~0#1.base, ULTIMATE.start_main_~#ts~0#1.offset, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#tids~0#1.base, #valid, ULTIMATE.start_#t~ret18#1][1847], [Black: 633#(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: 645#(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: 637#(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)), 47#threadEXITtrue, Black: 629#(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)), threadThread1of2ForFork0InUse, 186#true, Black: 639#(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)), threadThread2of2ForFork0InUse, Black: 641#(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: 643#(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: 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: 1055#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 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: 1053#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_1437 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))), Black: 1063#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1437 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) 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~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_1437 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))), 861#true, Black: 408#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 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)), Black: 1059#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |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~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 1065#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |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~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 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|)), Black: 1049#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 406#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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)))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 424#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 397#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~#ts~0#1.base|)) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 1073#true, Black: 361#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0) (= |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: 399#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 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|) (= |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: 385#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~#ts~0#1.base|)) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|))), Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 387#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~#ts~0#1.base|)) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 422#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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: 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: 410#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))), 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: 427#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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) (+ 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: 420#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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: 389#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))), Black: 413#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 280#(and (= threadThread1of2ForFork0_~t~0.offset 0) (= |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: 377#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~#ts~0#1.base|)) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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: 379#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 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|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 401#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))), 2#L1018-2true, Black: 844#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 741#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 729#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 737#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 834#(and (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |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_~#tids~0#1.base|)), Black: 733#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 713#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), 3#ULTIMATE.startEXITtrue])
[2023-11-01 17:14:15,114 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-11-01 17:14:15,114 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 17:14:15,114 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 17:14:15,114 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 17:14:15,115 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][641], [Black: 633#(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: 645#(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)), 47#threadEXITtrue, Black: 629#(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)), threadThread1of2ForFork0InUse, Black: 639#(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)), threadThread2of2ForFork0InUse, Black: 641#(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: 643#(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: 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: 1055#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 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: 1053#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_1437 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))), Black: 1063#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1437 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) 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~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_1437 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1437) threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))), Black: 408#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 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)), Black: 1059#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |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~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 1065#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |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~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ 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|)), Black: 1049#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 406#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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)))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 424#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 397#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~#ts~0#1.base|)) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 1073#true, Black: 361#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0) (= |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: 399#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 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|) (= |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: 385#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~#ts~0#1.base|)) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|))), 637#(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: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 387#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~#ts~0#1.base|)) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 422#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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: 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: 410#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))), 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: 427#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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) (+ 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: 420#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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: 389#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))), Black: 413#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |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) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 280#(and (= threadThread1of2ForFork0_~t~0.offset 0) (= |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: 377#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~#ts~0#1.base|)) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< (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: 379#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 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|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 713#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 401#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 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))), 114#L1018-4true, 418#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (or (< |ULTIMATE.start_main_~threads_total~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~#ts~0#1.base|)) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 844#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 741#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 729#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 737#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (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) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 834#(and (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |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_~#tids~0#1.base|)), Black: 733#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), 1045#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~t~0.offset 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), 115#L1033-5true])
[2023-11-01 17:14:15,116 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-11-01 17:14:15,116 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 17:14:15,116 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 17:14:15,116 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 17:14:23,478 INFO  L130       PetriNetUnfolder]: 37418/65655 cut-off events.
[2023-11-01 17:14:23,478 INFO  L131       PetriNetUnfolder]: For 857195/871736 co-relation queries the response was YES.
[2023-11-01 17:14:24,071 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 502606 conditions, 65655 events. 37418/65655 cut-off events. For 857195/871736 co-relation queries the response was YES. Maximal size of possible extension queue 2054. Compared 576102 event pairs, 5815 based on Foata normal form. 1579/65498 useless extension candidates. Maximal degree in co-relation 445334. Up to 42190 conditions per place. 
[2023-11-01 17:14:24,493 INFO  L137   encePairwiseOnDemand]: 200/215 looper letters, 2882 selfloop transitions, 311 changer transitions 0/3707 dead transitions.
[2023-11-01 17:14:24,494 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 3707 transitions, 68619 flow
[2023-11-01 17:14:24,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 17:14:24,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 17:14:24,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-11-01 17:14:24,496 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5961240310077519
[2023-11-01 17:14:24,496 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-11-01 17:14:24,496 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-11-01 17:14:24,496 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:14:24,496 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-11-01 17:14:24,497 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-11-01 17:14:24,498 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-11-01 17:14:24,498 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-11-01 17:14:24,498 INFO  L175             Difference]: Start difference. First operand has 213 places, 3372 transitions, 56709 flow. Second operand 6 states and 769 transitions.
[2023-11-01 17:14:24,498 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 3707 transitions, 68619 flow
[2023-11-01 17:14:45,468 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 3707 transitions, 67426 flow, removed 516 selfloop flow, removed 9 redundant places.
[2023-11-01 17:14:45,527 INFO  L231             Difference]: Finished difference. Result has 214 places, 3659 transitions, 61960 flow
[2023-11-01 17:14:45,529 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=55516, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=61960, PETRI_PLACES=214, PETRI_TRANSITIONS=3659}
[2023-11-01 17:14:45,530 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 143 predicate places.
[2023-11-01 17:14:45,530 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 3659 transitions, 61960 flow
[2023-11-01 17:14:45,530 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-11-01 17:14:45,530 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:14:45,531 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-11-01 17:14:45,531 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-01 17:14:45,531 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 17:14:45,531 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:14:45,531 INFO  L85        PathProgramCache]: Analyzing trace with hash 923267466, now seen corresponding path program 2 times
[2023-11-01 17:14:45,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:14:45,532 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879196173]
[2023-11-01 17:14:45,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:14:45,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:14:45,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:14:46,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:14:46,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:14:46,016 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879196173]
[2023-11-01 17:14:46,016 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879196173] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:14:46,016 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131505776]
[2023-11-01 17:14:46,016 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 17:14:46,016 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:14:46,017 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:14:46,018 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-11-01 17:14:46,020 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-11-01 17:14:46,196 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 17:14:46,196 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 17:14:46,198 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-11-01 17:14:46,202 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:14:46,230 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-11-01 17:14:46,343 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:14:46,375 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-11-01 17:14:46,419 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:14:46,419 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-11-01 17:14:46,472 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:14:46,472 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-11-01 17:14:46,521 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:14:46,522 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:14:46,543 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:14:46,543 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:14:46,563 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:14:46,563 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:14:46,581 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:14:46,581 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:14:46,645 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:14:46,646 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:14:46,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:14:46,675 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:14:46,701 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1622 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-01 17:14:46,741 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-01 17:14:46,952 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_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-11-01 17:14:46,974 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ 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|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1622) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2023-11-01 17:14:46,994 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:14:46,994 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-11-01 17:14:47,001 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:14:47,001 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 192 treesize of output 122
[2023-11-01 17:14:47,007 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 51 treesize of output 43
[2023-11-01 17:14:47,010 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 94 treesize of output 78
[2023-11-01 17:14:47,034 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:14:47,034 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-11-01 17:14:47,040 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:14:47,041 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-11-01 17:14:47,048 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:14:47,048 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-11-01 17:14:47,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked.
[2023-11-01 17:14:47,188 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131505776] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:14:47,188 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:14:47,188 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28
[2023-11-01 17:14:47,189 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426445657]
[2023-11-01 17:14:47,189 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:14:47,189 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2023-11-01 17:14:47,189 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:14:47,190 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2023-11-01 17:14:47,190 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=537, Unknown=14, NotChecked=204, Total=870
[2023-11-01 17:14:47,415 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 215
[2023-11-01 17:14:47,417 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 3659 transitions, 61960 flow. Second operand  has 30 states, 30 states have (on average 65.03333333333333) internal successors, (1951), 30 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:14:47,417 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:14:47,418 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 215
[2023-11-01 17:14:47,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:15:37,382 INFO  L130       PetriNetUnfolder]: 46946/78232 cut-off events.
[2023-11-01 17:15:37,382 INFO  L131       PetriNetUnfolder]: For 937946/937952 co-relation queries the response was YES.
[2023-11-01 17:15:38,141 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 628222 conditions, 78232 events. 46946/78232 cut-off events. For 937946/937952 co-relation queries the response was YES. Maximal size of possible extension queue 2229. Compared 647116 event pairs, 4655 based on Foata normal form. 6/73067 useless extension candidates. Maximal degree in co-relation 586307. Up to 42778 conditions per place. 
[2023-11-01 17:15:38,558 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 1684 selfloop transitions, 3360 changer transitions 1/5049 dead transitions.
[2023-11-01 17:15:38,558 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 5049 transitions, 92157 flow
[2023-11-01 17:15:38,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-11-01 17:15:38,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-11-01 17:15:38,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1746 transitions.
[2023-11-01 17:15:38,561 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.406046511627907
[2023-11-01 17:15:38,561 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1746 transitions.
[2023-11-01 17:15:38,561 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1746 transitions.
[2023-11-01 17:15:38,562 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:15:38,562 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1746 transitions.
[2023-11-01 17:15:38,564 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 87.3) internal successors, (1746), 20 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:15:38,567 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-11-01 17:15:38,567 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-11-01 17:15:38,567 INFO  L175             Difference]: Start difference. First operand has 214 places, 3659 transitions, 61960 flow. Second operand 20 states and 1746 transitions.
[2023-11-01 17:15:38,567 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 5049 transitions, 92157 flow
[2023-11-01 17:16:20,307 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 5049 transitions, 91727 flow, removed 215 selfloop flow, removed 0 redundant places.
[2023-11-01 17:16:20,379 INFO  L231             Difference]: Finished difference. Result has 240 places, 4563 transitions, 88017 flow
[2023-11-01 17:16:20,381 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=61536, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2592, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=88017, PETRI_PLACES=240, PETRI_TRANSITIONS=4563}
[2023-11-01 17:16:20,381 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 169 predicate places.
[2023-11-01 17:16:20,381 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 4563 transitions, 88017 flow
[2023-11-01 17:16:20,382 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 65.03333333333333) internal successors, (1951), 30 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:16:20,382 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:16:20,382 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-11-01 17:16:20,390 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2023-11-01 17:16:20,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:16:20,584 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-11-01 17:16:20,584 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:16:20,585 INFO  L85        PathProgramCache]: Analyzing trace with hash 331194381, now seen corresponding path program 1 times
[2023-11-01 17:16:20,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:16:20,585 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463512868]
[2023-11-01 17:16:20,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:16:20,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:16:20,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:16:21,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:16:21,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:16:21,565 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463512868]
[2023-11-01 17:16:21,565 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463512868] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:16:21,565 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410191539]
[2023-11-01 17:16:21,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:16:21,565 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:16:21,566 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:16:21,567 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-11-01 17:16:21,569 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-11-01 17:16:21,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:16:21,735 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjunts are in the unsatisfiable core
[2023-11-01 17:16:21,739 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:16:21,747 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 70 treesize of output 64
[2023-11-01 17:16:22,087 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-11-01 17:16:22,087 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 47 treesize of output 51
[2023-11-01 17:16:22,099 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 16 treesize of output 12
[2023-11-01 17:16:22,175 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-01 17:16:22,233 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-11-01 17:16:22,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 17:16:22,322 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:16:22,322 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-11-01 17:16:22,409 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:16:22,410 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-11-01 17:16:22,480 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:16:22,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:16:22,491 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:16:22,860 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_1755 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1755) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1755 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1755) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1755 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1755) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1755 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1755) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-11-01 17:16:22,881 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ 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 (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1755 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1755) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1755 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1755) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1755 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1755) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1755 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1755) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2023-11-01 17:16:22,897 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:16:22,898 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-11-01 17:16:22,902 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:16:22,902 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 76 treesize of output 32
[2023-11-01 17:16:22,910 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:16:22,910 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-01 17:16:22,915 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:16:22,915 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-01 17:16:22,920 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:16:22,920 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-11-01 17:16:22,994 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1746) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-11-01 17:16:23,009 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (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_1746) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-11-01 17:16:23,028 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array Int Int))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) (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_1746) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-11-01 17:16:23,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 17:16:23,031 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410191539] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:16:23,031 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:16:23,031 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 35
[2023-11-01 17:16:23,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438253183]
[2023-11-01 17:16:23,032 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:16:23,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2023-11-01 17:16:23,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:16:23,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2023-11-01 17:16:23,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=845, Unknown=30, NotChecked=320, Total=1332
[2023-11-01 17:16:23,522 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 215
[2023-11-01 17:16:23,524 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 4563 transitions, 88017 flow. Second operand  has 37 states, 37 states have (on average 51.37837837837838) internal successors, (1901), 37 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:16:23,524 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:16:23,524 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 215
[2023-11-01 17:16:23,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:17:22,668 INFO  L130       PetriNetUnfolder]: 48569/80686 cut-off events.
[2023-11-01 17:17:22,668 INFO  L131       PetriNetUnfolder]: For 1390408/1390408 co-relation queries the response was YES.
[2023-11-01 17:17:23,548 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 750266 conditions, 80686 events. 48569/80686 cut-off events. For 1390408/1390408 co-relation queries the response was YES. Maximal size of possible extension queue 2235. Compared 662956 event pairs, 10505 based on Foata normal form. 11/77021 useless extension candidates. Maximal degree in co-relation 703258. Up to 79437 conditions per place. 
[2023-11-01 17:17:24,005 INFO  L137   encePairwiseOnDemand]: 185/215 looper letters, 4730 selfloop transitions, 103 changer transitions 35/4869 dead transitions.
[2023-11-01 17:17:24,005 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 4869 transitions, 101849 flow
[2023-11-01 17:17:24,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-01 17:17:24,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-01 17:17:24,007 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1164 transitions.
[2023-11-01 17:17:24,008 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.28494492044063646
[2023-11-01 17:17:24,008 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1164 transitions.
[2023-11-01 17:17:24,008 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1164 transitions.
[2023-11-01 17:17:24,008 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:17:24,008 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1164 transitions.
[2023-11-01 17:17:24,009 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 61.26315789473684) internal successors, (1164), 19 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:17:24,012 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-11-01 17:17:24,012 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-11-01 17:17:24,012 INFO  L175             Difference]: Start difference. First operand has 240 places, 4563 transitions, 88017 flow. Second operand 19 states and 1164 transitions.
[2023-11-01 17:17:24,012 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 4869 transitions, 101849 flow
[2023-11-01 17:18:38,006 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 4869 transitions, 100644 flow, removed 578 selfloop flow, removed 10 redundant places.
[2023-11-01 17:18:38,087 INFO  L231             Difference]: Finished difference. Result has 259 places, 4658 transitions, 88973 flow
[2023-11-01 17:18:38,090 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=86826, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=88973, PETRI_PLACES=259, PETRI_TRANSITIONS=4658}
[2023-11-01 17:18:38,091 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 188 predicate places.
[2023-11-01 17:18:38,091 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 4658 transitions, 88973 flow
[2023-11-01 17:18:38,091 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 51.37837837837838) internal successors, (1901), 37 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:18:38,091 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:18:38,091 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-11-01 17:18:38,100 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2023-11-01 17:18:38,292 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-11-01 17:18:38,293 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-11-01 17:18:38,293 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:18:38,294 INFO  L85        PathProgramCache]: Analyzing trace with hash 287422669, now seen corresponding path program 2 times
[2023-11-01 17:18:38,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:18:38,295 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183548574]
[2023-11-01 17:18:38,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:18:38,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:18:38,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:18:38,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:18:38,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:18:38,794 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183548574]
[2023-11-01 17:18:38,795 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183548574] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:18:38,795 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734951]
[2023-11-01 17:18:38,795 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 17:18:38,795 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:18:38,795 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:18:38,796 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-11-01 17:18:38,798 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-11-01 17:18:38,989 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 17:18:38,989 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 17:18:38,992 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 63 conjunts are in the unsatisfiable core
[2023-11-01 17:18:38,997 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:18:39,025 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:39,029 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:39,033 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-11-01 17:18:39,689 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 17:18:39,690 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 76 treesize of output 70
[2023-11-01 17:18:39,699 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:39,701 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:39,704 INFO  L321             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2023-11-01 17:18:39,705 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 35
[2023-11-01 17:18:39,955 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 17:18:39,955 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 62 treesize of output 57
[2023-11-01 17:18:39,968 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:39,970 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:39,975 INFO  L321             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2023-11-01 17:18:39,975 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 28 treesize of output 31
[2023-11-01 17:18:40,091 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-11-01 17:18:40,092 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-11-01 17:18:40,105 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-11-01 17:18:40,105 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 22 treesize of output 10
[2023-11-01 17:18:40,164 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-11-01 17:18:40,210 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:40,211 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-11-01 17:18:40,261 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:40,262 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:40,264 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-11-01 17:18:40,322 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:40,323 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:40,324 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:18:40,325 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-11-01 17:18:40,396 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:18:40,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:18:40,443 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:18:40,463 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1891 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-01 17:18:40,490 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_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1891 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2023-11-01 17:18:40,515 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_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-11-01 17:18:40,536 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.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 (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1891 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1891 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1891) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2023-11-01 17:18:40,555 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:18:40,556 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-11-01 17:18:40,563 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:18:40,563 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 84 treesize of output 32
[2023-11-01 17:18:40,572 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:18:40,572 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-01 17:18:40,577 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:18:40,578 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-11-01 17:18:40,583 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 17:18:40,583 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-01 17:18:40,763 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (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_1880) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-11-01 17:18:40,788 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (= (select (select (store (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_1880) .cse0 v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) .cse0)))) is different from false
[2023-11-01 17:18:40,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 17:18:40,790 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [734951] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:18:40,790 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:18:40,790 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 33
[2023-11-01 17:18:40,791 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62536580]
[2023-11-01 17:18:40,791 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:18:40,791 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2023-11-01 17:18:40,791 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:18:40,792 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2023-11-01 17:18:40,792 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=679, Unknown=27, NotChecked=354, Total=1190
[2023-11-01 17:18:41,093 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 215
[2023-11-01 17:18:41,095 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 4658 transitions, 88973 flow. Second operand  has 35 states, 35 states have (on average 56.542857142857144) internal successors, (1979), 35 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:18:41,095 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:18:41,095 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 215
[2023-11-01 17:18:41,095 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:20:06,549 INFO  L130       PetriNetUnfolder]: 57844/95688 cut-off events.
[2023-11-01 17:20:06,550 INFO  L131       PetriNetUnfolder]: For 1804861/1804861 co-relation queries the response was YES.
[2023-11-01 17:20:07,802 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 898935 conditions, 95688 events. 57844/95688 cut-off events. For 1804861/1804861 co-relation queries the response was YES. Maximal size of possible extension queue 2548. Compared 797705 event pairs, 10761 based on Foata normal form. 140/91715 useless extension candidates. Maximal degree in co-relation 861877. Up to 79339 conditions per place. 
[2023-11-01 17:20:08,354 INFO  L137   encePairwiseOnDemand]: 180/215 looper letters, 6713 selfloop transitions, 676 changer transitions 95/7485 dead transitions.
[2023-11-01 17:20:08,354 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 7485 transitions, 149562 flow
[2023-11-01 17:20:08,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2023-11-01 17:20:08,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2023-11-01 17:20:08,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2737 transitions.
[2023-11-01 17:20:08,358 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.32641621943947524
[2023-11-01 17:20:08,358 INFO  L72            ComplementDD]: Start complementDD. Operand 39 states and 2737 transitions.
[2023-11-01 17:20:08,358 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 39 states and 2737 transitions.
[2023-11-01 17:20:08,358 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 17:20:08,358 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2737 transitions.
[2023-11-01 17:20:08,361 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 40 states, 39 states have (on average 70.17948717948718) internal successors, (2737), 39 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:20:08,366 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 40 states, 40 states have (on average 215.0) internal successors, (8600), 40 states have internal predecessors, (8600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:20:08,366 INFO  L81            ComplementDD]: Finished complementDD. Result  has 40 states, 40 states have (on average 215.0) internal successors, (8600), 40 states have internal predecessors, (8600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:20:08,366 INFO  L175             Difference]: Start difference. First operand has 259 places, 4658 transitions, 88973 flow. Second operand 39 states and 2737 transitions.
[2023-11-01 17:20:08,367 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 7485 transitions, 149562 flow
[2023-11-01 17:21:39,815 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 7485 transitions, 149388 flow, removed 81 selfloop flow, removed 5 redundant places.
[2023-11-01 17:21:39,920 INFO  L231             Difference]: Finished difference. Result has 322 places, 5351 transitions, 104674 flow
[2023-11-01 17:21:39,923 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=88799, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=104674, PETRI_PLACES=322, PETRI_TRANSITIONS=5351}
[2023-11-01 17:21:39,924 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 251 predicate places.
[2023-11-01 17:21:39,924 INFO  L495      AbstractCegarLoop]: Abstraction has has 322 places, 5351 transitions, 104674 flow
[2023-11-01 17:21:39,924 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 56.542857142857144) internal successors, (1979), 35 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:21:39,924 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 17:21:39,924 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-11-01 17:21:39,931 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2023-11-01 17:21:40,125 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-11-01 17:21:40,126 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-11-01 17:21:40,127 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 17:21:40,127 INFO  L85        PathProgramCache]: Analyzing trace with hash -620696337, now seen corresponding path program 3 times
[2023-11-01 17:21:40,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 17:21:40,127 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515184947]
[2023-11-01 17:21:40,128 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 17:21:40,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 17:21:40,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 17:21:40,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:21:40,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 17:21:40,686 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515184947]
[2023-11-01 17:21:40,686 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515184947] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 17:21:40,686 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285908878]
[2023-11-01 17:21:40,686 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-01 17:21:40,686 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 17:21:40,686 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 17:21:40,687 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-11-01 17:21:40,693 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-11-01 17:21:40,865 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-01 17:21:40,865 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 17:21:40,872 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 62 conjunts are in the unsatisfiable core
[2023-11-01 17:21:40,878 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 17:21:40,909 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:40,911 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:40,915 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-11-01 17:21:40,981 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-11-01 17:21:41,432 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 17:21:41,433 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 69 treesize of output 62
[2023-11-01 17:21:41,551 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 17:21:41,552 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 62 treesize of output 57
[2023-11-01 17:21:41,618 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 17:21:41,719 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:41,720 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 17:21:41,810 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:41,812 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:41,814 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:21:41,814 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 30 treesize of output 32
[2023-11-01 17:21:41,902 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:41,904 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:41,905 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:41,908 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:21:41,909 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 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 17:21:42,207 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-11-01 17:21:42,208 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-11-01 17:21:42,291 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:42,292 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 41 treesize of output 37
[2023-11-01 17:21:42,324 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:42,325 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 41 treesize of output 37
[2023-11-01 17:21:42,359 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:42,359 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 41 treesize of output 37
[2023-11-01 17:21:42,381 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 17:21:42,382 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 41 treesize of output 37
[2023-11-01 17:21:42,473 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 17:21:42,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:21:42,521 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 17:21:42,545 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2029 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2029) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2029 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2029) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2029 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2029) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2029 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2029) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2023-11-01 17:21:42,587 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2028) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2029) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2028) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2029) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2028) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2029) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2029 (Array Int Int)) (v_ArrVal_2028 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2028) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2029) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2023-11-01 17:21:45,314 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:21:45,314 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 40 treesize of output 56
[2023-11-01 17:21:45,321 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 17:21:45,321 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 138 treesize of output 76
[2023-11-01 17:21:45,326 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 52 treesize of output 48
[2023-11-01 17:21:45,331 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 28
[2023-11-01 17:21:45,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 17:21:45,803 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285908878] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 17:21:45,803 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 17:21:45,803 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 40
[2023-11-01 17:21:45,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529578409]
[2023-11-01 17:21:45,803 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 17:21:45,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2023-11-01 17:21:45,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 17:21:45,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2023-11-01 17:21:45,805 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1325, Unknown=36, NotChecked=154, Total=1722
[2023-11-01 17:21:46,198 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 215
[2023-11-01 17:21:46,200 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 5351 transitions, 104674 flow. Second operand  has 42 states, 42 states have (on average 47.26190476190476) internal successors, (1985), 42 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 17:21:46,200 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 17:21:46,200 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 215
[2023-11-01 17:21:46,200 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 17:22:06,823 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 17:22:08,863 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-01 17:22:11,816 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
Killed by 15
