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


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.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 c8d964de1f9939284b07a303cd6738f27ad6151a08cde6c6c589697ec126ba86
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-27 12:19:32,562 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-27 12:19:32,564 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-27 12:19:32,620 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-27 12:19:32,620 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-27 12:19:32,623 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-27 12:19:32,625 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-27 12:19:32,626 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-27 12:19:32,628 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-27 12:19:32,631 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-27 12:19:32,632 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-27 12:19:32,634 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-27 12:19:32,649 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-27 12:19:32,651 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-27 12:19:32,653 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-27 12:19:32,654 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-27 12:19:32,655 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-27 12:19:32,655 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-27 12:19:32,656 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-27 12:19:32,661 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-27 12:19:32,662 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-27 12:19:32,663 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-27 12:19:32,664 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-27 12:19:32,665 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-27 12:19:32,668 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-27 12:19:32,668 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-27 12:19:32,668 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-27 12:19:32,669 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-27 12:19:32,669 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-27 12:19:32,670 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-27 12:19:32,670 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-27 12:19:32,671 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-27 12:19:32,672 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-27 12:19:32,673 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-27 12:19:32,677 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-27 12:19:32,678 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-27 12:19:32,678 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-27 12:19:32,684 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-27 12:19:32,684 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-27 12:19:32,685 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-27 12:19:32,686 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-27 12:19:32,687 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-27 12:19:32,716 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-27 12:19:32,716 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-27 12:19:32,717 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-27 12:19:32,717 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-27 12:19:32,717 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-27 12:19:32,717 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-27 12:19:32,718 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-27 12:19:32,718 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-27 12:19:32,718 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-27 12:19:32,718 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-27 12:19:32,719 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-27 12:19:32,719 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-27 12:19:32,719 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-27 12:19:32,719 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-27 12:19:32,719 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-27 12:19:32,719 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-27 12:19:32,720 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-27 12:19:32,734 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-27 12:19:32,735 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-27 12:19:32,735 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-27 12:19:32,735 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-27 12:19:32,735 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-27 12:19:32,735 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-27 12:19:32,736 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-27 12:19:32,736 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-27 12:19:32,736 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-27 12:19:32,736 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:19:32,736 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-27 12:19:32,737 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-27 12:19:32,737 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-27 12:19:32,737 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-27 12:19:32,738 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-27 12:19:32,738 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-27 12:19:32,739 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-27 12:19:32,739 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-27 12:19:32,739 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-27 12:19:32,740 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-27 12:19:32,740 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 -> c8d964de1f9939284b07a303cd6738f27ad6151a08cde6c6c589697ec126ba86
[2023-10-27 12:19:33,098 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-27 12:19:33,136 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-27 12:19:33,138 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-27 12:19:33,138 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-27 12:19:33,139 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-27 12:19:33,140 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2023-10-27 12:19:34,880 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-27 12:19:35,266 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-27 12:19:35,281 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2023-10-27 12:19:35,297 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/1619c9ba1/036a39f74c8c40c18152232b9363be4d/FLAG7f2021811
[2023-10-27 12:19:35,320 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/1619c9ba1/036a39f74c8c40c18152232b9363be4d
[2023-10-27 12:19:35,321 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-27 12:19:35,322 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-27 12:19:35,334 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-27 12:19:35,335 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-27 12:19:35,338 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-27 12:19:35,338 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:19:35" (1/1) ...
[2023-10-27 12:19:35,340 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc2097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:35, skipping insertion in model container
[2023-10-27 12:19:35,341 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:19:35" (1/1) ...
[2023-10-27 12:19:35,346 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-27 12:19:35,433 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-27 12:19:35,676 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:19:35,984 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:19:35,991 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-27 12:19:36,042 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:19:36,093 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:19:36,157 INFO  L208         MainTranslator]: Completed translation
[2023-10-27 12:19:36,158 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36 WrapperNode
[2023-10-27 12:19:36,158 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-27 12:19:36,159 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-27 12:19:36,159 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-27 12:19:36,159 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-27 12:19:36,165 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,200 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,247 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2023-10-27 12:19:36,248 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-27 12:19:36,248 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-27 12:19:36,253 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-27 12:19:36,253 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-27 12:19:36,261 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,261 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,274 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,275 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,293 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,296 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,304 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,311 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,313 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-27 12:19:36,327 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-27 12:19:36,327 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-27 12:19:36,327 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-27 12:19:36,328 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (1/1) ...
[2023-10-27 12:19:36,338 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:19:36,356 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:36,379 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-27 12:19:36,410 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-27 12:19:36,424 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-27 12:19:36,424 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-27 12:19:36,424 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-27 12:19:36,428 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-27 12:19:36,428 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-27 12:19:36,428 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-27 12:19:36,428 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-27 12:19:36,428 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-27 12:19:36,428 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-27 12:19:36,428 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-27 12:19:36,429 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-27 12:19:36,430 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-27 12:19:36,645 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-27 12:19:36,647 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-27 12:19:37,069 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-27 12:19:37,075 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-27 12:19:37,093 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-27 12:19:37,095 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:19:37 BoogieIcfgContainer
[2023-10-27 12:19:37,096 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-27 12:19:37,098 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-27 12:19:37,098 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-27 12:19:37,100 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-27 12:19:37,101 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:19:35" (1/3) ...
[2023-10-27 12:19:37,101 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608e628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:19:37, skipping insertion in model container
[2023-10-27 12:19:37,101 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:19:36" (2/3) ...
[2023-10-27 12:19:37,103 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608e628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:19:37, skipping insertion in model container
[2023-10-27 12:19:37,103 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:19:37" (3/3) ...
[2023-10-27 12:19:37,104 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i
[2023-10-27 12:19:37,116 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-27 12:19:37,130 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-27 12:19:37,131 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2023-10-27 12:19:37,131 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-27 12:19:37,260 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-27 12:19:37,317 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-10-27 12:19:37,443 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-10-27 12:19:37,444 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:19:37,448 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 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-10-27 12:19:37,448 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2023-10-27 12:19:37,451 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2023-10-27 12:19:37,473 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:19:37,481 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2023-10-27 12:19:37,505 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2023-10-27 12:19:37,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-10-27 12:19:37,558 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-10-27 12:19:37,581 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:19:37,582 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 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-10-27 12:19:37,584 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2023-10-27 12:19:41,134 INFO  L134        LiptonReduction]: Checked pairs total: 9489
[2023-10-27 12:19:41,134 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2023-10-27 12:19:41,162 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:19:41,182 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;@1ff26492, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:19:41,183 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-10-27 12:19:41,187 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-10-27 12:19:41,188 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:19:41,188 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:41,189 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:41,189 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-27 12:19:41,193 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:41,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 1980212676, now seen corresponding path program 1 times
[2023-10-27 12:19:41,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:41,217 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063417185]
[2023-10-27 12:19:41,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:41,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:41,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:42,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:42,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:42,091 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063417185]
[2023-10-27 12:19:42,091 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063417185] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:42,091 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:19:42,091 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:19:42,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699419534]
[2023-10-27 12:19:42,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:42,099 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:19:42,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:42,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:19:42,150 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:19:42,573 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 197
[2023-10-27 12:19:42,575 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:42,576 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:42,576 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 197
[2023-10-27 12:19:42,576 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:42,842 INFO  L130       PetriNetUnfolder]: 146/507 cut-off events.
[2023-10-27 12:19:42,843 INFO  L131       PetriNetUnfolder]: For 4/8 co-relation queries the response was YES.
[2023-10-27 12:19:42,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 870 conditions, 507 events. 146/507 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2712 event pairs, 42 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 784. Up to 226 conditions per place. 
[2023-10-27 12:19:42,853 INFO  L137   encePairwiseOnDemand]: 181/197 looper letters, 47 selfloop transitions, 23 changer transitions 0/98 dead transitions.
[2023-10-27 12:19:42,853 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 344 flow
[2023-10-27 12:19:42,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:19:42,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:19:42,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions.
[2023-10-27 12:19:42,887 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5583756345177665
[2023-10-27 12:19:42,888 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 660 transitions.
[2023-10-27 12:19:42,889 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 660 transitions.
[2023-10-27 12:19:42,891 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:42,893 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 660 transitions.
[2023-10-27 12:19:42,898 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:42,903 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:42,908 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:42,910 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 660 transitions.
[2023-10-27 12:19:42,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 344 flow
[2023-10-27 12:19:42,917 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:42,935 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2023-10-27 12:19:42,937 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2023-10-27 12:19:42,942 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2023-10-27 12:19:42,942 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2023-10-27 12:19:42,942 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:42,943 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:42,943 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:42,943 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-27 12:19:42,944 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-27 12:19:42,944 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:42,945 INFO  L85        PathProgramCache]: Analyzing trace with hash 1641346575, now seen corresponding path program 1 times
[2023-10-27 12:19:42,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:42,947 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413510982]
[2023-10-27 12:19:42,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:42,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:42,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:43,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:43,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:43,263 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413510982]
[2023-10-27 12:19:43,263 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413510982] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:43,263 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:19:43,266 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:19:43,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944983497]
[2023-10-27 12:19:43,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:43,268 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:19:43,268 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:43,268 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:19:43,269 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:19:43,568 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197
[2023-10-27 12:19:43,568 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 292 flow. Second operand  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:43,569 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:43,569 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197
[2023-10-27 12:19:43,569 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:43,932 INFO  L130       PetriNetUnfolder]: 284/850 cut-off events.
[2023-10-27 12:19:43,933 INFO  L131       PetriNetUnfolder]: For 332/338 co-relation queries the response was YES.
[2023-10-27 12:19:43,938 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 850 events. 284/850 cut-off events. For 332/338 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5116 event pairs, 51 based on Foata normal form. 5/813 useless extension candidates. Maximal degree in co-relation 1873. Up to 398 conditions per place. 
[2023-10-27 12:19:43,957 INFO  L137   encePairwiseOnDemand]: 174/197 looper letters, 73 selfloop transitions, 50 changer transitions 0/152 dead transitions.
[2023-10-27 12:19:43,958 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 152 transitions, 799 flow
[2023-10-27 12:19:43,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:19:43,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:19:43,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions.
[2023-10-27 12:19:43,959 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5439932318104906
[2023-10-27 12:19:43,960 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 643 transitions.
[2023-10-27 12:19:43,960 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions.
[2023-10-27 12:19:43,960 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:43,961 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions.
[2023-10-27 12:19:43,963 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:43,968 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:43,968 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:43,969 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 6 states and 643 transitions.
[2023-10-27 12:19:43,969 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 152 transitions, 799 flow
[2023-10-27 12:19:43,976 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 152 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:43,979 INFO  L231             Difference]: Finished difference. Result has 79 places, 129 transitions, 770 flow
[2023-10-27 12:19:43,979 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=79, PETRI_TRANSITIONS=129}
[2023-10-27 12:19:43,980 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places.
[2023-10-27 12:19:43,990 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 129 transitions, 770 flow
[2023-10-27 12:19:43,990 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:43,991 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:43,991 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:43,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-27 12:19:43,991 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-27 12:19:43,992 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:43,992 INFO  L85        PathProgramCache]: Analyzing trace with hash 61135557, now seen corresponding path program 1 times
[2023-10-27 12:19:43,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:43,992 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497510348]
[2023-10-27 12:19:43,993 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:43,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:44,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:44,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:44,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:44,347 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497510348]
[2023-10-27 12:19:44,361 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497510348] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:44,362 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:19:44,362 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:19:44,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677475626]
[2023-10-27 12:19:44,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:44,364 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:19:44,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:44,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:19:44,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:19:44,783 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197
[2023-10-27 12:19:44,784 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 129 transitions, 770 flow. Second operand  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:44,784 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:44,784 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197
[2023-10-27 12:19:44,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:45,044 INFO  L130       PetriNetUnfolder]: 280/858 cut-off events.
[2023-10-27 12:19:45,044 INFO  L131       PetriNetUnfolder]: For 1118/1126 co-relation queries the response was YES.
[2023-10-27 12:19:45,045 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 858 events. 280/858 cut-off events. For 1118/1126 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5295 event pairs, 47 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 2418. Up to 429 conditions per place. 
[2023-10-27 12:19:45,064 INFO  L137   encePairwiseOnDemand]: 186/197 looper letters, 76 selfloop transitions, 33 changer transitions 8/171 dead transitions.
[2023-10-27 12:19:45,064 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1243 flow
[2023-10-27 12:19:45,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:19:45,065 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:19:45,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions.
[2023-10-27 12:19:45,066 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5651438240270727
[2023-10-27 12:19:45,066 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 668 transitions.
[2023-10-27 12:19:45,066 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions.
[2023-10-27 12:19:45,067 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:45,067 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions.
[2023-10-27 12:19:45,068 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:45,070 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:45,071 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:45,071 INFO  L175             Difference]: Start difference. First operand has 79 places, 129 transitions, 770 flow. Second operand 6 states and 668 transitions.
[2023-10-27 12:19:45,071 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 1243 flow
[2023-10-27 12:19:45,075 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1243 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:45,082 INFO  L231             Difference]: Finished difference. Result has 89 places, 159 transitions, 1135 flow
[2023-10-27 12:19:45,083 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1135, PETRI_PLACES=89, PETRI_TRANSITIONS=159}
[2023-10-27 12:19:45,084 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2023-10-27 12:19:45,084 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1135 flow
[2023-10-27 12:19:45,085 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:45,085 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:45,085 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:45,085 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-27 12:19:45,089 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-27 12:19:45,089 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:45,089 INFO  L85        PathProgramCache]: Analyzing trace with hash -1282532369, now seen corresponding path program 1 times
[2023-10-27 12:19:45,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:45,089 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361482497]
[2023-10-27 12:19:45,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:45,090 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:45,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:45,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:45,488 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:45,488 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361482497]
[2023-10-27 12:19:45,488 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361482497] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:45,488 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:19:45,490 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:19:45,490 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158108565]
[2023-10-27 12:19:45,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:45,491 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:19:45,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:45,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:19:45,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:19:45,649 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197
[2023-10-27 12:19:45,650 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 159 transitions, 1135 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:45,650 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:45,650 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197
[2023-10-27 12:19:45,650 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:46,155 INFO  L130       PetriNetUnfolder]: 536/1340 cut-off events.
[2023-10-27 12:19:46,155 INFO  L131       PetriNetUnfolder]: For 1846/1860 co-relation queries the response was YES.
[2023-10-27 12:19:46,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 1340 events. 536/1340 cut-off events. For 1846/1860 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8489 event pairs, 92 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 4685. Up to 994 conditions per place. 
[2023-10-27 12:19:46,176 INFO  L137   encePairwiseOnDemand]: 167/197 looper letters, 167 selfloop transitions, 111 changer transitions 10/304 dead transitions.
[2023-10-27 12:19:46,176 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 304 transitions, 2365 flow
[2023-10-27 12:19:46,176 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:19:46,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:19:46,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions.
[2023-10-27 12:19:46,178 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.577834179357022
[2023-10-27 12:19:46,178 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 683 transitions.
[2023-10-27 12:19:46,178 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions.
[2023-10-27 12:19:46,180 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:46,180 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions.
[2023-10-27 12:19:46,187 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:46,188 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:46,190 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:46,190 INFO  L175             Difference]: Start difference. First operand has 89 places, 159 transitions, 1135 flow. Second operand 6 states and 683 transitions.
[2023-10-27 12:19:46,190 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 304 transitions, 2365 flow
[2023-10-27 12:19:46,214 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 304 transitions, 2365 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:46,223 INFO  L231             Difference]: Finished difference. Result has 97 places, 262 transitions, 2045 flow
[2023-10-27 12:19:46,223 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2045, PETRI_PLACES=97, PETRI_TRANSITIONS=262}
[2023-10-27 12:19:46,225 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places.
[2023-10-27 12:19:46,225 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 262 transitions, 2045 flow
[2023-10-27 12:19:46,225 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:46,226 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:46,226 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:46,226 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-27 12:19:46,226 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-27 12:19:46,226 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:46,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 1889096930, now seen corresponding path program 1 times
[2023-10-27 12:19:46,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:46,227 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974195758]
[2023-10-27 12:19:46,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:46,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:46,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:47,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:47,037 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:47,038 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974195758]
[2023-10-27 12:19:47,038 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974195758] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:47,038 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384204341]
[2023-10-27 12:19:47,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:47,039 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:47,039 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:47,061 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:47,102 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-27 12:19:47,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:47,245 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-27 12:19:47,250 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:47,386 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-27 12:19:47,576 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:19:47,629 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:47,646 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:19:47,698 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:47,700 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:47,701 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:19:47,754 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:47,755 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:47,756 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:47,760 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:19:47,840 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:47,841 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:19:47,879 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:47,880 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:19:47,940 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0))) is different from false
[2023-10-27 12:19:47,967 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0))))) is different from false
[2023-10-27 12:19:48,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-27 12:19:48,142 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [384204341] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:19:48,142 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:19:48,143 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-27 12:19:48,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655480441]
[2023-10-27 12:19:48,144 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:19:48,145 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-27 12:19:48,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:48,146 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-27 12:19:48,146 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=459, Unknown=2, NotChecked=90, Total=650
[2023-10-27 12:19:48,382 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 197
[2023-10-27 12:19:48,383 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 262 transitions, 2045 flow. Second operand  has 26 states, 26 states have (on average 61.57692307692308) internal successors, (1601), 26 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:48,384 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:48,384 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 197
[2023-10-27 12:19:48,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:49,675 INFO  L130       PetriNetUnfolder]: 631/1461 cut-off events.
[2023-10-27 12:19:49,689 INFO  L131       PetriNetUnfolder]: For 3916/3922 co-relation queries the response was YES.
[2023-10-27 12:19:49,692 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6505 conditions, 1461 events. 631/1461 cut-off events. For 3916/3922 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9098 event pairs, 154 based on Foata normal form. 10/1371 useless extension candidates. Maximal degree in co-relation 6378. Up to 1331 conditions per place. 
[2023-10-27 12:19:49,698 INFO  L137   encePairwiseOnDemand]: 187/197 looper letters, 304 selfloop transitions, 12 changer transitions 12/330 dead transitions.
[2023-10-27 12:19:49,698 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 330 transitions, 3086 flow
[2023-10-27 12:19:49,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-10-27 12:19:49,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-10-27 12:19:49,700 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2023-10-27 12:19:49,701 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3598984771573604
[2023-10-27 12:19:49,701 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2023-10-27 12:19:49,717 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2023-10-27 12:19:49,718 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:49,718 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2023-10-27 12:19:49,719 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.9) internal successors, (709), 10 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:49,728 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:49,728 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:49,728 INFO  L175             Difference]: Start difference. First operand has 97 places, 262 transitions, 2045 flow. Second operand 10 states and 709 transitions.
[2023-10-27 12:19:49,729 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 330 transitions, 3086 flow
[2023-10-27 12:19:49,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 2942 flow, removed 72 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:49,774 INFO  L231             Difference]: Finished difference. Result has 107 places, 265 transitions, 1941 flow
[2023-10-27 12:19:49,789 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1941, PETRI_PLACES=107, PETRI_TRANSITIONS=265}
[2023-10-27 12:19:49,791 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places.
[2023-10-27 12:19:49,791 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 265 transitions, 1941 flow
[2023-10-27 12:19:49,792 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 61.57692307692308) internal successors, (1601), 26 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:49,792 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:49,792 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:49,800 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:49,997 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:49,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-10-27 12:19:49,997 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:49,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 109794428, now seen corresponding path program 1 times
[2023-10-27 12:19:49,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:49,998 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243866204]
[2023-10-27 12:19:49,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:49,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:50,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:50,581 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:50,581 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:50,583 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243866204]
[2023-10-27 12:19:50,584 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243866204] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:50,584 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115243879]
[2023-10-27 12:19:50,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:50,584 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:50,584 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:50,598 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:50,636 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-27 12:19:50,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:50,774 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 28 conjunts are in the unsatisfiable core
[2023-10-27 12:19:50,777 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:50,794 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-27 12:19:50,870 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:19:50,894 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:19:50,948 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:50,948 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:19:51,011 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:51,011 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:19:51,106 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,107 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:19:51,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:51,116 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:19:51,138 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-27 12:19:51,214 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-27 12:19:51,240 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-10-27 12:19:51,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-27 12:19:51,331 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115243879] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:19:51,331 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:19:51,331 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21
[2023-10-27 12:19:51,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779638176]
[2023-10-27 12:19:51,331 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:19:51,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2023-10-27 12:19:51,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:51,333 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2023-10-27 12:19:51,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=304, Unknown=3, NotChecked=114, Total=506
[2023-10-27 12:19:51,479 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 197
[2023-10-27 12:19:51,480 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 265 transitions, 1941 flow. Second operand  has 23 states, 23 states have (on average 59.869565217391305) internal successors, (1377), 23 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:51,480 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:51,480 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 197
[2023-10-27 12:19:51,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:55,098 INFO  L130       PetriNetUnfolder]: 720/1653 cut-off events.
[2023-10-27 12:19:55,098 INFO  L131       PetriNetUnfolder]: For 3859/3865 co-relation queries the response was YES.
[2023-10-27 12:19:55,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7496 conditions, 1653 events. 720/1653 cut-off events. For 3859/3865 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10567 event pairs, 75 based on Foata normal form. 2/1572 useless extension candidates. Maximal degree in co-relation 7351. Up to 979 conditions per place. 
[2023-10-27 12:19:55,124 INFO  L137   encePairwiseOnDemand]: 146/197 looper letters, 279 selfloop transitions, 236 changer transitions 41/558 dead transitions.
[2023-10-27 12:19:55,124 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 558 transitions, 4800 flow
[2023-10-27 12:19:55,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-27 12:19:55,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-27 12:19:55,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1554 transitions.
[2023-10-27 12:19:55,129 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3756345177664975
[2023-10-27 12:19:55,129 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1554 transitions.
[2023-10-27 12:19:55,130 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1554 transitions.
[2023-10-27 12:19:55,130 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:55,130 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1554 transitions.
[2023-10-27 12:19:55,142 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 74.0) internal successors, (1554), 21 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:55,161 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:55,162 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:55,162 INFO  L175             Difference]: Start difference. First operand has 107 places, 265 transitions, 1941 flow. Second operand 21 states and 1554 transitions.
[2023-10-27 12:19:55,162 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 558 transitions, 4800 flow
[2023-10-27 12:19:55,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 558 transitions, 4770 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-27 12:19:55,197 INFO  L231             Difference]: Finished difference. Result has 131 places, 395 transitions, 3786 flow
[2023-10-27 12:19:55,198 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3786, PETRI_PLACES=131, PETRI_TRANSITIONS=395}
[2023-10-27 12:19:55,199 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places.
[2023-10-27 12:19:55,199 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 395 transitions, 3786 flow
[2023-10-27 12:19:55,213 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 59.869565217391305) internal successors, (1377), 23 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:55,213 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:55,213 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:55,220 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:55,418 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:55,418 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-27 12:19:55,419 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:55,419 INFO  L85        PathProgramCache]: Analyzing trace with hash -2068764240, now seen corresponding path program 1 times
[2023-10-27 12:19:55,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:55,419 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355985569]
[2023-10-27 12:19:55,419 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:55,420 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:55,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:55,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:55,542 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:55,542 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355985569]
[2023-10-27 12:19:55,542 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355985569] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:55,542 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700098600]
[2023-10-27 12:19:55,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:55,542 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:55,543 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:55,558 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:55,609 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-27 12:19:55,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:55,711 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-27 12:19:55,712 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:55,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:55,755 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:19:55,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:55,816 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [700098600] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:19:55,816 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:19:55,816 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-27 12:19:55,816 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86168955]
[2023-10-27 12:19:55,817 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:19:55,818 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-27 12:19:55,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:55,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-27 12:19:55,818 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-27 12:19:55,943 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197
[2023-10-27 12:19:55,944 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 395 transitions, 3786 flow. Second operand  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:55,944 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:55,944 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197
[2023-10-27 12:19:55,944 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:56,211 INFO  L130       PetriNetUnfolder]: 322/901 cut-off events.
[2023-10-27 12:19:56,212 INFO  L131       PetriNetUnfolder]: For 3755/3789 co-relation queries the response was YES.
[2023-10-27 12:19:56,214 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4681 conditions, 901 events. 322/901 cut-off events. For 3755/3789 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5583 event pairs, 11 based on Foata normal form. 16/905 useless extension candidates. Maximal degree in co-relation 4536. Up to 295 conditions per place. 
[2023-10-27 12:19:56,218 INFO  L137   encePairwiseOnDemand]: 191/197 looper letters, 31 selfloop transitions, 12 changer transitions 3/294 dead transitions.
[2023-10-27 12:19:56,233 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 294 transitions, 2894 flow
[2023-10-27 12:19:56,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:19:56,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:19:56,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions.
[2023-10-27 12:19:56,235 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5583756345177665
[2023-10-27 12:19:56,235 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 770 transitions.
[2023-10-27 12:19:56,235 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions.
[2023-10-27 12:19:56,236 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:56,236 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions.
[2023-10-27 12:19:56,237 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:56,239 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:56,239 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:56,239 INFO  L175             Difference]: Start difference. First operand has 131 places, 395 transitions, 3786 flow. Second operand 7 states and 770 transitions.
[2023-10-27 12:19:56,239 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 294 transitions, 2894 flow
[2023-10-27 12:19:56,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 294 transitions, 2722 flow, removed 63 selfloop flow, removed 8 redundant places.
[2023-10-27 12:19:56,299 INFO  L231             Difference]: Finished difference. Result has 117 places, 286 transitions, 2600 flow
[2023-10-27 12:19:56,300 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2600, PETRI_PLACES=117, PETRI_TRANSITIONS=286}
[2023-10-27 12:19:56,301 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 58 predicate places.
[2023-10-27 12:19:56,301 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 286 transitions, 2600 flow
[2023-10-27 12:19:56,301 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:56,302 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:56,302 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:56,308 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:56,505 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:56,506 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-27 12:19:56,507 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:56,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 2139930529, now seen corresponding path program 1 times
[2023-10-27 12:19:56,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:56,507 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58555480]
[2023-10-27 12:19:56,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:56,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:56,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:57,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:57,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:57,020 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58555480]
[2023-10-27 12:19:57,020 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58555480] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:57,020 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186366902]
[2023-10-27 12:19:57,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:57,021 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:57,021 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:57,038 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:57,073 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-27 12:19:57,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:57,193 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-27 12:19:57,199 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:57,219 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-27 12:19:57,294 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:19:57,339 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:19:57,385 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:57,385 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:19:57,449 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:57,450 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:19:57,507 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:57,522 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:19:57,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:57,530 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:19:57,551 WARN  L837   $PredicateComparison]: unable to prove that (and (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_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |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_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |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_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (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_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) is different from false
[2023-10-27 12:19:57,585 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |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_~p~0.base) c_threadThread1of1ForFork0_~p~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_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-27 12:19:57,598 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .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_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-27 12:19:57,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:57,748 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186366902] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:19:57,748 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:19:57,748 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-27 12:19:57,748 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11167426]
[2023-10-27 12:19:57,748 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:19:57,749 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-27 12:19:57,749 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:57,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-27 12:19:57,750 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-27 12:19:57,795 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 197
[2023-10-27 12:19:57,796 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 286 transitions, 2600 flow. Second operand  has 26 states, 26 states have (on average 56.65384615384615) internal successors, (1473), 26 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:57,796 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:57,796 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 197
[2023-10-27 12:19:57,796 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:00,827 INFO  L130       PetriNetUnfolder]: 532/1249 cut-off events.
[2023-10-27 12:20:00,832 INFO  L131       PetriNetUnfolder]: For 5011/5011 co-relation queries the response was YES.
[2023-10-27 12:20:00,840 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6797 conditions, 1249 events. 532/1249 cut-off events. For 5011/5011 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7590 event pairs, 30 based on Foata normal form. 43/1292 useless extension candidates. Maximal degree in co-relation 6640. Up to 666 conditions per place. 
[2023-10-27 12:20:00,845 INFO  L137   encePairwiseOnDemand]: 160/197 looper letters, 276 selfloop transitions, 203 changer transitions 6/487 dead transitions.
[2023-10-27 12:20:00,853 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 487 transitions, 5040 flow
[2023-10-27 12:20:00,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-10-27 12:20:00,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-10-27 12:20:00,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1342 transitions.
[2023-10-27 12:20:00,864 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34060913705583756
[2023-10-27 12:20:00,864 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1342 transitions.
[2023-10-27 12:20:00,864 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1342 transitions.
[2023-10-27 12:20:00,865 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:00,865 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1342 transitions.
[2023-10-27 12:20:00,867 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 67.1) internal successors, (1342), 20 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:00,886 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:00,888 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:00,888 INFO  L175             Difference]: Start difference. First operand has 117 places, 286 transitions, 2600 flow. Second operand 20 states and 1342 transitions.
[2023-10-27 12:20:00,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 487 transitions, 5040 flow
[2023-10-27 12:20:00,940 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 487 transitions, 5016 flow, removed 6 selfloop flow, removed 4 redundant places.
[2023-10-27 12:20:00,954 INFO  L231             Difference]: Finished difference. Result has 137 places, 364 transitions, 4084 flow
[2023-10-27 12:20:00,954 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2586, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4084, PETRI_PLACES=137, PETRI_TRANSITIONS=364}
[2023-10-27 12:20:00,956 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 78 predicate places.
[2023-10-27 12:20:00,956 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 364 transitions, 4084 flow
[2023-10-27 12:20:00,956 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.65384615384615) internal successors, (1473), 26 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:00,957 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:00,957 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:00,975 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-27 12:20:01,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:01,161 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-27 12:20:01,162 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:01,162 INFO  L85        PathProgramCache]: Analyzing trace with hash -920454980, now seen corresponding path program 1 times
[2023-10-27 12:20:01,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:01,162 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356811640]
[2023-10-27 12:20:01,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:01,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:01,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:01,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:01,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:01,735 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356811640]
[2023-10-27 12:20:01,735 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356811640] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:01,735 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552356426]
[2023-10-27 12:20:01,735 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:01,735 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:01,736 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:01,736 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:20:01,781 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-10-27 12:20:01,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:01,914 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-27 12:20:01,917 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:01,942 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-27 12:20:02,051 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:20:02,091 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:02,092 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:20:02,137 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:02,138 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:02,140 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:20:02,194 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:02,195 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:02,196 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:02,196 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:20:02,301 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:02,303 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:20:02,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:02,346 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:20:02,368 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~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_~p~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_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false
[2023-10-27 12:20:02,421 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39)))) is different from false
[2023-10-27 12:20:02,761 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_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39)))))) is different from false
[2023-10-27 12:20:03,010 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:03,010 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-10-27 12:20:03,016 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:03,017 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-10-27 12:20:03,022 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-10-27 12:20:03,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:03,134 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [552356426] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:03,134 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:03,134 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-10-27 12:20:03,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458691009]
[2023-10-27 12:20:03,134 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:03,134 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-27 12:20:03,134 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:03,135 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-27 12:20:03,135 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=520, Unknown=17, NotChecked=150, Total=812
[2023-10-27 12:20:03,272 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 197
[2023-10-27 12:20:03,274 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 364 transitions, 4084 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:03,274 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:03,274 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 197
[2023-10-27 12:20:03,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:04,416 INFO  L130       PetriNetUnfolder]: 506/1193 cut-off events.
[2023-10-27 12:20:04,416 INFO  L131       PetriNetUnfolder]: For 8524/8531 co-relation queries the response was YES.
[2023-10-27 12:20:04,419 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7861 conditions, 1193 events. 506/1193 cut-off events. For 8524/8531 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7068 event pairs, 48 based on Foata normal form. 29/1221 useless extension candidates. Maximal degree in co-relation 7689. Up to 1103 conditions per place. 
[2023-10-27 12:20:04,434 INFO  L137   encePairwiseOnDemand]: 188/197 looper letters, 365 selfloop transitions, 13 changer transitions 1/381 dead transitions.
[2023-10-27 12:20:04,434 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 381 transitions, 4949 flow
[2023-10-27 12:20:04,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-10-27 12:20:04,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-10-27 12:20:04,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 643 transitions.
[2023-10-27 12:20:04,452 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.32639593908629444
[2023-10-27 12:20:04,452 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 643 transitions.
[2023-10-27 12:20:04,452 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 643 transitions.
[2023-10-27 12:20:04,460 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:04,460 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 643 transitions.
[2023-10-27 12:20:04,461 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 64.3) internal successors, (643), 10 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:04,464 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:04,464 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:04,464 INFO  L175             Difference]: Start difference. First operand has 137 places, 364 transitions, 4084 flow. Second operand 10 states and 643 transitions.
[2023-10-27 12:20:04,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 381 transitions, 4949 flow
[2023-10-27 12:20:04,541 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 381 transitions, 4786 flow, removed 42 selfloop flow, removed 12 redundant places.
[2023-10-27 12:20:04,546 INFO  L231             Difference]: Finished difference. Result has 133 places, 349 transitions, 3800 flow
[2023-10-27 12:20:04,561 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3800, PETRI_PLACES=133, PETRI_TRANSITIONS=349}
[2023-10-27 12:20:04,562 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 74 predicate places.
[2023-10-27 12:20:04,562 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 349 transitions, 3800 flow
[2023-10-27 12:20:04,562 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:04,562 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:04,563 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:04,569 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-27 12:20:04,766 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:04,767 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-27 12:20:04,767 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:04,768 INFO  L85        PathProgramCache]: Analyzing trace with hash 819311960, now seen corresponding path program 2 times
[2023-10-27 12:20:04,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:04,768 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948048756]
[2023-10-27 12:20:04,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:04,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:04,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:05,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:05,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:05,675 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948048756]
[2023-10-27 12:20:05,675 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948048756] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:05,675 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044586787]
[2023-10-27 12:20:05,675 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:20:05,675 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:05,675 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:05,681 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:20:05,721 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-10-27 12:20:05,894 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:20:05,895 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:20:05,896 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-10-27 12:20:05,900 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:05,932 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2023-10-27 12:20:05,940 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-27 12:20:06,158 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:20:06,211 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,212 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:20:06,272 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,273 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:20:06,332 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,333 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 32 treesize of output 30
[2023-10-27 12:20:06,362 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,363 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,364 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,364 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:20:06,424 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,425 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:20:06,445 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,446 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:20:06,477 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,478 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:20:06,548 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:06,549 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:20:06,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:06,593 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:20:06,626 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_813 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-27 12:20:06,659 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-27 12:20:06,720 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-27 12:20:06,736 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse0 c_threadThread1of1ForFork0_~p~0.base (store (select .cse0 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false
[2023-10-27 12:20:06,771 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse0 c_threadThread1of1ForFork0_~p~0.base (store (select .cse0 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-27 12:20:06,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked.
[2023-10-27 12:20:06,891 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044586787] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:06,892 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:06,892 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 26
[2023-10-27 12:20:06,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590694793]
[2023-10-27 12:20:06,893 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:06,894 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-10-27 12:20:06,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:06,895 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-10-27 12:20:06,895 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=417, Unknown=5, NotChecked=230, Total=756
[2023-10-27 12:20:06,910 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 197
[2023-10-27 12:20:06,911 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 349 transitions, 3800 flow. Second operand  has 28 states, 28 states have (on average 51.964285714285715) internal successors, (1455), 28 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:06,912 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:06,912 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 197
[2023-10-27 12:20:06,912 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:09,351 INFO  L130       PetriNetUnfolder]: 499/1175 cut-off events.
[2023-10-27 12:20:09,365 INFO  L131       PetriNetUnfolder]: For 7545/7552 co-relation queries the response was YES.
[2023-10-27 12:20:09,368 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7604 conditions, 1175 events. 499/1175 cut-off events. For 7545/7552 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6971 event pairs, 21 based on Foata normal form. 22/1196 useless extension candidates. Maximal degree in co-relation 7438. Up to 399 conditions per place. 
[2023-10-27 12:20:09,379 INFO  L137   encePairwiseOnDemand]: 162/197 looper letters, 280 selfloop transitions, 219 changer transitions 6/507 dead transitions.
[2023-10-27 12:20:09,379 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 507 transitions, 6268 flow
[2023-10-27 12:20:09,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-27 12:20:09,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-27 12:20:09,394 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1166 transitions.
[2023-10-27 12:20:09,394 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3115148276783329
[2023-10-27 12:20:09,394 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1166 transitions.
[2023-10-27 12:20:09,395 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1166 transitions.
[2023-10-27 12:20:09,395 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:09,395 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1166 transitions.
[2023-10-27 12:20:09,398 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 61.36842105263158) internal successors, (1166), 19 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:09,402 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:09,402 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:09,403 INFO  L175             Difference]: Start difference. First operand has 133 places, 349 transitions, 3800 flow. Second operand 19 states and 1166 transitions.
[2023-10-27 12:20:09,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 507 transitions, 6268 flow
[2023-10-27 12:20:09,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 507 transitions, 6250 flow, removed 0 selfloop flow, removed 7 redundant places.
[2023-10-27 12:20:09,491 INFO  L231             Difference]: Finished difference. Result has 147 places, 364 transitions, 4621 flow
[2023-10-27 12:20:09,492 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3782, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4621, PETRI_PLACES=147, PETRI_TRANSITIONS=364}
[2023-10-27 12:20:09,493 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 88 predicate places.
[2023-10-27 12:20:09,493 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 364 transitions, 4621 flow
[2023-10-27 12:20:09,493 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 51.964285714285715) internal successors, (1455), 28 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:09,494 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:09,494 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:20:09,500 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-10-27 12:20:09,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-10-27 12:20:09,698 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-27 12:20:09,699 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:09,699 INFO  L85        PathProgramCache]: Analyzing trace with hash -1870719176, now seen corresponding path program 1 times
[2023-10-27 12:20:09,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:09,699 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357374811]
[2023-10-27 12:20:09,699 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:09,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:09,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:20:09,768 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:20:09,779 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:20:09,826 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:20:09,827 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:20:09,828 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-10-27 12:20:09,829 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-10-27 12:20:09,829 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-10-27 12:20:09,829 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-10-27 12:20:09,829 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-10-27 12:20:09,829 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-10-27 12:20:09,830 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-10-27 12:20:09,830 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-10-27 12:20:09,830 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-10-27 12:20:09,830 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-27 12:20:09,830 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:09,833 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:20:09,833 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-27 12:20:09,876 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-27 12:20:09,878 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-10-27 12:20:09,915 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-10-27 12:20:09,929 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-27 12:20:09,930 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 736 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-10-27 12:20:09,930 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2023-10-27 12:20:09,931 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2023-10-27 12:20:09,931 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:20:09,931 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2023-10-27 12:20:09,931 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2023-10-27 12:20:09,932 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-10-27 12:20:09,970 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-10-27 12:20:09,970 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-27 12:20:09,971 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 736 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-10-27 12:20:09,974 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2023-10-27 12:20:12,977 INFO  L134        LiptonReduction]: Checked pairs total: 23932
[2023-10-27 12:20:12,977 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-10-27 12:20:12,978 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:20:12,979 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;@1ff26492, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:20:12,979 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-10-27 12:20:12,980 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-10-27 12:20:12,980 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:20:12,980 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:12,980 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:12,980 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:20:12,981 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:12,981 INFO  L85        PathProgramCache]: Analyzing trace with hash 1725264381, now seen corresponding path program 1 times
[2023-10-27 12:20:12,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:12,981 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912850276]
[2023-10-27 12:20:12,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:12,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:12,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:13,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:13,181 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:13,181 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912850276]
[2023-10-27 12:20:13,181 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912850276] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:13,182 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:13,182 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:20:13,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119346458]
[2023-10-27 12:20:13,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:13,182 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:20:13,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:13,183 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:20:13,183 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:20:13,507 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2023-10-27 12:20:13,507 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 154 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:13,507 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:13,508 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2023-10-27 12:20:13,508 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:14,511 INFO  L130       PetriNetUnfolder]: 2858/5896 cut-off events.
[2023-10-27 12:20:14,511 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2023-10-27 12:20:14,528 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10786 conditions, 5896 events. 2858/5896 cut-off events. For 191/349 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 40990 event pairs, 819 based on Foata normal form. 0/5496 useless extension candidates. Maximal degree in co-relation 5173. Up to 3444 conditions per place. 
[2023-10-27 12:20:14,564 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 69 selfloop transitions, 42 changer transitions 0/142 dead transitions.
[2023-10-27 12:20:14,564 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 532 flow
[2023-10-27 12:20:14,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:20:14,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:20:14,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions.
[2023-10-27 12:20:14,566 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5890937019969278
[2023-10-27 12:20:14,566 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 767 transitions.
[2023-10-27 12:20:14,566 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions.
[2023-10-27 12:20:14,566 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:14,566 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions.
[2023-10-27 12:20:14,567 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:14,573 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:14,574 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:14,574 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 767 transitions.
[2023-10-27 12:20:14,574 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 532 flow
[2023-10-27 12:20:14,575 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 142 transitions, 532 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:20:14,576 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2023-10-27 12:20:14,582 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=81, PETRI_TRANSITIONS=110}
[2023-10-27 12:20:14,583 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2023-10-27 12:20:14,583 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2023-10-27 12:20:14,583 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:14,583 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:14,583 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:14,584 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-27 12:20:14,584 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:20:14,584 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:14,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -329715416, now seen corresponding path program 1 times
[2023-10-27 12:20:14,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:14,584 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115734369]
[2023-10-27 12:20:14,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:14,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:14,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:14,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:14,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:14,636 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115734369]
[2023-10-27 12:20:14,636 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115734369] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:14,636 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:14,636 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:20:14,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200587048]
[2023-10-27 12:20:14,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:14,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-27 12:20:14,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:14,638 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-27 12:20:14,638 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-27 12:20:14,700 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 217
[2023-10-27 12:20:14,700 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 446 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:14,701 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:14,701 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 217
[2023-10-27 12:20:14,701 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:15,333 INFO  L130       PetriNetUnfolder]: 1510/4077 cut-off events.
[2023-10-27 12:20:15,334 INFO  L131       PetriNetUnfolder]: For 1360/1548 co-relation queries the response was YES.
[2023-10-27 12:20:15,356 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8852 conditions, 4077 events. 1510/4077 cut-off events. For 1360/1548 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 31624 event pairs, 527 based on Foata normal form. 0/3748 useless extension candidates. Maximal degree in co-relation 3838. Up to 1446 conditions per place. 
[2023-10-27 12:20:15,528 INFO  L137   encePairwiseOnDemand]: 213/217 looper letters, 37 selfloop transitions, 3 changer transitions 2/121 dead transitions.
[2023-10-27 12:20:15,529 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 562 flow
[2023-10-27 12:20:15,529 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:20:15,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:20:15,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions.
[2023-10-27 12:20:15,530 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.618663594470046
[2023-10-27 12:20:15,530 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 537 transitions.
[2023-10-27 12:20:15,530 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions.
[2023-10-27 12:20:15,531 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:15,531 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions.
[2023-10-27 12:20:15,531 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:15,532 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:15,533 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:15,533 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 537 transitions.
[2023-10-27 12:20:15,533 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 562 flow
[2023-10-27 12:20:15,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 121 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:20:15,538 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2023-10-27 12:20:15,538 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2023-10-27 12:20:15,538 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2023-10-27 12:20:15,538 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2023-10-27 12:20:15,539 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:15,539 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:15,539 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:15,539 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-27 12:20:15,539 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:20:15,539 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:15,540 INFO  L85        PathProgramCache]: Analyzing trace with hash 580316733, now seen corresponding path program 1 times
[2023-10-27 12:20:15,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:15,540 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562369913]
[2023-10-27 12:20:15,540 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:15,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:15,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:15,715 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:15,716 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:15,716 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562369913]
[2023-10-27 12:20:15,716 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562369913] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:15,718 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:15,718 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:20:15,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394503673]
[2023-10-27 12:20:15,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:15,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:20:15,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:15,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:20:15,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:20:16,095 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 217
[2023-10-27 12:20:16,096 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 466 flow. Second operand  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:16,096 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:16,096 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 217
[2023-10-27 12:20:16,096 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:18,075 INFO  L130       PetriNetUnfolder]: 6215/11785 cut-off events.
[2023-10-27 12:20:18,085 INFO  L131       PetriNetUnfolder]: For 6036/6204 co-relation queries the response was YES.
[2023-10-27 12:20:18,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30089 conditions, 11785 events. 6215/11785 cut-off events. For 6036/6204 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 86479 event pairs, 1278 based on Foata normal form. 19/11441 useless extension candidates. Maximal degree in co-relation 29960. Up to 6839 conditions per place. 
[2023-10-27 12:20:18,192 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 116 selfloop transitions, 104 changer transitions 1/253 dead transitions.
[2023-10-27 12:20:18,192 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 253 transitions, 1504 flow
[2023-10-27 12:20:18,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:20:18,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:20:18,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 749 transitions.
[2023-10-27 12:20:18,194 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5752688172043011
[2023-10-27 12:20:18,194 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 749 transitions.
[2023-10-27 12:20:18,194 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 749 transitions.
[2023-10-27 12:20:18,194 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:18,195 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 749 transitions.
[2023-10-27 12:20:18,196 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:18,222 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:18,223 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:18,223 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 749 transitions.
[2023-10-27 12:20:18,223 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 253 transitions, 1504 flow
[2023-10-27 12:20:18,232 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 253 transitions, 1501 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:20:18,234 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2023-10-27 12:20:18,234 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=95, PETRI_TRANSITIONS=215}
[2023-10-27 12:20:18,235 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2023-10-27 12:20:18,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2023-10-27 12:20:18,236 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:18,236 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:18,236 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:18,236 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-27 12:20:18,236 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:20:18,236 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:18,237 INFO  L85        PathProgramCache]: Analyzing trace with hash 747515608, now seen corresponding path program 1 times
[2023-10-27 12:20:18,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:18,245 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9151213]
[2023-10-27 12:20:18,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:18,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:18,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:18,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:18,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:18,526 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9151213]
[2023-10-27 12:20:18,526 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9151213] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:20:18,526 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:20:18,526 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:20:18,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563201401]
[2023-10-27 12:20:18,526 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:20:18,527 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:20:18,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:18,527 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:20:18,527 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:20:18,687 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217
[2023-10-27 12:20:18,687 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 215 transitions, 1492 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:18,687 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:18,687 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217
[2023-10-27 12:20:18,687 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:21,770 INFO  L130       PetriNetUnfolder]: 10728/18665 cut-off events.
[2023-10-27 12:20:21,770 INFO  L131       PetriNetUnfolder]: For 23070/23295 co-relation queries the response was YES.
[2023-10-27 12:20:21,799 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63188 conditions, 18665 events. 10728/18665 cut-off events. For 23070/23295 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 132578 event pairs, 3389 based on Foata normal form. 4/17840 useless extension candidates. Maximal degree in co-relation 44831. Up to 15062 conditions per place. 
[2023-10-27 12:20:21,958 INFO  L137   encePairwiseOnDemand]: 183/217 looper letters, 241 selfloop transitions, 178 changer transitions 0/437 dead transitions.
[2023-10-27 12:20:21,959 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 437 transitions, 3398 flow
[2023-10-27 12:20:21,959 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:20:21,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:20:21,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions.
[2023-10-27 12:20:21,961 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6105990783410138
[2023-10-27 12:20:21,974 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 795 transitions.
[2023-10-27 12:20:21,974 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions.
[2023-10-27 12:20:21,977 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:21,977 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions.
[2023-10-27 12:20:21,978 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:21,979 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:21,979 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:21,979 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 795 transitions.
[2023-10-27 12:20:21,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 437 transitions, 3398 flow
[2023-10-27 12:20:22,041 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 437 transitions, 3388 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-10-27 12:20:22,044 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2023-10-27 12:20:22,045 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2975, PETRI_PLACES=102, PETRI_TRANSITIONS=377}
[2023-10-27 12:20:22,046 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2023-10-27 12:20:22,046 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2023-10-27 12:20:22,046 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:22,046 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:22,046 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:22,046 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-27 12:20:22,046 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:20:22,047 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:22,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 102692192, now seen corresponding path program 1 times
[2023-10-27 12:20:22,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:22,047 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321070618]
[2023-10-27 12:20:22,047 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:22,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:22,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:22,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:22,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:22,505 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321070618]
[2023-10-27 12:20:22,505 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321070618] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:22,505 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210437237]
[2023-10-27 12:20:22,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:22,506 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:22,506 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:22,507 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:20:22,564 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-10-27 12:20:22,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:22,717 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-27 12:20:22,723 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:22,736 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-27 12:20:22,818 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:20:22,859 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:20:22,893 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:22,893 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:20:22,956 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:22,956 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:20:23,010 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:23,011 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:20:23,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:23,019 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:20:23,038 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false
[2023-10-27 12:20:23,065 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2023-10-27 12:20:23,077 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-10-27 12:20:23,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-27 12:20:23,206 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210437237] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:23,206 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:23,206 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-27 12:20:23,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147596743]
[2023-10-27 12:20:23,206 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:23,206 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-27 12:20:23,206 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:23,207 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-27 12:20:23,207 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-27 12:20:23,251 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 217
[2023-10-27 12:20:23,252 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:23,252 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:23,252 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 217
[2023-10-27 12:20:23,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:29,062 INFO  L130       PetriNetUnfolder]: 16562/27029 cut-off events.
[2023-10-27 12:20:29,062 INFO  L131       PetriNetUnfolder]: For 50811/50817 co-relation queries the response was YES.
[2023-10-27 12:20:29,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109425 conditions, 27029 events. 16562/27029 cut-off events. For 50811/50817 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 187796 event pairs, 4731 based on Foata normal form. 6/24531 useless extension candidates. Maximal degree in co-relation 73100. Up to 19181 conditions per place. 
[2023-10-27 12:20:29,401 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 551 selfloop transitions, 371 changer transitions 1/926 dead transitions.
[2023-10-27 12:20:29,401 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 926 transitions, 8498 flow
[2023-10-27 12:20:29,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-10-27 12:20:29,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-10-27 12:20:29,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1563 transitions.
[2023-10-27 12:20:29,408 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4001536098310292
[2023-10-27 12:20:29,409 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1563 transitions.
[2023-10-27 12:20:29,409 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1563 transitions.
[2023-10-27 12:20:29,409 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:29,409 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1563 transitions.
[2023-10-27 12:20:29,411 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 86.83333333333333) internal successors, (1563), 18 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:29,429 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 217.0) internal successors, (4123), 19 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:29,429 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 217.0) internal successors, (4123), 19 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:29,430 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 18 states and 1563 transitions.
[2023-10-27 12:20:29,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 926 transitions, 8498 flow
[2023-10-27 12:20:30,094 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 926 transitions, 8378 flow, removed 60 selfloop flow, removed 0 redundant places.
[2023-10-27 12:20:30,105 INFO  L231             Difference]: Finished difference. Result has 133 places, 653 transitions, 6935 flow
[2023-10-27 12:20:30,105 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6935, PETRI_PLACES=133, PETRI_TRANSITIONS=653}
[2023-10-27 12:20:30,105 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 62 predicate places.
[2023-10-27 12:20:30,106 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 653 transitions, 6935 flow
[2023-10-27 12:20:30,106 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:30,106 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:30,106 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:30,112 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-27 12:20:30,311 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-10-27 12:20:30,311 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:20:30,312 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:30,312 INFO  L85        PathProgramCache]: Analyzing trace with hash -1170144666, now seen corresponding path program 1 times
[2023-10-27 12:20:30,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:30,324 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126902234]
[2023-10-27 12:20:30,324 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:30,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:30,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:30,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:30,781 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:30,781 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126902234]
[2023-10-27 12:20:30,781 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126902234] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:30,781 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786831886]
[2023-10-27 12:20:30,781 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:30,782 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:30,782 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:30,798 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:20:30,826 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-27 12:20:30,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:31,002 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-27 12:20:31,004 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:31,020 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-27 12:20:31,142 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:20:31,179 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:31,180 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:20:31,222 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:31,223 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:31,223 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:20:31,277 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:31,278 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:31,278 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:31,279 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:20:31,340 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:31,341 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:20:31,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:31,384 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:20:31,717 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))) is different from false
[2023-10-27 12:20:31,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-27 12:20:31,860 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [786831886] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:31,860 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:31,860 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-10-27 12:20:31,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749319344]
[2023-10-27 12:20:31,861 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:31,862 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-27 12:20:31,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:31,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-27 12:20:31,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=520, Unknown=23, NotChecked=48, Total=702
[2023-10-27 12:20:32,053 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 217
[2023-10-27 12:20:32,054 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 653 transitions, 6935 flow. Second operand  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:32,054 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:32,054 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 217
[2023-10-27 12:20:32,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:39,015 INFO  L130       PetriNetUnfolder]: 19305/31847 cut-off events.
[2023-10-27 12:20:39,015 INFO  L131       PetriNetUnfolder]: For 113899/113899 co-relation queries the response was YES.
[2023-10-27 12:20:39,100 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 154854 conditions, 31847 events. 19305/31847 cut-off events. For 113899/113899 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 228008 event pairs, 2748 based on Foata normal form. 230/29258 useless extension candidates. Maximal degree in co-relation 134937. Up to 15974 conditions per place. 
[2023-10-27 12:20:39,334 INFO  L137   encePairwiseOnDemand]: 187/217 looper letters, 841 selfloop transitions, 489 changer transitions 0/1333 dead transitions.
[2023-10-27 12:20:39,334 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 1333 transitions, 15562 flow
[2023-10-27 12:20:39,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-10-27 12:20:39,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-10-27 12:20:39,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions.
[2023-10-27 12:20:39,336 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3980414746543779
[2023-10-27 12:20:39,337 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1382 transitions.
[2023-10-27 12:20:39,337 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1382 transitions.
[2023-10-27 12:20:39,337 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:39,353 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1382 transitions.
[2023-10-27 12:20:39,355 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 86.375) internal successors, (1382), 16 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:39,357 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 217.0) internal successors, (3689), 17 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:39,358 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 217.0) internal successors, (3689), 17 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:39,358 INFO  L175             Difference]: Start difference. First operand has 133 places, 653 transitions, 6935 flow. Second operand 16 states and 1382 transitions.
[2023-10-27 12:20:39,358 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 1333 transitions, 15562 flow
[2023-10-27 12:20:41,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 1333 transitions, 15515 flow, removed 22 selfloop flow, removed 1 redundant places.
[2023-10-27 12:20:41,345 INFO  L231             Difference]: Finished difference. Result has 154 places, 931 transitions, 11989 flow
[2023-10-27 12:20:41,345 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=6889, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11989, PETRI_PLACES=154, PETRI_TRANSITIONS=931}
[2023-10-27 12:20:41,346 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 83 predicate places.
[2023-10-27 12:20:41,346 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 931 transitions, 11989 flow
[2023-10-27 12:20:41,361 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:41,361 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:41,361 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:41,371 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-27 12:20:41,566 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-10-27 12:20:41,566 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:20:41,566 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:41,566 INFO  L85        PathProgramCache]: Analyzing trace with hash 1669689062, now seen corresponding path program 1 times
[2023-10-27 12:20:41,567 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:41,567 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299776023]
[2023-10-27 12:20:41,567 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:41,567 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:41,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:42,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:42,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:42,077 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299776023]
[2023-10-27 12:20:42,077 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299776023] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:42,077 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053583268]
[2023-10-27 12:20:42,077 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:42,077 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:42,078 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:42,078 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:20:42,123 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-10-27 12:20:42,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:42,292 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-27 12:20:42,306 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:42,319 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-27 12:20:42,405 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:20:42,426 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:20:42,468 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:42,468 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:20:42,513 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:42,513 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:20:42,565 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:42,565 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:20:42,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:42,572 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:20:42,608 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-27 12:20:42,765 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-10-27 12:20:42,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:42,896 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053583268] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:42,896 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:42,896 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-27 12:20:42,896 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099319309]
[2023-10-27 12:20:42,897 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:42,897 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-27 12:20:42,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:42,897 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-27 12:20:42,897 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=446, Unknown=12, NotChecked=90, Total=650
[2023-10-27 12:20:43,254 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 217
[2023-10-27 12:20:43,256 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 931 transitions, 11989 flow. Second operand  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:43,256 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:43,256 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 217
[2023-10-27 12:20:43,256 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:53,753 INFO  L130       PetriNetUnfolder]: 23371/38348 cut-off events.
[2023-10-27 12:20:53,753 INFO  L131       PetriNetUnfolder]: For 185516/185516 co-relation queries the response was YES.
[2023-10-27 12:20:53,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 210064 conditions, 38348 events. 23371/38348 cut-off events. For 185516/185516 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 282963 event pairs, 3764 based on Foata normal form. 0/35273 useless extension candidates. Maximal degree in co-relation 181911. Up to 26196 conditions per place. 
[2023-10-27 12:20:54,131 INFO  L137   encePairwiseOnDemand]: 153/217 looper letters, 975 selfloop transitions, 621 changer transitions 1/1600 dead transitions.
[2023-10-27 12:20:54,131 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1600 transitions, 20849 flow
[2023-10-27 12:20:54,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-27 12:20:54,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-27 12:20:54,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1627 transitions.
[2023-10-27 12:20:54,139 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3946155711860296
[2023-10-27 12:20:54,139 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1627 transitions.
[2023-10-27 12:20:54,139 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1627 transitions.
[2023-10-27 12:20:54,140 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:54,140 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1627 transitions.
[2023-10-27 12:20:54,149 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 85.63157894736842) internal successors, (1627), 19 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,154 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,162 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,162 INFO  L175             Difference]: Start difference. First operand has 154 places, 931 transitions, 11989 flow. Second operand 19 states and 1627 transitions.
[2023-10-27 12:20:54,162 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1600 transitions, 20849 flow
[2023-10-27 12:20:57,880 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1600 transitions, 20663 flow, removed 68 selfloop flow, removed 5 redundant places.
[2023-10-27 12:20:57,898 INFO  L231             Difference]: Finished difference. Result has 172 places, 1306 transitions, 18102 flow
[2023-10-27 12:20:57,899 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=11813, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=18102, PETRI_PLACES=172, PETRI_TRANSITIONS=1306}
[2023-10-27 12:20:57,904 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 101 predicate places.
[2023-10-27 12:20:57,905 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 1306 transitions, 18102 flow
[2023-10-27 12:20:57,905 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:57,905 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:57,905 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:20:57,912 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-10-27 12:20:58,110 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-27 12:20:58,110 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:20:58,111 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:58,111 INFO  L85        PathProgramCache]: Analyzing trace with hash 517033069, now seen corresponding path program 1 times
[2023-10-27 12:20:58,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:58,112 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085900177]
[2023-10-27 12:20:58,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:58,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:58,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:58,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:58,653 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:58,653 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085900177]
[2023-10-27 12:20:58,653 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085900177] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:58,653 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538937593]
[2023-10-27 12:20:58,653 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:58,653 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:58,653 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:58,670 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:20:58,699 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-10-27 12:20:58,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:58,838 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-27 12:20:58,841 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:58,893 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-27 12:20:59,008 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:20:59,046 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:59,047 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:20:59,096 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:59,097 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:59,097 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:20:59,139 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:59,140 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:59,141 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:59,142 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:20:59,218 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:59,219 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:20:59,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:59,251 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:20:59,270 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2023-10-27 12:20:59,306 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-10-27 12:20:59,378 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))))) is different from false
[2023-10-27 12:20:59,453 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2))) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39)))))) is different from false
[2023-10-27 12:20:59,504 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false
[2023-10-27 12:20:59,527 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:59,528 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-10-27 12:20:59,542 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:59,543 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2023-10-27 12:20:59,545 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2023-10-27 12:20:59,553 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:20:59,553 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-10-27 12:20:59,557 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:20:59,558 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-27 12:20:59,562 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:20:59,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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-27 12:20:59,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:59,654 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538937593] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:59,654 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:59,654 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-10-27 12:20:59,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643245918]
[2023-10-27 12:20:59,655 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:59,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-27 12:20:59,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:59,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-27 12:20:59,656 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=455, Unknown=5, NotChecked=240, Total=812
[2023-10-27 12:20:59,781 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 217
[2023-10-27 12:20:59,782 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1306 transitions, 18102 flow. Second operand  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:59,782 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:59,782 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 217
[2023-10-27 12:20:59,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:11,979 INFO  L130       PetriNetUnfolder]: 27062/44967 cut-off events.
[2023-10-27 12:21:11,979 INFO  L131       PetriNetUnfolder]: For 320825/320835 co-relation queries the response was YES.
[2023-10-27 12:21:12,151 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 294720 conditions, 44967 events. 27062/44967 cut-off events. For 320825/320835 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 342153 event pairs, 3307 based on Foata normal form. 283/41530 useless extension candidates. Maximal degree in co-relation 256432. Up to 23187 conditions per place. 
[2023-10-27 12:21:12,330 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 1188 selfloop transitions, 910 changer transitions 0/2101 dead transitions.
[2023-10-27 12:21:12,330 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 2101 transitions, 32784 flow
[2023-10-27 12:21:12,330 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-10-27 12:21:12,330 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2023-10-27 12:21:12,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1157 transitions.
[2023-10-27 12:21:12,347 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.380842659644503
[2023-10-27 12:21:12,347 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1157 transitions.
[2023-10-27 12:21:12,347 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1157 transitions.
[2023-10-27 12:21:12,349 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:12,349 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1157 transitions.
[2023-10-27 12:21:12,351 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 82.64285714285714) internal successors, (1157), 14 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:12,354 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 217.0) internal successors, (3255), 15 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:12,355 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 217.0) internal successors, (3255), 15 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:12,355 INFO  L175             Difference]: Start difference. First operand has 172 places, 1306 transitions, 18102 flow. Second operand 14 states and 1157 transitions.
[2023-10-27 12:21:12,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 2101 transitions, 32784 flow
[2023-10-27 12:21:21,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 2101 transitions, 32421 flow, removed 138 selfloop flow, removed 9 redundant places.
[2023-10-27 12:21:21,763 INFO  L231             Difference]: Finished difference. Result has 183 places, 1750 transitions, 28975 flow
[2023-10-27 12:21:21,764 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=17885, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=466, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=28975, PETRI_PLACES=183, PETRI_TRANSITIONS=1750}
[2023-10-27 12:21:21,764 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 112 predicate places.
[2023-10-27 12:21:21,765 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 1750 transitions, 28975 flow
[2023-10-27 12:21:21,765 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:21,765 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:21,765 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:21,772 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2023-10-27 12:21:21,970 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:21:21,970 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:21:21,973 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:21,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -785127108, now seen corresponding path program 1 times
[2023-10-27 12:21:21,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:21,974 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169223315]
[2023-10-27 12:21:21,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:21,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:22,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:22,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:21:22,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:22,278 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169223315]
[2023-10-27 12:21:22,278 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169223315] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:22,278 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:22,278 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:21:22,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50469781]
[2023-10-27 12:21:22,278 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:22,279 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:21:22,279 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:22,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:21:22,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:21:22,738 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 217
[2023-10-27 12:21:22,739 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 1750 transitions, 28975 flow. Second operand  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:22,739 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:22,739 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 217
[2023-10-27 12:21:22,739 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:33,617 INFO  L130       PetriNetUnfolder]: 21880/39367 cut-off events.
[2023-10-27 12:21:33,617 INFO  L131       PetriNetUnfolder]: For 410800/417515 co-relation queries the response was YES.
[2023-10-27 12:21:33,806 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 266213 conditions, 39367 events. 21880/39367 cut-off events. For 410800/417515 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 331804 event pairs, 4147 based on Foata normal form. 1101/39049 useless extension candidates. Maximal degree in co-relation 240356. Up to 24514 conditions per place. 
[2023-10-27 12:21:33,983 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 1438 selfloop transitions, 201 changer transitions 0/1965 dead transitions.
[2023-10-27 12:21:33,984 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1965 transitions, 35740 flow
[2023-10-27 12:21:33,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:21:33,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:21:33,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions.
[2023-10-27 12:21:33,993 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5898617511520737
[2023-10-27 12:21:33,993 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 768 transitions.
[2023-10-27 12:21:33,993 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions.
[2023-10-27 12:21:33,993 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:33,993 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions.
[2023-10-27 12:21:33,994 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:34,009 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:34,009 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:34,010 INFO  L175             Difference]: Start difference. First operand has 183 places, 1750 transitions, 28975 flow. Second operand 6 states and 768 transitions.
[2023-10-27 12:21:34,010 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1965 transitions, 35740 flow
[2023-10-27 12:21:39,786 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1965 transitions, 35658 flow, removed 0 selfloop flow, removed 6 redundant places.
[2023-10-27 12:21:39,840 INFO  L231             Difference]: Finished difference. Result has 187 places, 1938 transitions, 33051 flow
[2023-10-27 12:21:39,844 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=28893, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=33051, PETRI_PLACES=187, PETRI_TRANSITIONS=1938}
[2023-10-27 12:21:39,844 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 116 predicate places.
[2023-10-27 12:21:39,844 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 1938 transitions, 33051 flow
[2023-10-27 12:21:39,844 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:39,845 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:39,845 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:39,845 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-27 12:21:39,847 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:21:39,847 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:39,847 INFO  L85        PathProgramCache]: Analyzing trace with hash -672070267, now seen corresponding path program 2 times
[2023-10-27 12:21:39,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:39,847 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589429195]
[2023-10-27 12:21:39,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:39,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:39,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:40,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:40,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:40,550 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589429195]
[2023-10-27 12:21:40,550 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589429195] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:21:40,550 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29177318]
[2023-10-27 12:21:40,550 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:21:40,550 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:21:40,551 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:21:40,552 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:21:40,585 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-10-27 12:21:40,810 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:21:40,810 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:21:40,811 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-10-27 12:21:40,818 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:21:40,838 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2023-10-27 12:21:40,994 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:21:41,041 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:21:41,106 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:21:41,107 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:21:41,151 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:21:41,152 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:21:41,203 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:41,204 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:21:41,240 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:41,241 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:21:41,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:41,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:21:41,292 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:41,306 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:21:41,374 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:21:41,375 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:21:41,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:41,395 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:21:41,416 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-10-27 12:21:53,732 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-10-27 12:21:53,755 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-27 12:21:53,793 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-27 12:21:53,834 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:21:53,834 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54
[2023-10-27 12:21:53,841 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:21:53,841 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 130 treesize of output 66
[2023-10-27 12:21:53,846 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 28 treesize of output 24
[2023-10-27 12:21:53,848 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 42 treesize of output 34
[2023-10-27 12:21:53,882 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:21:53,883 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1
[2023-10-27 12:21:53,888 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:21:53,888 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2023-10-27 12:21:53,893 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:21:53,893 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2023-10-27 12:21:53,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 0 trivial. 4 not checked.
[2023-10-27 12:21:53,978 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [29177318] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:21:53,978 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:21:53,979 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25
[2023-10-27 12:21:53,979 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129795346]
[2023-10-27 12:21:53,979 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:21:53,979 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-27 12:21:53,979 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:53,980 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-27 12:21:53,980 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=401, Unknown=20, NotChecked=180, Total=702
[2023-10-27 12:21:54,108 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 217
[2023-10-27 12:21:54,109 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1938 transitions, 33051 flow. Second operand  has 27 states, 27 states have (on average 65.18518518518519) internal successors, (1760), 27 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:54,109 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:54,109 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 217
[2023-10-27 12:21:54,109 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:17,136 INFO  L130       PetriNetUnfolder]: 31291/52080 cut-off events.
[2023-10-27 12:22:17,136 INFO  L131       PetriNetUnfolder]: For 537104/537122 co-relation queries the response was YES.
[2023-10-27 12:22:17,439 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 383472 conditions, 52080 events. 31291/52080 cut-off events. For 537104/537122 co-relation queries the response was YES. Maximal size of possible extension queue 1425. Compared 405223 event pairs, 4267 based on Foata normal form. 12/48558 useless extension candidates. Maximal degree in co-relation 350443. Up to 26739 conditions per place. 
[2023-10-27 12:22:17,766 INFO  L137   encePairwiseOnDemand]: 153/217 looper letters, 1319 selfloop transitions, 1776 changer transitions 1/3100 dead transitions.
[2023-10-27 12:22:17,767 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 3100 transitions, 53789 flow
[2023-10-27 12:22:17,774 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-10-27 12:22:17,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-10-27 12:22:17,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1745 transitions.
[2023-10-27 12:22:17,777 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.402073732718894
[2023-10-27 12:22:17,777 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1745 transitions.
[2023-10-27 12:22:17,777 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1745 transitions.
[2023-10-27 12:22:17,777 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:17,777 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1745 transitions.
[2023-10-27 12:22:17,779 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 87.25) internal successors, (1745), 20 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:17,782 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 217.0) internal successors, (4557), 21 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:17,800 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 217.0) internal successors, (4557), 21 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:17,800 INFO  L175             Difference]: Start difference. First operand has 187 places, 1938 transitions, 33051 flow. Second operand 20 states and 1745 transitions.
[2023-10-27 12:22:17,800 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 3100 transitions, 53789 flow
[2023-10-27 12:22:31,751 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 3100 transitions, 53495 flow, removed 147 selfloop flow, removed 0 redundant places.
[2023-10-27 12:22:31,833 INFO  L231             Difference]: Finished difference. Result has 213 places, 2619 transitions, 49692 flow
[2023-10-27 12:22:31,849 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=32763, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=49692, PETRI_PLACES=213, PETRI_TRANSITIONS=2619}
[2023-10-27 12:22:31,850 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 142 predicate places.
[2023-10-27 12:22:31,850 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 2619 transitions, 49692 flow
[2023-10-27 12:22:31,851 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 65.18518518518519) internal successors, (1760), 27 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:31,851 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:22:31,851 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:22:31,857 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2023-10-27 12:22:32,055 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:22:32,056 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:22:32,056 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:22:32,056 INFO  L85        PathProgramCache]: Analyzing trace with hash -72607429, now seen corresponding path program 1 times
[2023-10-27 12:22:32,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:22:32,057 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606464441]
[2023-10-27 12:22:32,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:32,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:22:32,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:32,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:32,943 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:32,943 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606464441]
[2023-10-27 12:22:32,943 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606464441] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:22:32,943 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011880945]
[2023-10-27 12:22:32,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:32,943 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:22:32,943 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:22:32,944 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:22:32,971 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-10-27 12:22:33,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:33,154 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core
[2023-10-27 12:22:33,158 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:22:33,169 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:33,171 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:33,173 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2023-10-27 12:22:33,652 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:22:33,653 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2023-10-27 12:22:33,772 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:22:33,773 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-10-27 12:22:33,921 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-10-27 12:22:33,922 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2023-10-27 12:22:33,955 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:22:33,966 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:22:33,980 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:33,980 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:22:34,010 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:34,010 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:22:34,023 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:22:34,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:34,031 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:22:34,220 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2023-10-27 12:22:34,234 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-10-27 12:22:34,263 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-27 12:22:34,275 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:34,275 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-10-27 12:22:34,280 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:34,280 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32
[2023-10-27 12:22:34,302 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:22:34,302 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-27 12:22:34,306 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:22:34,306 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-10-27 12:22:34,310 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:22:34,311 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-27 12:22:34,427 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1748) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1749) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2023-10-27 12:22:34,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:34,737 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011880945] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:22:34,737 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:22:34,737 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 27
[2023-10-27 12:22:34,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669431109]
[2023-10-27 12:22:34,737 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:22:34,737 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-27 12:22:34,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:34,738 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-27 12:22:34,738 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=489, Unknown=31, NotChecked=196, Total=812
[2023-10-27 12:22:34,995 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 217
[2023-10-27 12:22:34,996 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 2619 transitions, 49692 flow. Second operand  has 29 states, 29 states have (on average 61.51724137931034) internal successors, (1784), 29 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:34,996 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:34,996 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 217
[2023-10-27 12:22:34,996 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:09,918 INFO  L130       PetriNetUnfolder]: 42548/70117 cut-off events.
[2023-10-27 12:23:09,918 INFO  L131       PetriNetUnfolder]: For 986877/986877 co-relation queries the response was YES.
[2023-10-27 12:23:10,398 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 602628 conditions, 70117 events. 42548/70117 cut-off events. For 986877/986877 co-relation queries the response was YES. Maximal size of possible extension queue 1781. Compared 555439 event pairs, 5200 based on Foata normal form. 0/65762 useless extension candidates. Maximal degree in co-relation 551003. Up to 52823 conditions per place. 
[2023-10-27 12:23:10,748 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 4089 selfloop transitions, 627 changer transitions 4/4721 dead transitions.
[2023-10-27 12:23:10,748 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 4721 transitions, 92231 flow
[2023-10-27 12:23:10,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-10-27 12:23:10,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2023-10-27 12:23:10,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1835 transitions.
[2023-10-27 12:23:10,753 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3523425499231951
[2023-10-27 12:23:10,753 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1835 transitions.
[2023-10-27 12:23:10,753 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1835 transitions.
[2023-10-27 12:23:10,754 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:10,754 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1835 transitions.
[2023-10-27 12:23:10,756 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 76.45833333333333) internal successors, (1835), 24 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:10,760 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 217.0) internal successors, (5425), 25 states have internal predecessors, (5425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:10,760 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 217.0) internal successors, (5425), 25 states have internal predecessors, (5425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:23:10,760 INFO  L175             Difference]: Start difference. First operand has 213 places, 2619 transitions, 49692 flow. Second operand 24 states and 1835 transitions.
[2023-10-27 12:23:10,760 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 4721 transitions, 92231 flow
[2023-10-27 12:24:03,192 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 4721 transitions, 90161 flow, removed 952 selfloop flow, removed 11 redundant places.
[2023-10-27 12:24:03,298 INFO  L231             Difference]: Finished difference. Result has 241 places, 3276 transitions, 63716 flow
[2023-10-27 12:24:03,300 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48472, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=63716, PETRI_PLACES=241, PETRI_TRANSITIONS=3276}
[2023-10-27 12:24:03,300 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 170 predicate places.
[2023-10-27 12:24:03,304 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 3276 transitions, 63716 flow
[2023-10-27 12:24:03,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 61.51724137931034) internal successors, (1784), 29 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:03,304 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:24:03,304 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:24:03,317 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2023-10-27 12:24:03,509 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2023-10-27 12:24:03,509 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:24:03,510 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:24:03,510 INFO  L85        PathProgramCache]: Analyzing trace with hash -824079329, now seen corresponding path program 2 times
[2023-10-27 12:24:03,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:24:03,510 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164463843]
[2023-10-27 12:24:03,510 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:24:03,510 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:24:03,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:24:04,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:04,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:24:04,295 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164463843]
[2023-10-27 12:24:04,295 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164463843] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:24:04,296 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906137012]
[2023-10-27 12:24:04,296 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:24:04,296 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:24:04,296 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:24:04,297 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:24:04,324 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2023-10-27 12:24:04,535 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:24:04,536 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:24:04,537 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 62 conjunts are in the unsatisfiable core
[2023-10-27 12:24:04,540 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:24:04,564 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 103 treesize of output 97
[2023-10-27 12:24:05,170 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-27 12:24:05,170 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 57 treesize of output 59
[2023-10-27 12:24:05,180 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,182 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,202 INFO  L321             Elim1Store]: treesize reduction 15, result has 46.4 percent of original size
[2023-10-27 12:24:05,203 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 1 case distinctions, treesize of input 32 treesize of output 43
[2023-10-27 12:24:05,220 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:24:05,235 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2023-10-27 12:24:05,506 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-27 12:24:05,512 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-27 12:24:05,668 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:24:05,723 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,724 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:24:05,791 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,792 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,794 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:24:05,880 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,881 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,882 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,882 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:24:05,969 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,971 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,972 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:24:05,973 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-10-27 12:24:06,033 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:06,033 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:24:07,398 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1883 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (or .cse0 (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 3))))) (or .cse0 (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 1))))) (or .cse0 (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 2))))))) is different from false
[2023-10-27 12:24:07,567 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse2 (forall ((v_ArrVal_1883 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1883) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))))) (and (or (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 1)))) .cse2) (or .cse2 (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 3) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 2)))) .cse2) (or (forall ((v_ArrVal_1882 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1882) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse2)))) is different from false
[2023-10-27 12:24:07,955 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:24:07,956 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906137012] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:24:07,956 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:24:07,956 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38
[2023-10-27 12:24:07,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472984547]
[2023-10-27 12:24:07,956 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:24:07,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2023-10-27 12:24:07,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:24:07,956 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2023-10-27 12:24:07,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1217, Unknown=3, NotChecked=146, Total=1560
[2023-10-27 12:24:08,283 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 217
[2023-10-27 12:24:08,284 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 3276 transitions, 63716 flow. Second operand  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:24:08,284 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:24:08,284 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 217
[2023-10-27 12:24:08,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:24:59,028 INFO  L130       PetriNetUnfolder]: 49376/81237 cut-off events.
[2023-10-27 12:24:59,028 INFO  L131       PetriNetUnfolder]: For 1525059/1525059 co-relation queries the response was YES.
[2023-10-27 12:24:59,716 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 748750 conditions, 81237 events. 49376/81237 cut-off events. For 1525059/1525059 co-relation queries the response was YES. Maximal size of possible extension queue 2184. Compared 662060 event pairs, 8950 based on Foata normal form. 0/76399 useless extension candidates. Maximal degree in co-relation 683203. Up to 68476 conditions per place. 
[2023-10-27 12:25:00,289 INFO  L137   encePairwiseOnDemand]: 189/217 looper letters, 3852 selfloop transitions, 531 changer transitions 8/4392 dead transitions.
[2023-10-27 12:25:00,290 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 4392 transitions, 92949 flow
[2023-10-27 12:25:00,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-10-27 12:25:00,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-10-27 12:25:00,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1454 transitions.
[2023-10-27 12:25:00,298 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2913243838910038
[2023-10-27 12:25:00,299 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1454 transitions.
[2023-10-27 12:25:00,299 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1454 transitions.
[2023-10-27 12:25:00,300 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:25:00,300 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1454 transitions.
[2023-10-27 12:25:00,305 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 63.21739130434783) internal successors, (1454), 23 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:00,309 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 217.0) internal successors, (5208), 24 states have internal predecessors, (5208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:00,309 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 217.0) internal successors, (5208), 24 states have internal predecessors, (5208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:25:00,310 INFO  L175             Difference]: Start difference. First operand has 241 places, 3276 transitions, 63716 flow. Second operand 23 states and 1454 transitions.
[2023-10-27 12:25:00,310 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 4392 transitions, 92949 flow
[2023-10-27 12:26:31,711 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 4392 transitions, 92039 flow, removed 452 selfloop flow, removed 3 redundant places.
[2023-10-27 12:26:31,777 INFO  L231             Difference]: Finished difference. Result has 273 places, 3853 transitions, 78218 flow
[2023-10-27 12:26:31,780 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=62828, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=78218, PETRI_PLACES=273, PETRI_TRANSITIONS=3853}
[2023-10-27 12:26:31,780 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 202 predicate places.
[2023-10-27 12:26:31,780 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 3853 transitions, 78218 flow
[2023-10-27 12:26:31,781 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:26:31,781 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:26:31,781 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:26:31,787 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2023-10-27 12:26:31,986 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2023-10-27 12:26:31,986 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:26:31,987 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:26:31,987 INFO  L85        PathProgramCache]: Analyzing trace with hash 1232965583, now seen corresponding path program 3 times
[2023-10-27 12:26:31,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:26:31,987 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806040804]
[2023-10-27 12:26:31,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:26:31,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:26:32,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:26:32,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:26:32,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:26:32,871 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806040804]
[2023-10-27 12:26:32,871 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806040804] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:26:32,871 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856272609]
[2023-10-27 12:26:32,871 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-27 12:26:32,871 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:26:32,871 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:26:32,872 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:26:32,900 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2023-10-27 12:26:33,107 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-27 12:26:33,107 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:26:33,108 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 69 conjunts are in the unsatisfiable core
[2023-10-27 12:26:33,111 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:26:33,134 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:33,136 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:33,139 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2023-10-27 12:26:33,214 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-27 12:26:33,741 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:26:33,742 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 62
[2023-10-27 12:26:33,967 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:26:33,967 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-10-27 12:26:34,064 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:26:34,160 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:26:34,160 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 35
[2023-10-27 12:26:34,235 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:34,236 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:26:34,299 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:34,300 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:34,301 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:26:34,360 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:34,361 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:34,362 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:34,363 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:26:34,423 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:34,425 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-10-27 12:26:34,478 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:34,479 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-10-27 12:26:34,517 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:34,518 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-10-27 12:26:34,539 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:26:34,541 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-10-27 12:26:34,650 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:26:34,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:26:34,722 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:26:34,749 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2034 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2034 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2034 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2034 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false
[2023-10-27 12:26:34,795 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-10-27 12:26:34,866 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false
[2023-10-27 12:26:35,671 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:26:35,671 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 42 treesize of output 58
[2023-10-27 12:26:35,677 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:26:35,677 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 134 treesize of output 82
[2023-10-27 12:26:35,682 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 36 treesize of output 32
[2023-10-27 12:26:35,685 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 54 treesize of output 46
[2023-10-27 12:26:35,705 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:26:35,706 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 42 treesize of output 1
[2023-10-27 12:26:35,726 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:26:35,726 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 40 treesize of output 1
[2023-10-27 12:26:35,732 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:26:35,732 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 42 treesize of output 1
[2023-10-27 12:26:35,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:26:35,973 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [856272609] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:26:35,973 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:26:35,973 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35
[2023-10-27 12:26:35,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300871643]
[2023-10-27 12:26:35,973 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:26:35,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2023-10-27 12:26:35,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:26:35,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2023-10-27 12:26:35,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=944, Unknown=41, NotChecked=198, Total=1332
[2023-10-27 12:26:36,278 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-10-27 12:26:36,279 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 3853 transitions, 78218 flow. Second operand  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:26:36,279 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:26:36,279 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-10-27 12:26:36,279 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:27:37,821 INFO  L130       PetriNetUnfolder]: 50396/82879 cut-off events.
[2023-10-27 12:27:37,821 INFO  L131       PetriNetUnfolder]: For 1700804/1700804 co-relation queries the response was YES.
[2023-10-27 12:27:38,568 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 784516 conditions, 82879 events. 50396/82879 cut-off events. For 1700804/1700804 co-relation queries the response was YES. Maximal size of possible extension queue 2237. Compared 675626 event pairs, 8713 based on Foata normal form. 0/77963 useless extension candidates. Maximal degree in co-relation 782999. Up to 73444 conditions per place. 
[2023-10-27 12:27:39,016 INFO  L137   encePairwiseOnDemand]: 179/217 looper letters, 5448 selfloop transitions, 742 changer transitions 97/6288 dead transitions.
[2023-10-27 12:27:39,016 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 6288 transitions, 130825 flow
[2023-10-27 12:27:39,017 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2023-10-27 12:27:39,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2023-10-27 12:27:39,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2577 transitions.
[2023-10-27 12:27:39,020 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3298771121351767
[2023-10-27 12:27:39,020 INFO  L72            ComplementDD]: Start complementDD. Operand 36 states and 2577 transitions.
[2023-10-27 12:27:39,020 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 36 states and 2577 transitions.
[2023-10-27 12:27:39,021 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:27:39,021 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2577 transitions.
[2023-10-27 12:27:39,024 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 37 states, 36 states have (on average 71.58333333333333) internal successors, (2577), 36 states have internal predecessors, (2577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:27:39,032 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 37 states, 37 states have (on average 217.0) internal successors, (8029), 37 states have internal predecessors, (8029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:27:39,033 INFO  L81            ComplementDD]: Finished complementDD. Result  has 37 states, 37 states have (on average 217.0) internal successors, (8029), 37 states have internal predecessors, (8029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:27:39,033 INFO  L175             Difference]: Start difference. First operand has 273 places, 3853 transitions, 78218 flow. Second operand 36 states and 2577 transitions.
[2023-10-27 12:27:39,033 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 6288 transitions, 130825 flow
[2023-10-27 12:29:17,898 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 6288 transitions, 128943 flow, removed 935 selfloop flow, removed 5 redundant places.
[2023-10-27 12:29:18,119 INFO  L231             Difference]: Finished difference. Result has 321 places, 4485 transitions, 91865 flow
[2023-10-27 12:29:18,135 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=76944, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=91865, PETRI_PLACES=321, PETRI_TRANSITIONS=4485}
[2023-10-27 12:29:18,136 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 250 predicate places.
[2023-10-27 12:29:18,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 321 places, 4485 transitions, 91865 flow
[2023-10-27 12:29:18,137 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:29:18,137 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:29:18,137 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:29:18,144 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2023-10-27 12:29:18,342 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:29:18,342 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:29:18,343 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:29:18,343 INFO  L85        PathProgramCache]: Analyzing trace with hash -351514703, now seen corresponding path program 4 times
[2023-10-27 12:29:18,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:29:18,343 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749408970]
[2023-10-27 12:29:18,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:29:18,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:29:18,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:29:19,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:29:19,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:29:19,375 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749408970]
[2023-10-27 12:29:19,375 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749408970] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:29:19,375 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401976958]
[2023-10-27 12:29:19,375 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-27 12:29:19,375 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:29:19,375 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:29:19,376 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:29:19,402 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2023-10-27 12:29:19,666 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-27 12:29:19,666 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:29:19,668 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-10-27 12:29:19,671 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:29:19,684 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:19,686 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:19,688 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2023-10-27 12:29:19,739 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-27 12:29:20,137 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:29:20,137 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2023-10-27 12:29:20,311 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:29:20,312 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-10-27 12:29:20,494 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:29:20,606 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:20,607 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:29:20,683 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:20,684 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:20,686 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:29:20,686 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:29:20,761 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:20,762 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:20,763 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:20,766 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:29:20,766 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:29:20,868 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-10-27 12:29:20,869 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2023-10-27 12:29:20,938 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:20,939 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-10-27 12:29:20,962 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:20,964 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-10-27 12:29:20,987 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:20,987 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-10-27 12:29:21,010 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:29:21,011 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-10-27 12:29:21,085 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:29:21,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:29:21,125 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:29:21,143 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2172 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-10-27 12:29:21,171 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false
[2023-10-27 12:29:21,247 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) .cse0 v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) .cse0 v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) .cse0 v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) .cse0 v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-10-27 12:29:21,482 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) .cse1 v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) .cse1 v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) .cse1 v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) .cse1 v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false
[2023-10-27 12:29:21,711 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:29:21,712 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56
[2023-10-27 12:29:21,717 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:29:21,717 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 232 treesize of output 142
[2023-10-27 12:29:21,722 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 114 treesize of output 106
[2023-10-27 12:29:21,725 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 51
[2023-10-27 12:29:21,770 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:29:21,770 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 42 treesize of output 1
[2023-10-27 12:29:21,775 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:29:21,775 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 42 treesize of output 1
[2023-10-27 12:29:21,792 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:29:21,792 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 42 treesize of output 1
[2023-10-27 12:29:22,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:29:22,055 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401976958] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:29:22,056 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:29:22,056 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35
[2023-10-27 12:29:22,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784654862]
[2023-10-27 12:29:22,056 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:29:22,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2023-10-27 12:29:22,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:29:22,056 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2023-10-27 12:29:22,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=880, Unknown=37, NotChecked=260, Total=1332
[2023-10-27 12:29:22,175 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-10-27 12:29:22,176 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 4485 transitions, 91865 flow. Second operand  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:29:22,176 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:29:22,177 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-10-27 12:29:22,177 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:30:38,329 INFO  L130       PetriNetUnfolder]: 50727/83451 cut-off events.
[2023-10-27 12:30:38,330 INFO  L131       PetriNetUnfolder]: For 2172514/2172514 co-relation queries the response was YES.
[2023-10-27 12:30:39,314 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 837303 conditions, 83451 events. 50727/83451 cut-off events. For 2172514/2172514 co-relation queries the response was YES. Maximal size of possible extension queue 2242. Compared 680582 event pairs, 9428 based on Foata normal form. 27/80097 useless extension candidates. Maximal degree in co-relation 835775. Up to 74366 conditions per place. 
[2023-10-27 12:30:39,792 INFO  L137   encePairwiseOnDemand]: 164/217 looper letters, 5232 selfloop transitions, 1047 changer transitions 97/6377 dead transitions.
[2023-10-27 12:30:39,792 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 6377 transitions, 134458 flow
[2023-10-27 12:30:39,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2023-10-27 12:30:39,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2023-10-27 12:30:39,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 3606 transitions.
[2023-10-27 12:30:39,796 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.33235023041474654
[2023-10-27 12:30:39,796 INFO  L72            ComplementDD]: Start complementDD. Operand 50 states and 3606 transitions.
[2023-10-27 12:30:39,796 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 50 states and 3606 transitions.
[2023-10-27 12:30:39,797 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:30:39,797 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 3606 transitions.
[2023-10-27 12:30:39,800 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 51 states, 50 states have (on average 72.12) internal successors, (3606), 50 states have internal predecessors, (3606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:30:39,822 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 51 states, 51 states have (on average 217.0) internal successors, (11067), 51 states have internal predecessors, (11067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:30:39,838 INFO  L81            ComplementDD]: Finished complementDD. Result  has 51 states, 51 states have (on average 217.0) internal successors, (11067), 51 states have internal predecessors, (11067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:30:39,839 INFO  L175             Difference]: Start difference. First operand has 321 places, 4485 transitions, 91865 flow. Second operand 50 states and 3606 transitions.
[2023-10-27 12:30:39,839 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 6377 transitions, 134458 flow
[2023-10-27 12:33:33,030 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 6377 transitions, 133072 flow, removed 665 selfloop flow, removed 15 redundant places.
[2023-10-27 12:33:33,226 INFO  L231             Difference]: Finished difference. Result has 372 places, 4976 transitions, 104842 flow
[2023-10-27 12:33:33,228 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=90555, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=632, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=104842, PETRI_PLACES=372, PETRI_TRANSITIONS=4976}
[2023-10-27 12:33:33,229 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 301 predicate places.
[2023-10-27 12:33:33,229 INFO  L495      AbstractCegarLoop]: Abstraction has has 372 places, 4976 transitions, 104842 flow
[2023-10-27 12:33:33,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:33:33,230 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:33:33,231 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:33:33,239 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2023-10-27 12:33:33,437 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:33:33,438 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-27 12:33:33,439 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:33:33,439 INFO  L85        PathProgramCache]: Analyzing trace with hash 1518527059, now seen corresponding path program 5 times
[2023-10-27 12:33:33,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:33:33,440 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127737820]
[2023-10-27 12:33:33,440 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:33:33,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:33:33,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:33:34,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:33:34,414 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:33:34,414 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127737820]
[2023-10-27 12:33:34,414 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127737820] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:33:34,414 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887087214]
[2023-10-27 12:33:34,414 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-27 12:33:34,414 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:33:34,414 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:33:34,419 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:33:34,460 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2023-10-27 12:33:34,710 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:33:34,710 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:33:34,712 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 58 conjunts are in the unsatisfiable core
[2023-10-27 12:33:34,714 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:33:34,728 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:34,730 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:34,733 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2023-10-27 12:33:34,800 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-27 12:33:35,222 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:33:35,223 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 62
[2023-10-27 12:33:35,348 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:33:35,348 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-10-27 12:33:35,412 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:33:35,498 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:35,499 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:33:35,596 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:35,598 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:35,600 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:33:35,600 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:33:35,779 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:33:35,780 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 35
[2023-10-27 12:33:35,845 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:35,846 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:35,847 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:35,848 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:33:35,912 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:35,914 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-10-27 12:33:35,940 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:35,941 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-10-27 12:33:35,967 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:35,968 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-10-27 12:33:35,993 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:33:35,994 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-10-27 12:33:36,068 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:33:36,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:33:36,109 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:33:36,130 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2310 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2310) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2310 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2310) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2310 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2310) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2310 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2310) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-27 12:33:36,163 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2310 (Array Int Int)) (v_ArrVal_2309 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2309) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2310) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2310 (Array Int Int)) (v_ArrVal_2309 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2309) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2310) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2310 (Array Int Int)) (v_ArrVal_2309 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2309) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2310) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2310 (Array Int Int)) (v_ArrVal_2309 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2309) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2310) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-27 12:33:37,554 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:33:37,554 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 42 treesize of output 58
[2023-10-27 12:33:37,560 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:33:37,560 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 146 treesize of output 82
[2023-10-27 12:33:37,571 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 36 treesize of output 32
[2023-10-27 12:33:37,574 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 54 treesize of output 46
[2023-10-27 12:33:37,611 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:33:37,611 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 40 treesize of output 1
[2023-10-27 12:33:37,617 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:33:37,617 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 42 treesize of output 1
[2023-10-27 12:33:37,636 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:33:37,636 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 42 treesize of output 1
[2023-10-27 12:33:37,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:33:37,852 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [887087214] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:33:37,852 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:33:37,852 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 34
[2023-10-27 12:33:37,853 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383492341]
[2023-10-27 12:33:37,853 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:33:37,853 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2023-10-27 12:33:37,853 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:33:37,853 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2023-10-27 12:33:37,854 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=922, Unknown=67, NotChecked=130, Total=1260
[2023-10-27 12:33:38,197 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-10-27 12:33:38,198 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 4976 transitions, 104842 flow. Second operand  has 36 states, 36 states have (on average 56.583333333333336) internal successors, (2037), 36 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:33:38,198 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:33:38,199 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-10-27 12:33:38,199 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
