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


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81158b50f242c86171ca71449256e85a5ba990b96d32623e947acdc387b5ed11
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 12:31:28,363 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 12:31:28,364 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 12:31:28,387 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 12:31:28,388 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 12:31:28,389 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 12:31:28,390 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 12:31:28,391 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 12:31:28,392 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 12:31:28,393 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 12:31:28,393 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 12:31:28,394 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 12:31:28,395 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 12:31:28,395 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 12:31:28,396 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 12:31:28,397 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 12:31:28,398 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 12:31:28,399 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 12:31:28,400 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 12:31:28,401 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 12:31:28,402 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 12:31:28,403 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 12:31:28,404 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 12:31:28,405 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 12:31:28,407 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 12:31:28,407 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 12:31:28,407 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 12:31:28,408 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 12:31:28,408 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 12:31:28,409 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 12:31:28,409 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 12:31:28,410 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 12:31:28,411 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 12:31:28,411 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 12:31:28,412 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 12:31:28,412 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 12:31:28,413 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 12:31:28,413 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 12:31:28,413 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 12:31:28,414 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 12:31:28,414 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 12:31:28,415 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 12:31:28,437 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 12:31:28,437 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 12:31:28,438 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 12:31:28,438 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 12:31:28,439 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 12:31:28,439 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 12:31:28,440 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 12:31:28,440 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 12:31:28,440 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 12:31:28,440 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 12:31:28,441 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 12:31:28,441 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 12:31:28,441 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 12:31:28,441 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 12:31:28,442 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 12:31:28,442 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 12:31:28,442 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 12:31:28,442 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 12:31:28,442 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 12:31:28,443 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 12:31:28,443 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 12:31:28,443 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 12:31:28,443 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 12:31:28,444 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 12:31:28,444 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 12:31:28,444 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 12:31:28,444 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 12:31:28,444 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 12:31:28,445 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 12:31:28,445 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 12:31:28,445 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 12:31:28,445 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 12:31:28,445 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 12:31:28,445 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 12:31:28,445 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 12:31:28,445 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 12:31:28,446 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 12:31:28,446 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81158b50f242c86171ca71449256e85a5ba990b96d32623e947acdc387b5ed11
[2023-11-03 12:31:28,621 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 12:31:28,640 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 12:31:28,642 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 12:31:28,643 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 12:31:28,644 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 12:31:28,644 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i
[2023-11-03 12:31:29,743 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 12:31:29,980 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 12:31:29,980 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i
[2023-11-03 12:31:29,991 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/57f0cec18/03ec96d9c8424d3aa31cfb0d71e0366c/FLAGee4e027fc
[2023-11-03 12:31:30,346 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/57f0cec18/03ec96d9c8424d3aa31cfb0d71e0366c
[2023-11-03 12:31:30,348 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 12:31:30,349 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 12:31:30,350 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 12:31:30,350 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 12:31:30,354 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 12:31:30,354 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,355 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d76501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30, skipping insertion in model container
[2023-11-03 12:31:30,355 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,362 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 12:31:30,396 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 12:31:30,518 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 12:31:30,676 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 12:31:30,682 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 12:31:30,693 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 12:31:30,719 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 12:31:30,755 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 12:31:30,756 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30 WrapperNode
[2023-11-03 12:31:30,756 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 12:31:30,757 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 12:31:30,757 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 12:31:30,757 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 12:31:30,762 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,779 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,800 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2023-11-03 12:31:30,801 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 12:31:30,801 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 12:31:30,801 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 12:31:30,802 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 12:31:30,810 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,810 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,815 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,815 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,825 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,827 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,829 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,830 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,832 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 12:31:30,833 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 12:31:30,833 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 12:31:30,833 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 12:31:30,834 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (1/1) ...
[2023-11-03 12:31:30,839 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 12:31:30,848 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:31:30,865 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-03 12:31:30,868 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-03 12:31:30,891 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 12:31:30,891 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 12:31:30,891 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 12:31:30,892 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 12:31:30,892 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 12:31:30,892 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 12:31:30,892 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 12:31:30,892 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 12:31:30,892 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 12:31:30,892 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 12:31:30,892 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 12:31:30,893 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 12:31:31,014 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 12:31:31,016 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 12:31:31,279 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 12:31:31,290 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 12:31:31,290 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 12:31:31,292 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:31:31 BoogieIcfgContainer
[2023-11-03 12:31:31,293 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 12:31:31,294 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 12:31:31,295 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 12:31:31,297 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 12:31:31,298 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 12:31:30" (1/3) ...
[2023-11-03 12:31:31,298 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf061fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:31:31, skipping insertion in model container
[2023-11-03 12:31:31,298 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:31:30" (2/3) ...
[2023-11-03 12:31:31,299 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf061fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:31:31, skipping insertion in model container
[2023-11-03 12:31:31,299 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:31:31" (3/3) ...
[2023-11-03 12:31:31,301 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i
[2023-11-03 12:31:31,307 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 12:31:31,315 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 12:31:31,316 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2023-11-03 12:31:31,316 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 12:31:31,362 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 12:31:31,391 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-11-03 12:31:31,445 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-11-03 12:31:31,446 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:31:31,450 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-03 12:31:31,450 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2023-11-03 12:31:31,454 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2023-11-03 12:31:31,458 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 12:31:31,466 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2023-11-03 12:31:31,468 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2023-11-03 12:31:31,468 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-11-03 12:31:31,546 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-11-03 12:31:31,546 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:31:31,546 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-03 12:31:31,548 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2023-11-03 12:31:33,984 INFO  L134        LiptonReduction]: Checked pairs total: 10638
[2023-11-03 12:31:33,985 INFO  L136        LiptonReduction]: Total number of compositions: 70
[2023-11-03 12:31:33,998 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 12:31:34,004 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;@2428bc94, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 12:31:34,004 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-11-03 12:31:34,007 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-11-03 12:31:34,008 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 12:31:34,008 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:31:34,008 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:31:34,009 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-03 12:31:34,013 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:31:34,013 INFO  L85        PathProgramCache]: Analyzing trace with hash 1440899133, now seen corresponding path program 1 times
[2023-11-03 12:31:34,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:31:34,020 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664157800]
[2023-11-03 12:31:34,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:34,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:31:34,114 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:34,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:34,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:31:34,430 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664157800]
[2023-11-03 12:31:34,431 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664157800] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:31:34,432 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:31:34,432 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:31:34,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074307280]
[2023-11-03 12:31:34,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:31:34,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:31:34,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:31:34,456 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:31:34,457 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:31:34,835 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-03 12:31:34,839 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-03 12:31:34,840 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:31:34,840 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-03 12:31:34,840 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:31:35,059 INFO  L130       PetriNetUnfolder]: 152/518 cut-off events.
[2023-11-03 12:31:35,060 INFO  L131       PetriNetUnfolder]: For 8/12 co-relation queries the response was YES.
[2023-11-03 12:31:35,061 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-03 12:31:35,064 INFO  L137   encePairwiseOnDemand]: 176/192 looper letters, 49 selfloop transitions, 23 changer transitions 0/99 dead transitions.
[2023-11-03 12:31:35,064 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 350 flow
[2023-11-03 12:31:35,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:31:35,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:31:35,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions.
[2023-11-03 12:31:35,082 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5746527777777778
[2023-11-03 12:31:35,083 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 662 transitions.
[2023-11-03 12:31:35,083 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 662 transitions.
[2023-11-03 12:31:35,086 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:31:35,088 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 662 transitions.
[2023-11-03 12:31:35,095 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-03 12:31:35,103 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-03 12:31:35,104 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-03 12:31:35,105 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 662 transitions.
[2023-11-03 12:31:35,106 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 350 flow
[2023-11-03 12:31:35,109 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:31:35,111 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2023-11-03 12:31:35,112 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-03 12:31:35,115 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2023-11-03 12:31:35,115 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2023-11-03 12:31:35,116 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-03 12:31:35,116 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:31:35,116 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:31:35,116 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 12:31:35,117 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-03 12:31:35,117 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:31:35,117 INFO  L85        PathProgramCache]: Analyzing trace with hash 1491761304, now seen corresponding path program 1 times
[2023-11-03 12:31:35,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:31:35,117 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313164038]
[2023-11-03 12:31:35,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:35,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:31:35,132 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:35,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:35,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:31:35,292 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313164038]
[2023-11-03 12:31:35,292 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313164038] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:31:35,292 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:31:35,292 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:31:35,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977249216]
[2023-11-03 12:31:35,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:31:35,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:31:35,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:31:35,294 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:31:35,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:31:35,535 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 192
[2023-11-03 12:31:35,537 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-03 12:31:35,537 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:31:35,538 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 192
[2023-11-03 12:31:35,538 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:31:35,810 INFO  L130       PetriNetUnfolder]: 294/866 cut-off events.
[2023-11-03 12:31:35,810 INFO  L131       PetriNetUnfolder]: For 338/344 co-relation queries the response was YES.
[2023-11-03 12:31:35,814 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-03 12:31:35,818 INFO  L137   encePairwiseOnDemand]: 169/192 looper letters, 75 selfloop transitions, 50 changer transitions 0/153 dead transitions.
[2023-11-03 12:31:35,818 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 153 transitions, 805 flow
[2023-11-03 12:31:35,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:31:35,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:31:35,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions.
[2023-11-03 12:31:35,822 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5598958333333334
[2023-11-03 12:31:35,822 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 645 transitions.
[2023-11-03 12:31:35,822 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions.
[2023-11-03 12:31:35,822 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:31:35,822 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions.
[2023-11-03 12:31:35,824 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-03 12:31:35,826 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-03 12:31:35,826 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-03 12:31:35,826 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 6 states and 645 transitions.
[2023-11-03 12:31:35,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 153 transitions, 805 flow
[2023-11-03 12:31:35,831 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 805 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:31:35,833 INFO  L231             Difference]: Finished difference. Result has 79 places, 129 transitions, 770 flow
[2023-11-03 12:31:35,833 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-03 12:31:35,833 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places.
[2023-11-03 12:31:35,834 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 129 transitions, 770 flow
[2023-11-03 12:31:35,834 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-03 12:31:35,834 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:31:35,834 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:31:35,834 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 12:31:35,835 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-03 12:31:35,835 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:31:35,835 INFO  L85        PathProgramCache]: Analyzing trace with hash 365353206, now seen corresponding path program 1 times
[2023-11-03 12:31:35,835 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:31:35,835 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289730702]
[2023-11-03 12:31:35,835 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:35,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:31:35,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:36,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:36,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:31:36,049 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289730702]
[2023-11-03 12:31:36,049 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289730702] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:31:36,049 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:31:36,049 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:31:36,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515605423]
[2023-11-03 12:31:36,049 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:31:36,050 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:31:36,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:31:36,050 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:31:36,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:31:36,384 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 192
[2023-11-03 12:31:36,385 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-03 12:31:36,385 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:31:36,385 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 192
[2023-11-03 12:31:36,386 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:31:36,620 INFO  L130       PetriNetUnfolder]: 290/850 cut-off events.
[2023-11-03 12:31:36,620 INFO  L131       PetriNetUnfolder]: For 1132/1151 co-relation queries the response was YES.
[2023-11-03 12:31:36,622 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-03 12:31:36,627 INFO  L137   encePairwiseOnDemand]: 181/192 looper letters, 77 selfloop transitions, 33 changer transitions 8/171 dead transitions.
[2023-11-03 12:31:36,627 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1245 flow
[2023-11-03 12:31:36,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:31:36,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:31:36,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions.
[2023-11-03 12:31:36,629 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5807291666666666
[2023-11-03 12:31:36,630 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 669 transitions.
[2023-11-03 12:31:36,630 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions.
[2023-11-03 12:31:36,630 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:31:36,630 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions.
[2023-11-03 12:31:36,631 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-03 12:31:36,633 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-03 12:31:36,634 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-03 12:31:36,634 INFO  L175             Difference]: Start difference. First operand has 79 places, 129 transitions, 770 flow. Second operand 6 states and 669 transitions.
[2023-11-03 12:31:36,634 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 1245 flow
[2023-11-03 12:31:36,639 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1245 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:31:36,641 INFO  L231             Difference]: Finished difference. Result has 89 places, 159 transitions, 1135 flow
[2023-11-03 12:31:36,641 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-03 12:31:36,642 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2023-11-03 12:31:36,642 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1135 flow
[2023-11-03 12:31:36,643 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-03 12:31:36,643 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:31:36,643 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-03 12:31:36,643 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 12:31:36,643 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-03 12:31:36,644 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:31:36,644 INFO  L85        PathProgramCache]: Analyzing trace with hash -1763579770, now seen corresponding path program 1 times
[2023-11-03 12:31:36,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:31:36,644 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562442258]
[2023-11-03 12:31:36,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:36,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:31:36,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:36,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:36,852 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:31:36,852 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562442258]
[2023-11-03 12:31:36,852 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562442258] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:31:36,853 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:31:36,853 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:31:36,853 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441433374]
[2023-11-03 12:31:36,853 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:31:36,853 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:31:36,853 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:31:36,854 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:31:36,854 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:31:36,948 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192
[2023-11-03 12:31:36,949 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-03 12:31:36,949 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:31:36,949 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192
[2023-11-03 12:31:36,949 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:31:37,405 INFO  L130       PetriNetUnfolder]: 555/1369 cut-off events.
[2023-11-03 12:31:37,405 INFO  L131       PetriNetUnfolder]: For 1875/1889 co-relation queries the response was YES.
[2023-11-03 12:31:37,408 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-03 12:31:37,413 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 172 selfloop transitions, 111 changer transitions 10/308 dead transitions.
[2023-11-03 12:31:37,413 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 308 transitions, 2383 flow
[2023-11-03 12:31:37,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:31:37,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:31:37,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions.
[2023-11-03 12:31:37,415 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5972222222222222
[2023-11-03 12:31:37,415 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 688 transitions.
[2023-11-03 12:31:37,415 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 688 transitions.
[2023-11-03 12:31:37,416 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:31:37,416 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 688 transitions.
[2023-11-03 12:31:37,417 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-03 12:31:37,419 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-03 12:31:37,420 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-03 12:31:37,420 INFO  L175             Difference]: Start difference. First operand has 89 places, 159 transitions, 1135 flow. Second operand 6 states and 688 transitions.
[2023-11-03 12:31:37,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 308 transitions, 2383 flow
[2023-11-03 12:31:37,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 308 transitions, 2383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:31:37,429 INFO  L231             Difference]: Finished difference. Result has 97 places, 262 transitions, 2045 flow
[2023-11-03 12:31:37,430 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-03 12:31:37,430 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places.
[2023-11-03 12:31:37,430 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 262 transitions, 2045 flow
[2023-11-03 12:31:37,431 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-03 12:31:37,431 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:31:37,431 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-03 12:31:37,431 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 12:31:37,431 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-03 12:31:37,431 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:31:37,431 INFO  L85        PathProgramCache]: Analyzing trace with hash -766543501, now seen corresponding path program 1 times
[2023-11-03 12:31:37,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:31:37,432 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421691110]
[2023-11-03 12:31:37,432 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:37,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:31:37,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:37,806 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-03 12:31:37,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:31:37,807 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421691110]
[2023-11-03 12:31:37,807 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421691110] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:31:37,807 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437479538]
[2023-11-03 12:31:37,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:37,808 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:31:37,808 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:31:37,810 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:31:37,813 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-03 12:31:37,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:37,918 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-03 12:31:37,925 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:31:37,994 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-11-03 12:31:38,144 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:31:38,181 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:38,182 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:31:38,227 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:38,228 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:38,229 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:31:38,280 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:38,281 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:38,282 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:38,283 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:31:38,348 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:38,349 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:31:38,398 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-03 12:31:38,398 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:31:38,437 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2023-11-03 12:31:38,464 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-03 12:31:38,493 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-03 12:31:38,649 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-03 12:31:38,649 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437479538] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:31:38,650 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:31:38,650 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-11-03 12:31:38,650 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296844334]
[2023-11-03 12:31:38,650 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:31:38,651 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-11-03 12:31:38,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:31:38,652 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-11-03 12:31:38,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=460, Unknown=3, NotChecked=138, Total=702
[2023-11-03 12:31:38,699 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 192
[2023-11-03 12:31:38,701 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-03 12:31:38,701 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:31:38,701 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 192
[2023-11-03 12:31:38,701 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:31:39,754 INFO  L130       PetriNetUnfolder]: 631/1458 cut-off events.
[2023-11-03 12:31:39,754 INFO  L131       PetriNetUnfolder]: For 3368/3368 co-relation queries the response was YES.
[2023-11-03 12:31:39,758 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-03 12:31:39,765 INFO  L137   encePairwiseOnDemand]: 182/192 looper letters, 304 selfloop transitions, 12 changer transitions 12/330 dead transitions.
[2023-11-03 12:31:39,765 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 330 transitions, 3086 flow
[2023-11-03 12:31:39,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-11-03 12:31:39,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-11-03 12:31:39,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2023-11-03 12:31:39,768 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3692708333333333
[2023-11-03 12:31:39,768 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2023-11-03 12:31:39,768 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2023-11-03 12:31:39,769 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:31:39,769 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2023-11-03 12:31:39,770 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-03 12:31:39,772 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-03 12:31:39,773 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-03 12:31:39,773 INFO  L175             Difference]: Start difference. First operand has 97 places, 262 transitions, 2045 flow. Second operand 10 states and 709 transitions.
[2023-11-03 12:31:39,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 330 transitions, 3086 flow
[2023-11-03 12:31:39,789 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 2942 flow, removed 72 selfloop flow, removed 0 redundant places.
[2023-11-03 12:31:39,793 INFO  L231             Difference]: Finished difference. Result has 107 places, 265 transitions, 1941 flow
[2023-11-03 12:31:39,793 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-03 12:31:39,794 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places.
[2023-11-03 12:31:39,794 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 265 transitions, 1941 flow
[2023-11-03 12:31:39,795 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-03 12:31:39,795 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:31:39,795 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-03 12:31:39,805 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-03 12:31:39,995 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-03 12:31:39,997 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-03 12:31:39,997 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:31:39,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 140689641, now seen corresponding path program 1 times
[2023-11-03 12:31:39,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:31:39,998 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3943702]
[2023-11-03 12:31:39,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:39,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:31:40,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:40,335 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-03 12:31:40,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:31:40,336 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3943702]
[2023-11-03 12:31:40,336 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3943702] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:31:40,336 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484748855]
[2023-11-03 12:31:40,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:40,336 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:31:40,336 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:31:40,337 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:31:40,339 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-03 12:31:40,460 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:40,463 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-03 12:31:40,466 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:31:40,489 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-03 12:31:40,562 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:31:40,593 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-03 12:31:40,635 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:31:40,635 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-03 12:31:40,674 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:31:40,674 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-03 12:31:40,711 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:40,712 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:31:40,720 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-03 12:31:40,721 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:31:40,746 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-03 12:31:40,766 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-03 12:31:40,789 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-03 12:31:40,925 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-03 12:31:40,926 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [484748855] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:31:40,926 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:31:40,926 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-11-03 12:31:40,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663923766]
[2023-11-03 12:31:40,926 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:31:40,927 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-03 12:31:40,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:31:40,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-03 12:31:40,928 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-11-03 12:31:40,930 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2023-11-03 12:31:40,932 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-03 12:31:40,932 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:31:40,932 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2023-11-03 12:31:40,932 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:31:43,122 INFO  L130       PetriNetUnfolder]: 674/1547 cut-off events.
[2023-11-03 12:31:43,122 INFO  L131       PetriNetUnfolder]: For 3758/3764 co-relation queries the response was YES.
[2023-11-03 12:31:43,125 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6977 conditions, 1547 events. 674/1547 cut-off events. For 3758/3764 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9797 event pairs, 106 based on Foata normal form. 2/1468 useless extension candidates. Maximal degree in co-relation 6844. Up to 962 conditions per place. 
[2023-11-03 12:31:43,131 INFO  L137   encePairwiseOnDemand]: 141/192 looper letters, 305 selfloop transitions, 163 changer transitions 40/510 dead transitions.
[2023-11-03 12:31:43,131 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 510 transitions, 4404 flow
[2023-11-03 12:31:43,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-03 12:31:43,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-03 12:31:43,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1396 transitions.
[2023-11-03 12:31:43,135 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3826754385964912
[2023-11-03 12:31:43,135 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1396 transitions.
[2023-11-03 12:31:43,135 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1396 transitions.
[2023-11-03 12:31:43,136 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:31:43,136 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1396 transitions.
[2023-11-03 12:31:43,138 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-03 12:31:43,142 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-03 12:31:43,142 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-03 12:31:43,143 INFO  L175             Difference]: Start difference. First operand has 107 places, 265 transitions, 1941 flow. Second operand 19 states and 1396 transitions.
[2023-11-03 12:31:43,143 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 510 transitions, 4404 flow
[2023-11-03 12:31:43,159 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 510 transitions, 4376 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-03 12:31:43,164 INFO  L231             Difference]: Finished difference. Result has 127 places, 328 transitions, 3030 flow
[2023-11-03 12:31:43,164 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-03 12:31:43,165 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 68 predicate places.
[2023-11-03 12:31:43,165 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 328 transitions, 3030 flow
[2023-11-03 12:31:43,166 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-03 12:31:43,166 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:31:43,166 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-03 12:31:43,171 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-03 12:31:43,367 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-03 12:31:43,368 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-03 12:31:43,368 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:31:43,369 INFO  L85        PathProgramCache]: Analyzing trace with hash 1201166498, now seen corresponding path program 1 times
[2023-11-03 12:31:43,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:31:43,369 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097379904]
[2023-11-03 12:31:43,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:43,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:31:43,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:43,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:43,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:31:43,459 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097379904]
[2023-11-03 12:31:43,459 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097379904] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:31:43,459 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611274610]
[2023-11-03 12:31:43,459 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:43,459 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:31:43,460 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:31:43,461 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:31:43,462 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-03 12:31:43,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:43,568 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 12:31:43,569 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:31:43,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:43,616 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:31:43,660 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:43,660 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611274610] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:31:43,660 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:31:43,661 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-03 12:31:43,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913107904]
[2023-11-03 12:31:43,661 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:31:43,661 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-03 12:31:43,662 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:31:43,662 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-03 12:31:43,662 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-03 12:31:43,775 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 192
[2023-11-03 12:31:43,776 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-03 12:31:43,776 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:31:43,776 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 192
[2023-11-03 12:31:43,776 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:31:43,913 INFO  L130       PetriNetUnfolder]: 274/808 cut-off events.
[2023-11-03 12:31:43,913 INFO  L131       PetriNetUnfolder]: For 2711/2727 co-relation queries the response was YES.
[2023-11-03 12:31:43,916 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 808 events. 274/808 cut-off events. For 2711/2727 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5020 event pairs, 11 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 3727. Up to 246 conditions per place. 
[2023-11-03 12:31:43,920 INFO  L137   encePairwiseOnDemand]: 186/192 looper letters, 24 selfloop transitions, 10 changer transitions 3/248 dead transitions.
[2023-11-03 12:31:43,920 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 248 transitions, 2348 flow
[2023-11-03 12:31:43,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 12:31:43,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 12:31:43,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions.
[2023-11-03 12:31:43,922 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5729166666666666
[2023-11-03 12:31:43,922 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 770 transitions.
[2023-11-03 12:31:43,923 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions.
[2023-11-03 12:31:43,923 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:31:43,923 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions.
[2023-11-03 12:31:43,924 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-03 12:31:43,926 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-03 12:31:43,926 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-03 12:31:43,926 INFO  L175             Difference]: Start difference. First operand has 127 places, 328 transitions, 3030 flow. Second operand 7 states and 770 transitions.
[2023-11-03 12:31:43,926 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 248 transitions, 2348 flow
[2023-11-03 12:31:43,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 248 transitions, 2248 flow, removed 28 selfloop flow, removed 8 redundant places.
[2023-11-03 12:31:43,969 INFO  L231             Difference]: Finished difference. Result has 113 places, 240 transitions, 2156 flow
[2023-11-03 12:31:43,969 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-03 12:31:43,970 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 54 predicate places.
[2023-11-03 12:31:43,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 240 transitions, 2156 flow
[2023-11-03 12:31:43,971 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-03 12:31:43,971 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:31:43,971 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-03 12:31:43,979 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-03 12:31:44,171 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-03 12:31:44,172 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-03 12:31:44,172 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:31:44,172 INFO  L85        PathProgramCache]: Analyzing trace with hash 2116465637, now seen corresponding path program 1 times
[2023-11-03 12:31:44,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:31:44,173 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728680275]
[2023-11-03 12:31:44,173 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:44,173 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:31:44,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:44,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:44,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:31:44,459 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728680275]
[2023-11-03 12:31:44,459 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728680275] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:31:44,460 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226064756]
[2023-11-03 12:31:44,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:44,460 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:31:44,460 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:31:44,461 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:31:44,462 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-03 12:31:44,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:44,570 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-03 12:31:44,575 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:31:44,593 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-03 12:31:44,639 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:31:44,659 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-03 12:31:44,684 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:31:44,685 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-03 12:31:44,756 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:31:44,757 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-03 12:31:44,792 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:44,793 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:31:44,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:44,801 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:31:44,823 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-03 12:31:44,843 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-03 12:31:44,889 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-03 12:31:44,992 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-03 12:31:44,993 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226064756] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:31:44,993 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:31:44,993 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-11-03 12:31:44,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745996915]
[2023-11-03 12:31:44,993 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:31:44,993 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-03 12:31:44,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:31:44,994 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-03 12:31:44,994 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-11-03 12:31:45,022 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 192
[2023-11-03 12:31:45,023 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 240 transitions, 2156 flow. Second operand  has 26 states, 26 states have (on average 56.73076923076923) internal successors, (1475), 26 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:31:45,023 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:31:45,023 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 192
[2023-11-03 12:31:45,023 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:31:47,517 INFO  L130       PetriNetUnfolder]: 523/1237 cut-off events.
[2023-11-03 12:31:47,518 INFO  L131       PetriNetUnfolder]: For 4531/4531 co-relation queries the response was YES.
[2023-11-03 12:31:47,521 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6650 conditions, 1237 events. 523/1237 cut-off events. For 4531/4531 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7532 event pairs, 30 based on Foata normal form. 43/1280 useless extension candidates. Maximal degree in co-relation 6497. Up to 649 conditions per place. 
[2023-11-03 12:31:47,527 INFO  L137   encePairwiseOnDemand]: 154/192 looper letters, 266 selfloop transitions, 192 changer transitions 8/468 dead transitions.
[2023-11-03 12:31:47,527 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 468 transitions, 4660 flow
[2023-11-03 12:31:47,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-11-03 12:31:47,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-11-03 12:31:47,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1344 transitions.
[2023-11-03 12:31:47,531 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35
[2023-11-03 12:31:47,531 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1344 transitions.
[2023-11-03 12:31:47,531 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1344 transitions.
[2023-11-03 12:31:47,531 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:31:47,531 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1344 transitions.
[2023-11-03 12:31:47,534 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 67.2) internal successors, (1344), 20 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:31:47,537 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 192.0) internal successors, (4032), 21 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:31:47,537 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 192.0) internal successors, (4032), 21 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:31:47,537 INFO  L175             Difference]: Start difference. First operand has 113 places, 240 transitions, 2156 flow. Second operand 20 states and 1344 transitions.
[2023-11-03 12:31:47,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 468 transitions, 4660 flow
[2023-11-03 12:31:47,555 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 468 transitions, 4632 flow, removed 8 selfloop flow, removed 4 redundant places.
[2023-11-03 12:31:47,560 INFO  L231             Difference]: Finished difference. Result has 133 places, 339 transitions, 3801 flow
[2023-11-03 12:31:47,560 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3801, PETRI_PLACES=133, PETRI_TRANSITIONS=339}
[2023-11-03 12:31:47,561 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 74 predicate places.
[2023-11-03 12:31:47,561 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 339 transitions, 3801 flow
[2023-11-03 12:31:47,562 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.73076923076923) internal successors, (1475), 26 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:31:47,562 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:31:47,562 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-03 12:31:47,569 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-11-03 12:31:47,762 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-03 12:31:47,764 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-03 12:31:47,764 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:31:47,764 INFO  L85        PathProgramCache]: Analyzing trace with hash -831584502, now seen corresponding path program 1 times
[2023-11-03 12:31:47,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:31:47,765 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484111641]
[2023-11-03 12:31:47,765 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:47,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:31:47,786 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:48,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:48,054 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:31:48,054 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484111641]
[2023-11-03 12:31:48,054 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484111641] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:31:48,054 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121942084]
[2023-11-03 12:31:48,054 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:48,054 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:31:48,054 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:31:48,056 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:31:48,057 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-11-03 12:31:48,162 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:48,163 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-03 12:31:48,165 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:31:48,193 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-03 12:31:48,289 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:31:48,328 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:48,329 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:31:48,365 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:48,366 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:48,368 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:31:48,417 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:48,419 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:48,420 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:48,421 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:31:48,518 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:48,519 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:31:48,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:48,555 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:31:48,586 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-03 12:31:48,640 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-11-03 12:31:49,015 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))))) is different from false
[2023-11-03 12:31:49,229 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:31:49,230 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-03 12:31:49,237 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:31:49,237 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-11-03 12:31:49,243 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-11-03 12:31:49,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:31:49,327 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121942084] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:31:49,327 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:31:49,327 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-11-03 12:31:49,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327168767]
[2023-11-03 12:31:49,327 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:31:49,328 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-11-03 12:31:49,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:31:49,328 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-11-03 12:31:49,328 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=513, Unknown=24, NotChecked=150, Total=812
[2023-11-03 12:31:49,553 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 192
[2023-11-03 12:31:49,555 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 339 transitions, 3801 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:31:49,555 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:31:49,555 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 192
[2023-11-03 12:31:49,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:31:50,486 INFO  L130       PetriNetUnfolder]: 497/1175 cut-off events.
[2023-11-03 12:31:50,487 INFO  L131       PetriNetUnfolder]: For 7183/7185 co-relation queries the response was YES.
[2023-11-03 12:31:50,490 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7793 conditions, 1175 events. 497/1175 cut-off events. For 7183/7185 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7026 event pairs, 34 based on Foata normal form. 30/1204 useless extension candidates. Maximal degree in co-relation 7627. Up to 1087 conditions per place. 
[2023-11-03 12:31:50,497 INFO  L137   encePairwiseOnDemand]: 183/192 looper letters, 346 selfloop transitions, 13 changer transitions 1/362 dead transitions.
[2023-11-03 12:31:50,497 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 362 transitions, 4660 flow
[2023-11-03 12:31:50,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-11-03 12:31:50,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-11-03 12:31:50,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 643 transitions.
[2023-11-03 12:31:50,499 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.33489583333333334
[2023-11-03 12:31:50,499 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 643 transitions.
[2023-11-03 12:31:50,499 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 643 transitions.
[2023-11-03 12:31:50,499 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:31:50,499 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 643 transitions.
[2023-11-03 12:31:50,501 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-03 12:31:50,502 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-03 12:31:50,503 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-03 12:31:50,503 INFO  L175             Difference]: Start difference. First operand has 133 places, 339 transitions, 3801 flow. Second operand 10 states and 643 transitions.
[2023-11-03 12:31:50,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 362 transitions, 4660 flow
[2023-11-03 12:31:50,534 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 362 transitions, 4471 flow, removed 58 selfloop flow, removed 12 redundant places.
[2023-11-03 12:31:50,538 INFO  L231             Difference]: Finished difference. Result has 129 places, 330 transitions, 3543 flow
[2023-11-03 12:31:50,539 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=3509, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3543, PETRI_PLACES=129, PETRI_TRANSITIONS=330}
[2023-11-03 12:31:50,539 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 70 predicate places.
[2023-11-03 12:31:50,539 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 330 transitions, 3543 flow
[2023-11-03 12:31:50,540 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:31:50,540 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:31:50,540 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-03 12:31:50,548 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2023-11-03 12:31:50,740 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-03 12:31:50,742 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-03 12:31:50,742 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:31:50,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 2140873883, now seen corresponding path program 2 times
[2023-11-03 12:31:50,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:31:50,743 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584125811]
[2023-11-03 12:31:50,743 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:31:50,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:31:50,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:31:51,146 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-03 12:31:51,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:31:51,146 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584125811]
[2023-11-03 12:31:51,146 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584125811] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:31:51,146 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876260668]
[2023-11-03 12:31:51,146 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 12:31:51,146 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:31:51,146 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:31:51,148 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:31:51,149 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-11-03 12:31:51,286 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 12:31:51,287 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:31:51,289 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-11-03 12:31:51,294 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:31:51,323 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-03 12:31:51,505 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:31:51,540 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-03 12:31:51,600 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:31:51,601 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-03 12:31:51,655 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:31:51,656 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-03 12:31:51,719 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:51,722 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:31:51,723 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-03 12:31:51,885 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:51,888 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:31:51,898 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-11-03 12:31:51,899 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-03 12:31:51,932 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-03 12:31:51,932 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:31:52,809 INFO  L321             Elim1Store]: treesize reduction 242, result has 32.0 percent of original size
[2023-11-03 12:31:52,810 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-03 12:31:52,886 INFO  L321             Elim1Store]: treesize reduction 37, result has 63.4 percent of original size
[2023-11-03 12:31:52,886 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-03 12:31:52,937 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-03 12:31:52,951 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-03 12:31:52,967 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-03 12:31:52,982 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-03 12:31:53,520 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-03 12:31:53,520 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876260668] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:31:53,520 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:31:53,520 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30
[2023-11-03 12:31:53,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074498032]
[2023-11-03 12:31:53,520 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:31:53,521 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-11-03 12:31:53,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:31:53,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-11-03 12:31:53,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=828, Unknown=3, NotChecked=0, Total=992
[2023-11-03 12:31:59,821 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 192
[2023-11-03 12:31:59,824 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 330 transitions, 3543 flow. Second operand  has 32 states, 32 states have (on average 56.75) internal successors, (1816), 32 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:31:59,824 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:31:59,825 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 192
[2023-11-03 12:31:59,825 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:32:03,707 INFO  L130       PetriNetUnfolder]: 482/1137 cut-off events.
[2023-11-03 12:32:03,708 INFO  L131       PetriNetUnfolder]: For 6525/6527 co-relation queries the response was YES.
[2023-11-03 12:32:03,711 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7201 conditions, 1137 events. 482/1137 cut-off events. For 6525/6527 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6756 event pairs, 10 based on Foata normal form. 20/1156 useless extension candidates. Maximal degree in co-relation 7043. Up to 402 conditions per place. 
[2023-11-03 12:32:03,717 INFO  L137   encePairwiseOnDemand]: 174/192 looper letters, 335 selfloop transitions, 147 changer transitions 6/490 dead transitions.
[2023-11-03 12:32:03,717 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 490 transitions, 5841 flow
[2023-11-03 12:32:03,718 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-03 12:32:03,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-03 12:32:03,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1228 transitions.
[2023-11-03 12:32:03,720 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3366228070175439
[2023-11-03 12:32:03,720 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1228 transitions.
[2023-11-03 12:32:03,720 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1228 transitions.
[2023-11-03 12:32:03,721 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:32:03,721 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1228 transitions.
[2023-11-03 12:32:03,723 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 64.63157894736842) internal successors, (1228), 19 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:03,726 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-03 12:32:03,726 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-03 12:32:03,727 INFO  L175             Difference]: Start difference. First operand has 129 places, 330 transitions, 3543 flow. Second operand 19 states and 1228 transitions.
[2023-11-03 12:32:03,727 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 490 transitions, 5841 flow
[2023-11-03 12:32:03,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 490 transitions, 5823 flow, removed 0 selfloop flow, removed 7 redundant places.
[2023-11-03 12:32:03,760 INFO  L231             Difference]: Finished difference. Result has 145 places, 342 transitions, 4132 flow
[2023-11-03 12:32:03,760 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=3525, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4132, PETRI_PLACES=145, PETRI_TRANSITIONS=342}
[2023-11-03 12:32:03,761 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 86 predicate places.
[2023-11-03 12:32:03,761 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 342 transitions, 4132 flow
[2023-11-03 12:32:03,762 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-03 12:32:03,762 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:32:03,762 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-11-03 12:32:03,768 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-11-03 12:32:03,963 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-03 12:32:03,966 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-03 12:32:03,966 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:32:03,967 INFO  L85        PathProgramCache]: Analyzing trace with hash 1212047773, now seen corresponding path program 1 times
[2023-11-03 12:32:03,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:32:03,967 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408869527]
[2023-11-03 12:32:03,967 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:03,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:32:04,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 12:32:04,008 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 12:32:04,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 12:32:04,050 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 12:32:04,050 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 12:32:04,051 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-11-03 12:32:04,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-11-03 12:32:04,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-11-03 12:32:04,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-11-03 12:32:04,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-11-03 12:32:04,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-11-03 12:32:04,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-11-03 12:32:04,053 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-11-03 12:32:04,053 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-11-03 12:32:04,053 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-03 12:32:04,053 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:32:04,055 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 12:32:04,055 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 12:32:04,069 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-03 12:32:04,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-11-03 12:32:04,091 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-11-03 12:32:04,091 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 12:32:04,091 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-03 12:32:04,091 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2023-11-03 12:32:04,092 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2023-11-03 12:32:04,092 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 12:32:04,092 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2023-11-03 12:32:04,093 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2023-11-03 12:32:04,093 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-11-03 12:32:04,111 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-11-03 12:32:04,111 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 12:32:04,111 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-03 12:32:04,114 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2023-11-03 12:32:07,104 INFO  L134        LiptonReduction]: Checked pairs total: 23741
[2023-11-03 12:32:07,104 INFO  L136        LiptonReduction]: Total number of compositions: 76
[2023-11-03 12:32:07,106 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 12:32:07,107 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;@2428bc94, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 12:32:07,107 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-11-03 12:32:07,110 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-11-03 12:32:07,111 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 12:32:07,111 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:32:07,111 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:32:07,111 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-03 12:32:07,112 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:32:07,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -708344653, now seen corresponding path program 1 times
[2023-11-03 12:32:07,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:32:07,112 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925233638]
[2023-11-03 12:32:07,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:07,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:32:07,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:07,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:07,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:32:07,223 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925233638]
[2023-11-03 12:32:07,223 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925233638] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:32:07,223 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:32:07,223 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:32:07,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964744638]
[2023-11-03 12:32:07,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:32:07,223 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:32:07,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:32:07,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:32:07,224 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:32:07,490 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 215
[2023-11-03 12:32:07,511 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-03 12:32:07,511 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:32:07,511 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 215
[2023-11-03 12:32:07,511 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:32:08,239 INFO  L130       PetriNetUnfolder]: 2976/6074 cut-off events.
[2023-11-03 12:32:08,240 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2023-11-03 12:32:08,245 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-03 12:32:08,260 INFO  L137   encePairwiseOnDemand]: 195/215 looper letters, 71 selfloop transitions, 42 changer transitions 0/143 dead transitions.
[2023-11-03 12:32:08,260 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 143 transitions, 538 flow
[2023-11-03 12:32:08,261 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:32:08,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:32:08,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-11-03 12:32:08,262 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5961240310077519
[2023-11-03 12:32:08,262 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-11-03 12:32:08,262 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-11-03 12:32:08,262 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:32:08,262 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-11-03 12:32:08,263 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-03 12:32:08,264 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-03 12:32:08,265 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-03 12:32:08,265 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 769 transitions.
[2023-11-03 12:32:08,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 143 transitions, 538 flow
[2023-11-03 12:32:08,266 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:32:08,267 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2023-11-03 12:32:08,267 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-03 12:32:08,267 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2023-11-03 12:32:08,267 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2023-11-03 12:32:08,268 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-03 12:32:08,268 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:32:08,268 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:32:08,268 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-03 12:32:08,268 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-03 12:32:08,268 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:32:08,268 INFO  L85        PathProgramCache]: Analyzing trace with hash -555411616, now seen corresponding path program 1 times
[2023-11-03 12:32:08,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:32:08,268 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077072299]
[2023-11-03 12:32:08,269 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:08,269 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:32:08,276 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:08,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:08,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:32:08,302 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077072299]
[2023-11-03 12:32:08,302 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077072299] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:32:08,302 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:32:08,302 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 12:32:08,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575255701]
[2023-11-03 12:32:08,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:32:08,303 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-03 12:32:08,303 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:32:08,303 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-03 12:32:08,304 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-03 12:32:08,359 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 215
[2023-11-03 12:32:08,360 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-03 12:32:08,360 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:32:08,360 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 215
[2023-11-03 12:32:08,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:32:08,728 INFO  L130       PetriNetUnfolder]: 1575/4192 cut-off events.
[2023-11-03 12:32:08,728 INFO  L131       PetriNetUnfolder]: For 1357/1534 co-relation queries the response was YES.
[2023-11-03 12:32:08,735 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-03 12:32:08,746 INFO  L137   encePairwiseOnDemand]: 211/215 looper letters, 38 selfloop transitions, 3 changer transitions 3/122 dead transitions.
[2023-11-03 12:32:08,746 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 568 flow
[2023-11-03 12:32:08,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 12:32:08,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 12:32:08,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions.
[2023-11-03 12:32:08,747 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6267441860465116
[2023-11-03 12:32:08,747 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 539 transitions.
[2023-11-03 12:32:08,747 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions.
[2023-11-03 12:32:08,747 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:32:08,747 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions.
[2023-11-03 12:32:08,748 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-03 12:32:08,749 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-03 12:32:08,749 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-03 12:32:08,749 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 539 transitions.
[2023-11-03 12:32:08,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 568 flow
[2023-11-03 12:32:08,753 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 122 transitions, 568 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:32:08,754 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2023-11-03 12:32:08,754 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-03 12:32:08,755 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2023-11-03 12:32:08,755 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2023-11-03 12:32:08,755 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-03 12:32:08,755 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:32:08,755 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:32:08,755 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-03 12:32:08,756 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-03 12:32:08,756 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:32:08,756 INFO  L85        PathProgramCache]: Analyzing trace with hash 33476867, now seen corresponding path program 1 times
[2023-11-03 12:32:08,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:32:08,756 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326435470]
[2023-11-03 12:32:08,756 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:08,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:32:08,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:08,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:08,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:32:08,872 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326435470]
[2023-11-03 12:32:08,872 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326435470] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:32:08,872 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:32:08,872 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:32:08,873 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973082863]
[2023-11-03 12:32:08,873 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:32:08,873 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:32:08,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:32:08,874 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:32:08,874 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:32:09,150 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 215
[2023-11-03 12:32:09,151 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-03 12:32:09,151 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:32:09,151 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 215
[2023-11-03 12:32:09,151 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:32:10,315 INFO  L130       PetriNetUnfolder]: 6417/12066 cut-off events.
[2023-11-03 12:32:10,315 INFO  L131       PetriNetUnfolder]: For 6131/6288 co-relation queries the response was YES.
[2023-11-03 12:32:10,332 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-03 12:32:10,362 INFO  L137   encePairwiseOnDemand]: 188/215 looper letters, 118 selfloop transitions, 104 changer transitions 1/254 dead transitions.
[2023-11-03 12:32:10,362 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 254 transitions, 1510 flow
[2023-11-03 12:32:10,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:32:10,363 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:32:10,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions.
[2023-11-03 12:32:10,363 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821705426356589
[2023-11-03 12:32:10,363 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 751 transitions.
[2023-11-03 12:32:10,363 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions.
[2023-11-03 12:32:10,364 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:32:10,364 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions.
[2023-11-03 12:32:10,365 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-03 12:32:10,366 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-03 12:32:10,366 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-03 12:32:10,366 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 751 transitions.
[2023-11-03 12:32:10,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 254 transitions, 1510 flow
[2023-11-03 12:32:10,374 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 254 transitions, 1507 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 12:32:10,376 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2023-11-03 12:32:10,376 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-03 12:32:10,377 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2023-11-03 12:32:10,377 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2023-11-03 12:32:10,378 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-03 12:32:10,378 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:32:10,378 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-03 12:32:10,378 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-03 12:32:10,378 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-03 12:32:10,378 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:32:10,378 INFO  L85        PathProgramCache]: Analyzing trace with hash 163438136, now seen corresponding path program 1 times
[2023-11-03 12:32:10,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:32:10,378 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361915967]
[2023-11-03 12:32:10,378 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:10,379 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:32:10,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:10,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:10,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:32:10,530 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361915967]
[2023-11-03 12:32:10,530 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361915967] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:32:10,530 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:32:10,530 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:32:10,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493410501]
[2023-11-03 12:32:10,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:32:10,530 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:32:10,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:32:10,530 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:32:10,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:32:10,652 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 215
[2023-11-03 12:32:10,653 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-03 12:32:10,653 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:32:10,653 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 215
[2023-11-03 12:32:10,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:32:12,867 INFO  L130       PetriNetUnfolder]: 11069/19135 cut-off events.
[2023-11-03 12:32:12,868 INFO  L131       PetriNetUnfolder]: For 23646/23867 co-relation queries the response was YES.
[2023-11-03 12:32:12,900 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-03 12:32:12,954 INFO  L137   encePairwiseOnDemand]: 181/215 looper letters, 246 selfloop transitions, 178 changer transitions 0/441 dead transitions.
[2023-11-03 12:32:12,954 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 441 transitions, 3416 flow
[2023-11-03 12:32:12,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:32:12,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:32:12,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions.
[2023-11-03 12:32:12,956 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6201550387596899
[2023-11-03 12:32:12,956 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 800 transitions.
[2023-11-03 12:32:12,956 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions.
[2023-11-03 12:32:12,956 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:32:12,956 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions.
[2023-11-03 12:32:12,957 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-03 12:32:12,958 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-03 12:32:12,959 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-03 12:32:12,959 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 800 transitions.
[2023-11-03 12:32:12,959 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 441 transitions, 3416 flow
[2023-11-03 12:32:12,982 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 441 transitions, 3406 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-11-03 12:32:12,986 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2023-11-03 12:32:12,986 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-03 12:32:12,986 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2023-11-03 12:32:12,986 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2023-11-03 12:32:12,987 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-03 12:32:12,987 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:32:12,987 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-03 12:32:12,987 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-03 12:32:12,987 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-03 12:32:12,987 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:32:12,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -1795788423, now seen corresponding path program 1 times
[2023-11-03 12:32:12,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:32:12,987 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997846522]
[2023-11-03 12:32:12,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:12,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:32:13,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:13,290 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-03 12:32:13,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:32:13,290 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997846522]
[2023-11-03 12:32:13,290 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997846522] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:32:13,291 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384429914]
[2023-11-03 12:32:13,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:13,291 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:32:13,291 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:32:13,292 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:32:13,294 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-11-03 12:32:13,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:13,442 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-03 12:32:13,446 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:32:13,469 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-03 12:32:13,537 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:32:13,563 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-03 12:32:13,601 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:32:13,602 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-03 12:32:13,645 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:32:13,645 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-03 12:32:13,690 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:13,691 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:32:13,700 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-03 12:32:13,700 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:32:13,798 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-03 12:32:13,915 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-03 12:32:13,916 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384429914] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:32:13,916 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:32:13,916 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23
[2023-11-03 12:32:13,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701803401]
[2023-11-03 12:32:13,916 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:32:13,917 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2023-11-03 12:32:13,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:32:13,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-11-03 12:32:13,917 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=451, Unknown=7, NotChecked=44, Total=600
[2023-11-03 12:32:13,958 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 215
[2023-11-03 12:32:13,959 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 25 states, 25 states have (on average 67.84) internal successors, (1696), 25 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:13,959 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:32:13,960 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 215
[2023-11-03 12:32:13,960 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:32:20,590 INFO  L130       PetriNetUnfolder]: 17059/27855 cut-off events.
[2023-11-03 12:32:20,590 INFO  L131       PetriNetUnfolder]: For 54148/54154 co-relation queries the response was YES.
[2023-11-03 12:32:20,661 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 113331 conditions, 27855 events. 17059/27855 cut-off events. For 54148/54154 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 194158 event pairs, 4731 based on Foata normal form. 6/25308 useless extension candidates. Maximal degree in co-relation 75608. Up to 19388 conditions per place. 
[2023-11-03 12:32:20,768 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 551 selfloop transitions, 440 changer transitions 1/995 dead transitions.
[2023-11-03 12:32:20,768 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 995 transitions, 9034 flow
[2023-11-03 12:32:20,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-03 12:32:20,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-03 12:32:20,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1684 transitions.
[2023-11-03 12:32:20,771 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.41223990208078337
[2023-11-03 12:32:20,771 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1684 transitions.
[2023-11-03 12:32:20,771 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1684 transitions.
[2023-11-03 12:32:20,771 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:32:20,771 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1684 transitions.
[2023-11-03 12:32:20,773 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 88.63157894736842) internal successors, (1684), 19 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:20,776 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-03 12:32:20,776 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-03 12:32:20,776 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 19 states and 1684 transitions.
[2023-11-03 12:32:20,777 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 995 transitions, 9034 flow
[2023-11-03 12:32:21,314 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 995 transitions, 8884 flow, removed 75 selfloop flow, removed 0 redundant places.
[2023-11-03 12:32:21,324 INFO  L231             Difference]: Finished difference. Result has 129 places, 727 transitions, 7651 flow
[2023-11-03 12:32:21,324 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7651, PETRI_PLACES=129, PETRI_TRANSITIONS=727}
[2023-11-03 12:32:21,325 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 58 predicate places.
[2023-11-03 12:32:21,325 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 727 transitions, 7651 flow
[2023-11-03 12:32:21,325 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 67.84) internal successors, (1696), 25 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:21,325 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:32:21,325 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-03 12:32:21,332 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-11-03 12:32:21,526 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-03 12:32:21,527 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-03 12:32:21,527 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:32:21,528 INFO  L85        PathProgramCache]: Analyzing trace with hash 405194917, now seen corresponding path program 1 times
[2023-11-03 12:32:21,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:32:21,528 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314291440]
[2023-11-03 12:32:21,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:21,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:32:21,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:21,831 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-03 12:32:21,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:32:21,831 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314291440]
[2023-11-03 12:32:21,832 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314291440] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:32:21,832 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784114388]
[2023-11-03 12:32:21,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:21,832 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:32:21,832 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:32:21,833 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:32:21,836 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-11-03 12:32:21,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:21,977 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-03 12:32:21,979 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:32:22,005 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-03 12:32:22,121 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:32:22,149 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:22,150 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:32:22,195 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:22,196 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:22,196 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:32:22,246 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:22,247 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:22,248 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:22,249 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:32:22,297 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:22,298 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:32:22,333 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-03 12:32:22,333 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:32:22,355 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-03 12:32:22,494 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-03 12:32:22,598 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-03 12:32:22,598 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784114388] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:32:22,598 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:32:22,598 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-11-03 12:32:22,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990020064]
[2023-11-03 12:32:22,598 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:32:22,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-11-03 12:32:22,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:32:22,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-11-03 12:32:22,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=489, Unknown=11, NotChecked=94, Total=702
[2023-11-03 12:32:22,658 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 215
[2023-11-03 12:32:22,660 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 727 transitions, 7651 flow. Second operand  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:22,660 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:32:22,661 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 215
[2023-11-03 12:32:22,661 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:32:29,888 INFO  L130       PetriNetUnfolder]: 19905/32868 cut-off events.
[2023-11-03 12:32:29,888 INFO  L131       PetriNetUnfolder]: For 121458/121466 co-relation queries the response was YES.
[2023-11-03 12:32:30,010 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 170450 conditions, 32868 events. 19905/32868 cut-off events. For 121458/121466 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 236537 event pairs, 3283 based on Foata normal form. 254/30257 useless extension candidates. Maximal degree in co-relation 149719. Up to 16549 conditions per place. 
[2023-11-03 12:32:30,137 INFO  L137   encePairwiseOnDemand]: 185/215 looper letters, 974 selfloop transitions, 520 changer transitions 0/1497 dead transitions.
[2023-11-03 12:32:30,138 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1497 transitions, 17648 flow
[2023-11-03 12:32:30,138 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-11-03 12:32:30,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-11-03 12:32:30,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions.
[2023-11-03 12:32:30,140 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.40174418604651163
[2023-11-03 12:32:30,140 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1382 transitions.
[2023-11-03 12:32:30,140 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1382 transitions.
[2023-11-03 12:32:30,140 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:32:30,140 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1382 transitions.
[2023-11-03 12:32:30,142 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-03 12:32:30,144 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-03 12:32:30,145 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-03 12:32:30,145 INFO  L175             Difference]: Start difference. First operand has 129 places, 727 transitions, 7651 flow. Second operand 16 states and 1382 transitions.
[2023-11-03 12:32:30,145 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 1497 transitions, 17648 flow
[2023-11-03 12:32:31,998 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 1497 transitions, 17381 flow, removed 132 selfloop flow, removed 1 redundant places.
[2023-11-03 12:32:32,014 INFO  L231             Difference]: Finished difference. Result has 150 places, 1033 transitions, 13043 flow
[2023-11-03 12:32:32,015 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=7541, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=13043, PETRI_PLACES=150, PETRI_TRANSITIONS=1033}
[2023-11-03 12:32:32,015 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 79 predicate places.
[2023-11-03 12:32:32,016 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 1033 transitions, 13043 flow
[2023-11-03 12:32:32,016 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-03 12:32:32,016 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:32:32,016 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-03 12:32:32,024 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-03 12:32:32,217 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-03 12:32:32,217 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 12:32:32,218 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:32:32,218 INFO  L85        PathProgramCache]: Analyzing trace with hash -1730679491, now seen corresponding path program 1 times
[2023-11-03 12:32:32,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:32:32,219 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095214589]
[2023-11-03 12:32:32,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:32,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:32:32,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:32,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:32,280 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:32:32,280 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095214589]
[2023-11-03 12:32:32,280 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095214589] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:32:32,280 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323429112]
[2023-11-03 12:32:32,280 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:32,280 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:32:32,280 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:32:32,282 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:32:32,284 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-03 12:32:32,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:32,423 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-03 12:32:32,424 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:32:32,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:32,471 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:32:32,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:32,527 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [323429112] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:32:32,527 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:32:32,527 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2023-11-03 12:32:32,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715290291]
[2023-11-03 12:32:32,527 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:32:32,528 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-03 12:32:32,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:32:32,528 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-03 12:32:32,528 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2023-11-03 12:32:32,611 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 215
[2023-11-03 12:32:32,611 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 1033 transitions, 13043 flow. Second operand  has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:32,612 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:32:32,612 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 215
[2023-11-03 12:32:32,612 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:32:33,784 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([571] L1018-7-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_211| v_threadThread2of2ForFork0_~t~0.base_29))) (and (= |v_threadThread2of2ForFork0_#res.base_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ v_threadThread2of2ForFork0_~t~0.offset_29 1))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 3 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#res.offset_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 2 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 v_threadThread2of2ForFork0_~t~0.offset_29))))  InVars {#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_28|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29}  OutVars{#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#res.offset=|v_threadThread2of2ForFork0_#res.offset_9|, threadThread2of2ForFork0_#t~nondet3=|v_threadThread2of2ForFork0_#t~nondet3_15|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29, threadThread2of2ForFork0_#res.base=|v_threadThread2of2ForFork0_#res.base_9|}  AuxVars[]  AssignedVars[threadThread2of2ForFork0_#res.offset, threadThread2of2ForFork0_#t~nondet4, threadThread2of2ForFork0_#t~nondet3, threadThread2of2ForFork0_#res.base][272], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 60#L1029-5true, Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 47#threadEXITtrue, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), 756#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), 5#threadEXITtrue, Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-11-03 12:32:33,784 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-11-03 12:32:33,784 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 12:32:33,785 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 12:32:33,785 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-11-03 12:32:33,970 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([571] L1018-7-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_211| v_threadThread2of2ForFork0_~t~0.base_29))) (and (= |v_threadThread2of2ForFork0_#res.base_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ v_threadThread2of2ForFork0_~t~0.offset_29 1))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 3 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#res.offset_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 2 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 v_threadThread2of2ForFork0_~t~0.offset_29))))  InVars {#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_28|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29}  OutVars{#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#res.offset=|v_threadThread2of2ForFork0_#res.offset_9|, threadThread2of2ForFork0_#t~nondet3=|v_threadThread2of2ForFork0_#t~nondet3_15|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29, threadThread2of2ForFork0_#res.base=|v_threadThread2of2ForFork0_#res.base_9|}  AuxVars[]  AssignedVars[threadThread2of2ForFork0_#res.offset, threadThread2of2ForFork0_#t~nondet4, threadThread2of2ForFork0_#t~nondet3, threadThread2of2ForFork0_#res.base][272], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 47#threadEXITtrue, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), 756#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 71#L1030-1true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), 5#threadEXITtrue, Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-11-03 12:32:33,971 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-11-03 12:32:33,971 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 12:32:33,971 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 12:32:33,971 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-11-03 12:32:34,190 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L1018-2-->L1018-4: Formula: (= (store |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19 (store (select |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19) v_threadThread2of2ForFork0_~t~0.offset_19 |v_threadThread2of2ForFork0_#t~nondet4_19|)) |v_#race_191|)  InVars {#race=|v_#race_192|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  OutVars{#race=|v_#race_191|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_19|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][227], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 114#L1018-4true, Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 102#L1018-7true, 91#L1027-11true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 754#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-11-03 12:32:34,190 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-11-03 12:32:34,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 12:32:34,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 12:32:34,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-11-03 12:32:34,334 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L1018-2-->L1018-4: Formula: (= (store |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19 (store (select |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19) v_threadThread2of2ForFork0_~t~0.offset_19 |v_threadThread2of2ForFork0_#t~nondet4_19|)) |v_#race_191|)  InVars {#race=|v_#race_192|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  OutVars{#race=|v_#race_191|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_19|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][227], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 114#L1018-4true, Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 102#L1018-7true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 754#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 21#L1027-12true, 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-11-03 12:32:34,334 INFO  L383   tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event
[2023-11-03 12:32:34,334 INFO  L386   tUnfolder$Statistics]:   existing Event has 50 ancestors and is cut-off event
[2023-11-03 12:32:34,334 INFO  L386   tUnfolder$Statistics]:   existing Event has 50 ancestors and is cut-off event
[2023-11-03 12:32:34,334 INFO  L386   tUnfolder$Statistics]:   existing Event has 50 ancestors and is cut-off event
[2023-11-03 12:32:35,511 INFO  L130       PetriNetUnfolder]: 8983/17386 cut-off events.
[2023-11-03 12:32:35,511 INFO  L131       PetriNetUnfolder]: For 96850/101238 co-relation queries the response was YES.
[2023-11-03 12:32:35,574 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88452 conditions, 17386 events. 8983/17386 cut-off events. For 96850/101238 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 139766 event pairs, 1459 based on Foata normal form. 804/17245 useless extension candidates. Maximal degree in co-relation 81369. Up to 6267 conditions per place. 
[2023-11-03 12:32:35,647 INFO  L137   encePairwiseOnDemand]: 209/215 looper letters, 199 selfloop transitions, 9 changer transitions 18/947 dead transitions.
[2023-11-03 12:32:35,647 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 947 transitions, 12139 flow
[2023-11-03 12:32:35,648 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:32:35,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:32:35,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 772 transitions.
[2023-11-03 12:32:35,649 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5984496124031008
[2023-11-03 12:32:35,649 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 772 transitions.
[2023-11-03 12:32:35,650 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 772 transitions.
[2023-11-03 12:32:35,650 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:32:35,650 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 772 transitions.
[2023-11-03 12:32:35,651 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:35,652 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-03 12:32:35,652 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-03 12:32:35,652 INFO  L175             Difference]: Start difference. First operand has 150 places, 1033 transitions, 13043 flow. Second operand 6 states and 772 transitions.
[2023-11-03 12:32:35,652 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 947 transitions, 12139 flow
[2023-11-03 12:32:36,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 947 transitions, 11957 flow, removed 72 selfloop flow, removed 5 redundant places.
[2023-11-03 12:32:36,466 INFO  L231             Difference]: Finished difference. Result has 152 places, 881 transitions, 10765 flow
[2023-11-03 12:32:36,467 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=10904, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10765, PETRI_PLACES=152, PETRI_TRANSITIONS=881}
[2023-11-03 12:32:36,467 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 81 predicate places.
[2023-11-03 12:32:36,467 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 881 transitions, 10765 flow
[2023-11-03 12:32:36,468 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:36,468 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:32:36,468 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-03 12:32:36,476 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2023-11-03 12:32:36,668 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-03 12:32:36,669 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-03 12:32:36,670 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:32:36,670 INFO  L85        PathProgramCache]: Analyzing trace with hash 84688353, now seen corresponding path program 1 times
[2023-11-03 12:32:36,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:32:36,670 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678383734]
[2023-11-03 12:32:36,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:36,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:32:36,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:36,949 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:36,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:32:36,950 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678383734]
[2023-11-03 12:32:36,950 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678383734] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:32:36,950 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246615802]
[2023-11-03 12:32:36,950 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:36,950 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:32:36,950 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:32:36,951 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-03 12:32:36,954 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-03 12:32:37,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:37,084 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-03 12:32:37,087 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:32:37,109 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-03 12:32:37,168 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:32:37,193 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-03 12:32:37,235 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:32:37,235 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-03 12:32:37,277 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:32:37,278 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-03 12:32:37,330 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:37,331 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:32:37,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:37,341 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:32:37,357 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2023-11-03 12:32:37,402 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2023-11-03 12:32:37,421 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-03 12:32:37,524 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-03 12:32:37,525 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [246615802] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:32:37,525 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:32:37,525 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-11-03 12:32:37,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019208963]
[2023-11-03 12:32:37,525 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:32:37,526 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-03 12:32:37,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:32:37,526 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-03 12:32:37,526 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-11-03 12:32:37,680 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 215
[2023-11-03 12:32:37,682 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 881 transitions, 10765 flow. Second operand  has 26 states, 26 states have (on average 64.8076923076923) internal successors, (1685), 26 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:37,682 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:32:37,682 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 215
[2023-11-03 12:32:37,682 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:32:47,542 INFO  L130       PetriNetUnfolder]: 17230/28784 cut-off events.
[2023-11-03 12:32:47,543 INFO  L131       PetriNetUnfolder]: For 145653/145659 co-relation queries the response was YES.
[2023-11-03 12:32:47,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 162156 conditions, 28784 events. 17230/28784 cut-off events. For 145653/145659 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 205325 event pairs, 3822 based on Foata normal form. 6/26614 useless extension candidates. Maximal degree in co-relation 155020. Up to 19262 conditions per place. 
[2023-11-03 12:32:47,764 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 874 selfloop transitions, 671 changer transitions 8/1556 dead transitions.
[2023-11-03 12:32:47,764 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1556 transitions, 19935 flow
[2023-11-03 12:32:47,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-03 12:32:47,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-03 12:32:47,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1659 transitions.
[2023-11-03 12:32:47,767 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.40611995104039167
[2023-11-03 12:32:47,767 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1659 transitions.
[2023-11-03 12:32:47,767 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1659 transitions.
[2023-11-03 12:32:47,767 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:32:47,767 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1659 transitions.
[2023-11-03 12:32:47,769 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 87.3157894736842) internal successors, (1659), 19 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:47,772 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-03 12:32:47,772 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-03 12:32:47,773 INFO  L175             Difference]: Start difference. First operand has 152 places, 881 transitions, 10765 flow. Second operand 19 states and 1659 transitions.
[2023-11-03 12:32:47,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1556 transitions, 19935 flow
[2023-11-03 12:32:49,136 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1556 transitions, 19503 flow, removed 6 selfloop flow, removed 5 redundant places.
[2023-11-03 12:32:49,153 INFO  L231             Difference]: Finished difference. Result has 170 places, 1268 transitions, 17043 flow
[2023-11-03 12:32:49,154 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=10362, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=17043, PETRI_PLACES=170, PETRI_TRANSITIONS=1268}
[2023-11-03 12:32:49,154 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 99 predicate places.
[2023-11-03 12:32:49,154 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 1268 transitions, 17043 flow
[2023-11-03 12:32:49,155 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.8076923076923) internal successors, (1685), 26 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:49,155 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:32:49,155 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-03 12:32:49,163 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2023-11-03 12:32:49,355 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-03 12:32:49,356 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 12:32:49,357 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:32:49,357 INFO  L85        PathProgramCache]: Analyzing trace with hash 1752528282, now seen corresponding path program 1 times
[2023-11-03 12:32:49,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:32:49,358 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392392066]
[2023-11-03 12:32:49,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:49,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:32:49,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:49,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:49,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:32:49,663 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392392066]
[2023-11-03 12:32:49,663 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392392066] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:32:49,663 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925461662]
[2023-11-03 12:32:49,663 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:32:49,663 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:32:49,664 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:32:49,665 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-03 12:32:49,667 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-03 12:32:49,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:32:49,809 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-03 12:32:49,812 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:32:49,842 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-03 12:32:49,947 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:32:49,980 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:49,981 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:32:50,018 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:50,019 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:50,020 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:32:50,071 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:50,072 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:50,073 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:50,074 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:32:50,133 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:32:50,134 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:32:50,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:50,169 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:32:50,400 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2023-11-03 12:32:50,418 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))) is different from false
[2023-11-03 12:32:50,435 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:32:50,435 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-11-03 12:32:50,439 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:32:50,439 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2023-11-03 12:32:50,442 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2023-11-03 12:32:50,449 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:32:50,450 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-11-03 12:32:50,455 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:32:50,455 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 12:32:50,460 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:32:50,460 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 12:32:50,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:32:50,541 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [925461662] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:32:50,541 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:32:50,541 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26
[2023-11-03 12:32:50,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127091670]
[2023-11-03 12:32:50,542 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:32:50,543 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-11-03 12:32:50,543 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:32:50,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-11-03 12:32:50,544 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=525, Unknown=22, NotChecked=98, Total=756
[2023-11-03 12:32:50,774 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 215
[2023-11-03 12:32:50,776 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 1268 transitions, 17043 flow. Second operand  has 28 states, 28 states have (on average 66.60714285714286) internal successors, (1865), 28 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:32:50,776 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:32:50,776 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 215
[2023-11-03 12:32:50,777 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:33:01,322 INFO  L130       PetriNetUnfolder]: 20037/33573 cut-off events.
[2023-11-03 12:33:01,322 INFO  L131       PetriNetUnfolder]: For 242114/242124 co-relation queries the response was YES.
[2023-11-03 12:33:01,525 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 231238 conditions, 33573 events. 20037/33573 cut-off events. For 242114/242124 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 247554 event pairs, 2351 based on Foata normal form. 408/32242 useless extension candidates. Maximal degree in co-relation 195838. Up to 14770 conditions per place. 
[2023-11-03 12:33:01,686 INFO  L137   encePairwiseOnDemand]: 178/215 looper letters, 1396 selfloop transitions, 812 changer transitions 2/2213 dead transitions.
[2023-11-03 12:33:01,686 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 2213 transitions, 33212 flow
[2023-11-03 12:33:01,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-11-03 12:33:01,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-11-03 12:33:01,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1327 transitions.
[2023-11-03 12:33:01,688 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38575581395348835
[2023-11-03 12:33:01,689 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1327 transitions.
[2023-11-03 12:33:01,689 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1327 transitions.
[2023-11-03 12:33:01,689 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:33:01,689 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1327 transitions.
[2023-11-03 12:33:01,691 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 82.9375) internal successors, (1327), 16 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:33:01,693 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-03 12:33:01,693 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-03 12:33:01,694 INFO  L175             Difference]: Start difference. First operand has 170 places, 1268 transitions, 17043 flow. Second operand 16 states and 1327 transitions.
[2023-11-03 12:33:01,694 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 2213 transitions, 33212 flow
[2023-11-03 12:33:07,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 2213 transitions, 32536 flow, removed 316 selfloop flow, removed 9 redundant places.
[2023-11-03 12:33:07,032 INFO  L231             Difference]: Finished difference. Result has 184 places, 1755 transitions, 27082 flow
[2023-11-03 12:33:07,034 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=16793, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=27082, PETRI_PLACES=184, PETRI_TRANSITIONS=1755}
[2023-11-03 12:33:07,034 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 113 predicate places.
[2023-11-03 12:33:07,035 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 1755 transitions, 27082 flow
[2023-11-03 12:33:07,035 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 66.60714285714286) internal successors, (1865), 28 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:33:07,035 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:33:07,036 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-03 12:33:07,045 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-03 12:33:07,236 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:33:07,237 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 12:33:07,238 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:33:07,238 INFO  L85        PathProgramCache]: Analyzing trace with hash -1139698224, now seen corresponding path program 1 times
[2023-11-03 12:33:07,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:33:07,238 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565899416]
[2023-11-03 12:33:07,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:33:07,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:33:07,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:33:07,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 12:33:07,437 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:33:07,437 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565899416]
[2023-11-03 12:33:07,437 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565899416] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:33:07,437 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:33:07,437 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:33:07,437 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332297910]
[2023-11-03 12:33:07,438 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:33:07,438 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:33:07,438 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:33:07,438 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:33:07,438 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:33:07,792 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 215
[2023-11-03 12:33:07,793 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 1755 transitions, 27082 flow. Second operand  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:33:07,793 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:33:07,793 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 215
[2023-11-03 12:33:07,793 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:33:16,063 INFO  L130       PetriNetUnfolder]: 17500/30900 cut-off events.
[2023-11-03 12:33:16,064 INFO  L131       PetriNetUnfolder]: For 332725/340692 co-relation queries the response was YES.
[2023-11-03 12:33:16,224 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 223929 conditions, 30900 events. 17500/30900 cut-off events. For 332725/340692 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 244192 event pairs, 3013 based on Foata normal form. 866/30828 useless extension candidates. Maximal degree in co-relation 184179. Up to 19203 conditions per place. 
[2023-11-03 12:33:16,371 INFO  L137   encePairwiseOnDemand]: 200/215 looper letters, 1313 selfloop transitions, 176 changer transitions 1/1942 dead transitions.
[2023-11-03 12:33:16,371 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1942 transitions, 33000 flow
[2023-11-03 12:33:16,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:33:16,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:33:16,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-11-03 12:33:16,373 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5961240310077519
[2023-11-03 12:33:16,373 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-11-03 12:33:16,373 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-11-03 12:33:16,374 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:33:16,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-11-03 12:33:16,375 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-03 12:33:16,376 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-03 12:33:16,376 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-03 12:33:16,376 INFO  L175             Difference]: Start difference. First operand has 184 places, 1755 transitions, 27082 flow. Second operand 6 states and 769 transitions.
[2023-11-03 12:33:16,376 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1942 transitions, 33000 flow
[2023-11-03 12:33:20,596 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 1942 transitions, 32655 flow, removed 155 selfloop flow, removed 6 redundant places.
[2023-11-03 12:33:20,624 INFO  L231             Difference]: Finished difference. Result has 188 places, 1914 transitions, 30208 flow
[2023-11-03 12:33:20,625 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=26761, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=30208, PETRI_PLACES=188, PETRI_TRANSITIONS=1914}
[2023-11-03 12:33:20,626 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 117 predicate places.
[2023-11-03 12:33:20,626 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 1914 transitions, 30208 flow
[2023-11-03 12:33:20,626 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-03 12:33:20,626 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:33:20,626 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-03 12:33:20,626 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-11-03 12:33:20,627 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-03 12:33:20,627 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:33:20,627 INFO  L85        PathProgramCache]: Analyzing trace with hash 370424642, now seen corresponding path program 2 times
[2023-11-03 12:33:20,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:33:20,627 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142175697]
[2023-11-03 12:33:20,627 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:33:20,628 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:33:20,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:33:21,055 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-03 12:33:21,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:33:21,056 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142175697]
[2023-11-03 12:33:21,056 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142175697] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:33:21,056 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300136073]
[2023-11-03 12:33:21,056 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 12:33:21,057 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:33:21,057 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:33:21,058 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-03 12:33:21,060 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-03 12:33:21,218 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 12:33:21,218 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:33:21,220 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-11-03 12:33:21,223 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:33:21,265 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-03 12:33:21,267 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-03 12:33:21,433 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:33:21,471 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,471 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:33:21,546 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,547 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,548 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 12:33:21,601 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,602 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,603 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,604 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 12:33:21,661 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,662 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:33:21,686 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,687 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:33:21,711 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,712 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:33:21,738 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,739 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:33:21,814 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:21,815 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:33:21,857 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-03 12:33:21,857 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:33:21,875 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1726 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-11-03 12:33:21,914 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-03 12:33:21,986 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-03 12:33:22,005 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-11-03 12:33:22,061 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-03 12:33:22,078 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:33:22,079 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-03 12:33:22,085 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:33:22,085 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 130
[2023-11-03 12:33:22,090 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86
[2023-11-03 12:33:22,092 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78
[2023-11-03 12:33:22,125 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:33:22,125 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-03 12:33:22,132 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:33:22,133 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-03 12:33:22,142 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:33:22,143 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-03 12:33:22,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2023-11-03 12:33:22,186 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300136073] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:33:22,186 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:33:22,186 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26
[2023-11-03 12:33:22,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931448020]
[2023-11-03 12:33:22,187 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:33:22,187 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-11-03 12:33:22,187 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:33:22,188 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-11-03 12:33:22,188 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=417, Unknown=5, NotChecked=230, Total=756
[2023-11-03 12:33:22,361 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 215
[2023-11-03 12:33:22,362 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1914 transitions, 30208 flow. Second operand  has 28 states, 28 states have (on average 60.17857142857143) internal successors, (1685), 28 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:33:22,362 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:33:22,362 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 215
[2023-11-03 12:33:22,362 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:33:41,260 INFO  L130       PetriNetUnfolder]: 21616/36166 cut-off events.
[2023-11-03 12:33:41,260 INFO  L131       PetriNetUnfolder]: For 381904/381919 co-relation queries the response was YES.
[2023-11-03 12:33:41,528 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 282319 conditions, 36166 events. 21616/36166 cut-off events. For 381904/381919 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 269577 event pairs, 2431 based on Foata normal form. 404/34964 useless extension candidates. Maximal degree in co-relation 243035. Up to 20201 conditions per place. 
[2023-11-03 12:33:41,713 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 1198 selfloop transitions, 1545 changer transitions 46/2793 dead transitions.
[2023-11-03 12:33:41,713 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 2793 transitions, 47112 flow
[2023-11-03 12:33:41,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-11-03 12:33:41,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-11-03 12:33:41,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1632 transitions.
[2023-11-03 12:33:41,716 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37953488372093025
[2023-11-03 12:33:41,716 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1632 transitions.
[2023-11-03 12:33:41,716 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1632 transitions.
[2023-11-03 12:33:41,717 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:33:41,717 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1632 transitions.
[2023-11-03 12:33:41,719 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 81.6) internal successors, (1632), 20 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:33:41,722 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-03 12:33:41,722 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-03 12:33:41,722 INFO  L175             Difference]: Start difference. First operand has 188 places, 1914 transitions, 30208 flow. Second operand 20 states and 1632 transitions.
[2023-11-03 12:33:41,722 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 2793 transitions, 47112 flow
[2023-11-03 12:33:48,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 2793 transitions, 46872 flow, removed 120 selfloop flow, removed 0 redundant places.
[2023-11-03 12:33:48,543 INFO  L231             Difference]: Finished difference. Result has 214 places, 2271 transitions, 41225 flow
[2023-11-03 12:33:48,544 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=29974, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=41225, PETRI_PLACES=214, PETRI_TRANSITIONS=2271}
[2023-11-03 12:33:48,545 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 143 predicate places.
[2023-11-03 12:33:48,545 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 2271 transitions, 41225 flow
[2023-11-03 12:33:48,545 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 60.17857142857143) internal successors, (1685), 28 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:33:48,545 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:33:48,545 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-03 12:33:48,553 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-03 12:33:48,746 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-03 12:33:48,747 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-03 12:33:48,747 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:33:48,748 INFO  L85        PathProgramCache]: Analyzing trace with hash -614487279, now seen corresponding path program 1 times
[2023-11-03 12:33:48,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:33:48,748 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102727135]
[2023-11-03 12:33:48,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:33:48,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:33:48,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:33:49,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:33:49,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:33:49,487 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102727135]
[2023-11-03 12:33:49,487 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102727135] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:33:49,488 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870072042]
[2023-11-03 12:33:49,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:33:49,488 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:33:49,488 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:33:49,490 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-03 12:33:49,493 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-03 12:33:49,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:33:49,656 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core
[2023-11-03 12:33:49,661 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:33:49,680 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:49,682 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:49,685 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:33:49,692 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-11-03 12:33:49,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19
[2023-11-03 12:33:50,142 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 12:33:50,142 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 62
[2023-11-03 12:33:50,311 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-11-03 12:33:50,312 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-03 12:33:50,379 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-03 12:33:50,414 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:33:50,461 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:33:50,462 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-03 12:33:50,521 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:33:50,521 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-03 12:33:50,576 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:33:50,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:33:50,588 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:33:50,613 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-03 12:33:50,801 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-11-03 12:33:50,820 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-11-03 12:33:50,857 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:33:50,858 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-03 12:33:50,866 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:33:50,867 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 30
[2023-11-03 12:33:50,875 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:33:50,876 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 12:33:50,884 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:33:50,884 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 12:33:50,892 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 12:33:50,892 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-03 12:33:50,975 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1853) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2023-11-03 12:33:51,001 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1853) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2023-11-03 12:33:51,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:33:51,064 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [870072042] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:33:51,065 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:33:51,065 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33
[2023-11-03 12:33:51,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018405872]
[2023-11-03 12:33:51,065 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:33:51,066 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2023-11-03 12:33:51,066 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:33:51,067 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2023-11-03 12:33:51,067 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=743, Unknown=18, NotChecked=300, Total=1190
[2023-11-03 12:33:51,307 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 215
[2023-11-03 12:33:51,308 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 2271 transitions, 41225 flow. Second operand  has 35 states, 35 states have (on average 47.51428571428571) internal successors, (1663), 35 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:33:51,308 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:33:51,308 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 215
[2023-11-03 12:33:51,308 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:34:32,966 INFO  L130       PetriNetUnfolder]: 48424/80394 cut-off events.
[2023-11-03 12:34:32,967 INFO  L131       PetriNetUnfolder]: For 1227482/1227482 co-relation queries the response was YES.
[2023-11-03 12:34:33,655 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 716280 conditions, 80394 events. 48424/80394 cut-off events. For 1227482/1227482 co-relation queries the response was YES. Maximal size of possible extension queue 2102. Compared 661659 event pairs, 7475 based on Foata normal form. 229/77110 useless extension candidates. Maximal degree in co-relation 671082. Up to 35860 conditions per place. 
[2023-11-03 12:34:34,106 INFO  L137   encePairwiseOnDemand]: 179/215 looper letters, 5600 selfloop transitions, 714 changer transitions 31/6346 dead transitions.
[2023-11-03 12:34:34,106 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 6346 transitions, 122891 flow
[2023-11-03 12:34:34,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2023-11-03 12:34:34,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2023-11-03 12:34:34,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2262 transitions.
[2023-11-03 12:34:34,110 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.28434946574481457
[2023-11-03 12:34:34,110 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 2262 transitions.
[2023-11-03 12:34:34,110 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 2262 transitions.
[2023-11-03 12:34:34,111 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:34:34,111 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2262 transitions.
[2023-11-03 12:34:34,113 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 61.13513513513514) internal successors, (2262), 37 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:34:34,119 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 215.0) internal successors, (8170), 38 states have internal predecessors, (8170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:34:34,119 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 215.0) internal successors, (8170), 38 states have internal predecessors, (8170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:34:34,119 INFO  L175             Difference]: Start difference. First operand has 214 places, 2271 transitions, 41225 flow. Second operand 37 states and 2262 transitions.
[2023-11-03 12:34:34,120 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 6346 transitions, 122891 flow
[2023-11-03 12:35:17,705 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 6346 transitions, 122090 flow, removed 353 selfloop flow, removed 12 redundant places.
[2023-11-03 12:35:17,777 INFO  L231             Difference]: Finished difference. Result has 260 places, 2973 transitions, 57232 flow
[2023-11-03 12:35:17,779 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=40843, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=57232, PETRI_PLACES=260, PETRI_TRANSITIONS=2973}
[2023-11-03 12:35:17,779 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 189 predicate places.
[2023-11-03 12:35:17,780 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 2973 transitions, 57232 flow
[2023-11-03 12:35:17,780 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 47.51428571428571) internal successors, (1663), 35 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:35:17,780 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:35:17,780 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-03 12:35:17,789 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-03 12:35:17,981 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-03 12:35:17,982 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-03 12:35:17,983 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:35:17,983 INFO  L85        PathProgramCache]: Analyzing trace with hash 564881149, now seen corresponding path program 2 times
[2023-11-03 12:35:17,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:35:17,983 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317699427]
[2023-11-03 12:35:17,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:35:17,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:35:18,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:35:18,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:35:18,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:35:18,544 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317699427]
[2023-11-03 12:35:18,544 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317699427] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:35:18,545 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094113497]
[2023-11-03 12:35:18,545 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 12:35:18,545 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:35:18,545 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:35:18,546 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-03 12:35:18,548 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-03 12:35:18,715 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 12:35:18,716 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:35:18,718 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 77 conjunts are in the unsatisfiable core
[2023-11-03 12:35:18,722 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:35:18,749 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:18,752 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:18,762 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-11-03 12:35:18,762 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27
[2023-11-03 12:35:19,285 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-11-03 12:35:19,285 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 66
[2023-11-03 12:35:19,295 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:19,307 INFO  L321             Elim1Store]: treesize reduction 15, result has 46.4 percent of original size
[2023-11-03 12:35:19,308 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 43
[2023-11-03 12:35:19,315 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:35:19,334 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22
[2023-11-03 12:35:19,695 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-11-03 12:35:19,696 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 85
[2023-11-03 12:35:19,733 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-11-03 12:35:19,733 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 84
[2023-11-03 12:35:19,753 WARN  L207             Elim1Store]: Array PQE input equivalent to false
[2023-11-03 12:35:19,944 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:35:20,209 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-03 12:35:20,549 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:35:20,549 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 63
[2023-11-03 12:35:20,566 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:35:20,566 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 54
[2023-11-03 12:35:20,745 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:20,747 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:20,748 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-03 12:35:20,822 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:20,823 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2023-11-03 12:35:20,850 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:20,851 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:20,852 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:20,853 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-03 12:35:20,929 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:20,930 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:35:20,951 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:20,952 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:35:20,992 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:20,993 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-03 12:35:21,097 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:21,098 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:21,099 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:35:21,100 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-11-03 12:35:21,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:35:21,150 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:35:21,296 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2023-11-03 12:35:21,755 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select .cse7 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-11-03 12:35:23,127 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse11 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse11 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse6))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse8 c_threadThread1of2ForFork0_~t~0.base (store (select .cse8 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (let ((.cse10 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse10 c_threadThread1of2ForFork0_~t~0.base (store (select .cse10 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse11))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse12 (store (let ((.cse13 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse13 c_threadThread1of2ForFork0_~t~0.base (store (select .cse13 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse12 .cse1 (store (select .cse12 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-11-03 12:35:23,208 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:35:23,208 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-11-03 12:35:23,228 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:35:23,229 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3880 treesize of output 3572
[2023-11-03 12:35:23,278 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3998 treesize of output 3782
[2023-11-03 12:35:23,302 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4149 treesize of output 3997
[2023-11-03 12:35:29,310 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9
[2023-11-03 12:35:29,326 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:35:29,326 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-11-03 12:35:29,331 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:35:29,351 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:35:29,352 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2266 treesize of output 2014
[2023-11-03 12:35:29,374 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2310 treesize of output 2246
[2023-11-03 12:35:29,392 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1189 treesize of output 1173
[2023-11-03 12:35:29,410 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 2514 treesize of output 2134
[2023-11-03 12:35:29,665 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:35:29,665 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-11-03 12:35:29,669 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:35:29,687 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:35:29,687 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1900 treesize of output 1776
[2023-11-03 12:35:29,713 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 942 treesize of output 910
[2023-11-03 12:35:29,723 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 932 treesize of output 822
[2023-11-03 12:35:29,854 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:35:29,855 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 94
[2023-11-03 12:35:29,857 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:35:29,870 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:35:29,871 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 580 treesize of output 514
[2023-11-03 12:35:29,882 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 259
[2023-11-03 12:35:29,889 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 562 treesize of output 446
[2023-11-03 12:35:29,902 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 346
[2023-11-03 12:35:41,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:35:41,830 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094113497] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:35:41,830 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:35:41,830 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 42
[2023-11-03 12:35:41,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797878846]
[2023-11-03 12:35:41,831 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:35:41,832 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2023-11-03 12:35:41,832 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:35:41,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2023-11-03 12:35:41,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1412, Unknown=49, NotChecked=240, Total=1892
[2023-11-03 12:35:42,728 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 215
[2023-11-03 12:35:42,730 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 2973 transitions, 57232 flow. Second operand  has 44 states, 44 states have (on average 51.15909090909091) internal successors, (2251), 44 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:35:42,730 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:35:42,730 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 215
[2023-11-03 12:35:42,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:36:48,144 INFO  L130       PetriNetUnfolder]: 48765/81117 cut-off events.
[2023-11-03 12:36:48,145 INFO  L131       PetriNetUnfolder]: For 1758909/1758909 co-relation queries the response was YES.
[2023-11-03 12:36:49,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 807474 conditions, 81117 events. 48765/81117 cut-off events. For 1758909/1758909 co-relation queries the response was YES. Maximal size of possible extension queue 2081. Compared 668288 event pairs, 10130 based on Foata normal form. 48/77652 useless extension candidates. Maximal degree in co-relation 777665. Up to 77151 conditions per place. 
[2023-11-03 12:36:49,604 INFO  L137   encePairwiseOnDemand]: 191/215 looper letters, 3444 selfloop transitions, 170 changer transitions 128/3743 dead transitions.
[2023-11-03 12:36:49,605 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 3743 transitions, 76715 flow
[2023-11-03 12:36:49,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-11-03 12:36:49,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-11-03 12:36:49,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1346 transitions.
[2023-11-03 12:36:49,609 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2981173864894795
[2023-11-03 12:36:49,609 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1346 transitions.
[2023-11-03 12:36:49,609 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1346 transitions.
[2023-11-03 12:36:49,610 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:36:49,610 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1346 transitions.
[2023-11-03 12:36:49,611 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 64.0952380952381) internal successors, (1346), 21 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:36:49,617 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 215.0) internal successors, (4730), 22 states have internal predecessors, (4730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:36:49,618 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 215.0) internal successors, (4730), 22 states have internal predecessors, (4730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:36:49,618 INFO  L175             Difference]: Start difference. First operand has 260 places, 2973 transitions, 57232 flow. Second operand 21 states and 1346 transitions.
[2023-11-03 12:36:49,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 3743 transitions, 76715 flow
[2023-11-03 12:37:36,644 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 3743 transitions, 75551 flow, removed 580 selfloop flow, removed 2 redundant places.
[2023-11-03 12:37:36,703 INFO  L231             Difference]: Finished difference. Result has 289 places, 3129 transitions, 60163 flow
[2023-11-03 12:37:36,705 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=56296, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2831, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=60163, PETRI_PLACES=289, PETRI_TRANSITIONS=3129}
[2023-11-03 12:37:36,706 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 218 predicate places.
[2023-11-03 12:37:36,706 INFO  L495      AbstractCegarLoop]: Abstraction has has 289 places, 3129 transitions, 60163 flow
[2023-11-03 12:37:36,707 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 44 states, 44 states have (on average 51.15909090909091) internal successors, (2251), 44 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:37:36,707 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:37:36,707 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-03 12:37:36,717 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2023-11-03 12:37:36,908 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:37:36,908 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 12:37:36,909 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:37:36,909 INFO  L85        PathProgramCache]: Analyzing trace with hash 1792801883, now seen corresponding path program 3 times
[2023-11-03 12:37:36,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:37:36,910 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196284297]
[2023-11-03 12:37:36,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:37:36,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:37:36,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:37:37,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:37:37,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:37:37,450 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196284297]
[2023-11-03 12:37:37,451 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196284297] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:37:37,451 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145695180]
[2023-11-03 12:37:37,451 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-03 12:37:37,451 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:37:37,452 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:37:37,454 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:37:37,456 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2023-11-03 12:37:37,670 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-03 12:37:37,670 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:37:37,673 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 64 conjunts are in the unsatisfiable core
[2023-11-03 12:37:37,676 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:37:37,708 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:37,711 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:37,719 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-11-03 12:37:37,719 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44
[2023-11-03 12:37:38,351 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-11-03 12:37:38,352 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 66
[2023-11-03 12:37:38,382 INFO  L321             Elim1Store]: treesize reduction 23, result has 36.1 percent of original size
[2023-11-03 12:37:38,383 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 43
[2023-11-03 12:37:38,395 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:37:38,419 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22
[2023-11-03 12:37:38,853 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-11-03 12:37:38,854 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 85
[2023-11-03 12:37:38,902 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-11-03 12:37:38,902 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 84
[2023-11-03 12:37:38,982 WARN  L207             Elim1Store]: Array PQE input equivalent to false
[2023-11-03 12:37:39,273 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:37:39,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 67
[2023-11-03 12:37:39,296 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:37:39,296 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 58
[2023-11-03 12:37:39,509 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-03 12:37:39,582 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:39,583 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-03 12:37:39,645 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:39,647 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:39,648 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-03 12:37:39,738 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:39,739 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:39,740 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:39,741 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-03 12:37:39,823 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:39,825 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:39,827 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:37:39,828 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-11-03 12:37:39,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:37:39,883 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:37:41,138 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2134 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (and (or (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (+ 2 |c_threadThread1of2ForFork0_#in~arg.offset|) (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse0) (or (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ 3 |c_threadThread1of2ForFork0_#in~arg.offset|)))) .cse0) (or (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_threadThread1of2ForFork0_#in~arg.offset|))) .cse0) (or (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (+ |c_threadThread1of2ForFork0_#in~arg.offset| 1) (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse0))) is different from false
[2023-11-03 12:37:41,416 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_2134 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2132) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (or (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2131) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse0 1)))) .cse1) (or (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse0 3) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2131) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse1) (or (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2131) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse1) (or .cse1 (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2131) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse0 2))))))) is different from false
[2023-11-03 12:37:42,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:37:42,237 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145695180] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:37:42,238 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:37:42,238 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38
[2023-11-03 12:37:42,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781235084]
[2023-11-03 12:37:42,239 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:37:42,240 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2023-11-03 12:37:42,240 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:37:42,241 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2023-11-03 12:37:42,241 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1195, Unknown=21, NotChecked=146, Total=1560
[2023-11-03 12:37:42,311 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 215
[2023-11-03 12:37:42,313 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 3129 transitions, 60163 flow. Second operand  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:37:42,313 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:37:42,313 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 215
[2023-11-03 12:37:42,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:38:39,741 INFO  L130       PetriNetUnfolder]: 48780/81263 cut-off events.
[2023-11-03 12:38:39,741 INFO  L131       PetriNetUnfolder]: For 2037260/2037260 co-relation queries the response was YES.
[2023-11-03 12:38:40,923 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 842159 conditions, 81263 events. 48780/81263 cut-off events. For 2037260/2037260 co-relation queries the response was YES. Maximal size of possible extension queue 2081. Compared 669900 event pairs, 10167 based on Foata normal form. 32/77782 useless extension candidates. Maximal degree in co-relation 811230. Up to 77149 conditions per place. 
[2023-11-03 12:38:41,422 INFO  L137   encePairwiseOnDemand]: 198/215 looper letters, 3738 selfloop transitions, 153 changer transitions 140/4032 dead transitions.
[2023-11-03 12:38:41,422 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 4032 transitions, 83368 flow
[2023-11-03 12:38:41,423 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-11-03 12:38:41,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-11-03 12:38:41,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1396 transitions.
[2023-11-03 12:38:41,425 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.29513742071881605
[2023-11-03 12:38:41,425 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1396 transitions.
[2023-11-03 12:38:41,426 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1396 transitions.
[2023-11-03 12:38:41,426 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:38:41,426 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1396 transitions.
[2023-11-03 12:38:41,428 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 63.45454545454545) internal successors, (1396), 22 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-03 12:38:41,433 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 215.0) internal successors, (4945), 23 states have internal predecessors, (4945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:38:41,433 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 215.0) internal successors, (4945), 23 states have internal predecessors, (4945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:38:41,433 INFO  L175             Difference]: Start difference. First operand has 289 places, 3129 transitions, 60163 flow. Second operand 22 states and 1396 transitions.
[2023-11-03 12:38:41,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 4032 transitions, 83368 flow
[2023-11-03 12:40:03,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 4032 transitions, 83087 flow, removed 128 selfloop flow, removed 9 redundant places.
[2023-11-03 12:40:03,216 INFO  L231             Difference]: Finished difference. Result has 314 places, 3230 transitions, 63068 flow
[2023-11-03 12:40:03,218 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=59964, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=63068, PETRI_PLACES=314, PETRI_TRANSITIONS=3230}
[2023-11-03 12:40:03,218 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 243 predicate places.
[2023-11-03 12:40:03,219 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 3230 transitions, 63068 flow
[2023-11-03 12:40:03,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:40:03,219 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:40:03,219 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-03 12:40:03,225 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2023-11-03 12:40:03,420 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:40:03,421 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-03 12:40:03,421 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:40:03,422 INFO  L85        PathProgramCache]: Analyzing trace with hash -1037764709, now seen corresponding path program 4 times
[2023-11-03 12:40:03,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:40:03,422 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547568365]
[2023-11-03 12:40:03,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:40:03,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:40:03,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:40:04,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:40:04,203 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:40:04,203 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547568365]
[2023-11-03 12:40:04,203 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547568365] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 12:40:04,203 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494024424]
[2023-11-03 12:40:04,204 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-03 12:40:04,204 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 12:40:04,204 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:40:04,206 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 12:40:04,208 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2023-11-03 12:40:04,695 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-03 12:40:04,695 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 12:40:04,698 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 65 conjunts are in the unsatisfiable core
[2023-11-03 12:40:04,705 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:40:04,730 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:04,733 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:04,737 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-03 12:40:05,528 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 12:40:05,528 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-03 12:40:05,542 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:05,544 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:05,548 INFO  L321             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2023-11-03 12:40:05,549 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-03 12:40:05,738 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 12:40:05,739 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-03 12:40:05,753 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:05,755 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:05,758 INFO  L321             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2023-11-03 12:40:05,759 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-03 12:40:05,972 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 12:40:06,192 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-11-03 12:40:06,193 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-03 12:40:06,230 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-11-03 12:40:06,230 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 29 treesize of output 13
[2023-11-03 12:40:06,317 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,318 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-03 12:40:06,390 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,392 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,393 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-03 12:40:06,525 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,527 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 32 treesize of output 30
[2023-11-03 12:40:06,568 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,569 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,570 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,571 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-03 12:40:06,681 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,682 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-03 12:40:06,726 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,727 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-03 12:40:06,757 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,758 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-03 12:40:06,904 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,905 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,906 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:40:06,907 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-11-03 12:40:06,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:40:06,962 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:40:22,881 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2284 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2283 (Array Int Int))) (= (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2283))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2284))) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2284 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2283))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2284))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2284 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2283 (Array Int Int))) (= (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select .cse7 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2283))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2284))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2284 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2283))) (store .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2284))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2023-11-03 12:40:25,190 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse11 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse11 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2284 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2283 (Array Int Int))) (= (select (select (let ((.cse0 (store (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2283))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2284))) c_threadThread1of2ForFork0_~t~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2284 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse8 c_threadThread1of2ForFork0_~t~0.base (store (select .cse8 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2283))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_2284))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2284 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (let ((.cse10 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse10 c_threadThread1of2ForFork0_~t~0.base (store (select .cse10 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2283))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 v_ArrVal_2284))) c_threadThread1of2ForFork0_~t~0.base) .cse11))) (forall ((v_ArrVal_2284 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2283 (Array Int Int))) (= (select (select (let ((.cse12 (store (let ((.cse13 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse13 c_threadThread1of2ForFork0_~t~0.base (store (select .cse13 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2283))) (store .cse12 .cse1 (store (select .cse12 .cse1) .cse2 v_ArrVal_2284))) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-03 12:40:25,229 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:40:25,229 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-11-03 12:40:25,262 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:40:25,263 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 3526 treesize of output 3254
[2023-11-03 12:40:25,321 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 3856 treesize of output 3612
[2023-11-03 12:40:25,350 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 3839 treesize of output 3739
[2023-11-03 12:40:59,268 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:40:59,269 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 166 treesize of output 136
[2023-11-03 12:40:59,322 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:40:59,323 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-11-03 12:40:59,327 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:40:59,357 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:40:59,357 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1084
[2023-11-03 12:40:59,383 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 572 treesize of output 564
[2023-11-03 12:40:59,399 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 1270 treesize of output 1238
[2023-11-03 12:40:59,414 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1356 treesize of output 1062
[2023-11-03 12:40:59,528 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:40:59,529 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-11-03 12:40:59,536 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:40:59,562 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:40:59,563 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 956 treesize of output 892
[2023-11-03 12:40:59,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 462 treesize of output 446
[2023-11-03 12:40:59,598 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 468 treesize of output 406
[2023-11-03 12:40:59,706 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:40:59,706 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 94
[2023-11-03 12:40:59,712 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 12:40:59,742 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 12:40:59,743 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1148 treesize of output 1020
[2023-11-03 12:40:59,765 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 532 treesize of output 528
[2023-11-03 12:40:59,782 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1120 treesize of output 902
[2023-11-03 12:40:59,803 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 342 treesize of output 334
[2023-11-03 12:41:08,165 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-03 12:41:08,166 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [494024424] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:41:08,166 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 12:41:08,167 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 41
[2023-11-03 12:41:08,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105357300]
[2023-11-03 12:41:08,167 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:41:08,168 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2023-11-03 12:41:08,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:41:08,169 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2023-11-03 12:41:08,170 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1395, Unknown=64, NotChecked=158, Total=1806
[2023-11-03 12:41:09,438 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 215
[2023-11-03 12:41:09,441 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 3230 transitions, 63068 flow. Second operand  has 43 states, 43 states have (on average 51.2093023255814) internal successors, (2202), 43 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:41:09,442 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:41:09,442 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 215
[2023-11-03 12:41:09,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:42:23,960 INFO  L130       PetriNetUnfolder]: 50093/83335 cut-off events.
[2023-11-03 12:42:23,960 INFO  L131       PetriNetUnfolder]: For 2313093/2313093 co-relation queries the response was YES.
[2023-11-03 12:42:25,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 880609 conditions, 83335 events. 50093/83335 cut-off events. For 2313093/2313093 co-relation queries the response was YES. Maximal size of possible extension queue 2164. Compared 689205 event pairs, 8770 based on Foata normal form. 96/79918 useless extension candidates. Maximal degree in co-relation 849226. Up to 73596 conditions per place. 
[2023-11-03 12:42:25,745 INFO  L137   encePairwiseOnDemand]: 188/215 looper letters, 4428 selfloop transitions, 678 changer transitions 108/5215 dead transitions.
[2023-11-03 12:42:25,746 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 5215 transitions, 108210 flow
[2023-11-03 12:42:25,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2023-11-03 12:42:25,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2023-11-03 12:42:25,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2519 transitions.
[2023-11-03 12:42:25,751 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.300417412045319
[2023-11-03 12:42:25,751 INFO  L72            ComplementDD]: Start complementDD. Operand 39 states and 2519 transitions.
[2023-11-03 12:42:25,751 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 39 states and 2519 transitions.
[2023-11-03 12:42:25,751 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:42:25,751 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2519 transitions.
[2023-11-03 12:42:25,755 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 40 states, 39 states have (on average 64.58974358974359) internal successors, (2519), 39 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 12:42:25,761 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-03 12:42:25,762 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-03 12:42:25,762 INFO  L175             Difference]: Start difference. First operand has 314 places, 3230 transitions, 63068 flow. Second operand 39 states and 2519 transitions.
[2023-11-03 12:42:25,762 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 5215 transitions, 108210 flow
Killed by 15
