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


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.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 3a3145affc8b47741798715331effced1e2f2146562f74e2adfa90aa8d74930a
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 22:51:10,918 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 22:51:10,919 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 22:51:10,939 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 22:51:10,939 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 22:51:10,940 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 22:51:10,941 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 22:51:10,942 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 22:51:10,943 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 22:51:10,944 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 22:51:10,944 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 22:51:10,945 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 22:51:10,945 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 22:51:10,946 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 22:51:10,947 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 22:51:10,948 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 22:51:10,948 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 22:51:10,949 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 22:51:10,951 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 22:51:10,952 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 22:51:10,953 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 22:51:10,954 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 22:51:10,954 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 22:51:10,955 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 22:51:10,958 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 22:51:10,958 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 22:51:10,958 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 22:51:10,959 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 22:51:10,959 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 22:51:10,960 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 22:51:10,960 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 22:51:10,960 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 22:51:10,961 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 22:51:10,961 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 22:51:10,962 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 22:51:10,962 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 22:51:10,963 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 22:51:10,963 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 22:51:10,963 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 22:51:10,964 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 22:51:10,964 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 22:51:10,965 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 22:51:10,981 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 22:51:10,982 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 22:51:10,982 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 22:51:10,982 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 22:51:10,982 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 22:51:10,983 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 22:51:10,983 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 22:51:10,983 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 22:51:10,983 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 22:51:10,983 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 22:51:10,984 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 22:51:10,984 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 22:51:10,984 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 22:51:10,984 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 22:51:10,984 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 22:51:10,984 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 22:51:10,984 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 22:51:10,984 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 22:51:10,984 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 22:51:10,985 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 22:51:10,985 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 22:51:10,985 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 22:51:10,985 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 22:51:10,985 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 22:51:10,985 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 22:51:10,985 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 22:51:10,985 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:51:10,986 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 22:51:10,986 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 22:51:10,986 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 22:51:10,986 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 22:51:10,986 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 22:51:10,986 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 22:51:10,986 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 22:51:10,986 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 22:51:10,987 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 22:51:10,987 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 22:51:10,987 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 -> 3a3145affc8b47741798715331effced1e2f2146562f74e2adfa90aa8d74930a
[2024-03-11 22:51:11,149 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 22:51:11,167 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 22:51:11,170 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 22:51:11,170 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 22:51:11,171 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 22:51:11,172 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i
[2024-03-11 22:51:12,161 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 22:51:12,392 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 22:51:12,393 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i
[2024-03-11 22:51:12,403 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/4bdfbb7a7/96240d40b8104b958971aca98b6ca0fa/FLAG9fefe6c1a
[2024-03-11 22:51:12,414 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/4bdfbb7a7/96240d40b8104b958971aca98b6ca0fa
[2024-03-11 22:51:12,416 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 22:51:12,417 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 22:51:12,418 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 22:51:12,418 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 22:51:12,421 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 22:51:12,422 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,422 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30256e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12, skipping insertion in model container
[2024-03-11 22:51:12,423 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,428 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 22:51:12,467 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 22:51:12,585 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:51:12,759 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:51:12,764 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 22:51:12,773 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:51:12,793 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:51:12,827 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 22:51:12,827 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12 WrapperNode
[2024-03-11 22:51:12,827 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 22:51:12,828 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 22:51:12,828 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 22:51:12,829 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 22:51:12,834 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,848 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,865 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77
[2024-03-11 22:51:12,865 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 22:51:12,866 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 22:51:12,866 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 22:51:12,866 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 22:51:12,874 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,874 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,877 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,877 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,884 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,886 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,888 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,888 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,890 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 22:51:12,891 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 22:51:12,891 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 22:51:12,891 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 22:51:12,892 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (1/1) ...
[2024-03-11 22:51:12,897 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:51:12,904 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:51:12,916 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)
[2024-03-11 22:51:12,931 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
[2024-03-11 22:51:12,959 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 22:51:12,960 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 22:51:12,960 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 22:51:12,960 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 22:51:12,960 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 22:51:12,960 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 22:51:12,961 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 22:51:12,961 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 22:51:12,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 22:51:12,961 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 22:51:12,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 22:51:12,962 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 22:51:13,100 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 22:51:13,101 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 22:51:13,280 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 22:51:13,289 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 22:51:13,290 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 22:51:13,292 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:51:13 BoogieIcfgContainer
[2024-03-11 22:51:13,292 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 22:51:13,294 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 22:51:13,294 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 22:51:13,296 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 22:51:13,296 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 10:51:12" (1/3) ...
[2024-03-11 22:51:13,297 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6d4c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:51:13, skipping insertion in model container
[2024-03-11 22:51:13,297 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:51:12" (2/3) ...
[2024-03-11 22:51:13,297 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6d4c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:51:13, skipping insertion in model container
[2024-03-11 22:51:13,297 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:51:13" (3/3) ...
[2024-03-11 22:51:13,298 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct.i
[2024-03-11 22:51:13,304 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 22:51:13,311 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 22:51:13,311 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-11 22:51:13,311 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 22:51:13,351 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 22:51:13,378 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2024-03-11 22:51:13,421 INFO  L130       PetriNetUnfolder]: 6/152 cut-off events.
[2024-03-11 22:51:13,421 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:51:13,425 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 293 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2024-03-11 22:51:13,425 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 214 flow
[2024-03-11 22:51:13,429 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 214 flow
[2024-03-11 22:51:13,431 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:51:13,438 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 103 transitions, 214 flow
[2024-03-11 22:51:13,440 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 103 transitions, 214 flow
[2024-03-11 22:51:13,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2024-03-11 22:51:13,466 INFO  L130       PetriNetUnfolder]: 6/152 cut-off events.
[2024-03-11 22:51:13,466 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:51:13,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 293 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2024-03-11 22:51:13,468 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1792
[2024-03-11 22:51:15,174 INFO  L134        LiptonReduction]: Checked pairs total: 9441
[2024-03-11 22:51:15,174 INFO  L136        LiptonReduction]: Total number of compositions: 65
[2024-03-11 22:51:15,186 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:51:15,191 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;@1b36dea5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:51:15,191 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-11 22:51:15,194 INFO  L130       PetriNetUnfolder]: 0/18 cut-off events.
[2024-03-11 22:51:15,194 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:51:15,195 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:15,195 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:51:15,196 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:51:15,199 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:15,199 INFO  L85        PathProgramCache]: Analyzing trace with hash -1574933325, now seen corresponding path program 1 times
[2024-03-11 22:51:15,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:15,206 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329179265]
[2024-03-11 22:51:15,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:15,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:15,290 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:15,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:15,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:15,406 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329179265]
[2024-03-11 22:51:15,407 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329179265] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:51:15,407 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:51:15,407 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:51:15,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393294572]
[2024-03-11 22:51:15,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:51:15,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:51:15,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:15,429 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:51:15,431 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:51:15,488 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 168
[2024-03-11 22:51:15,491 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:15,491 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:15,491 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 168
[2024-03-11 22:51:15,492 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:51:15,588 INFO  L130       PetriNetUnfolder]: 28/257 cut-off events.
[2024-03-11 22:51:15,588 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2024-03-11 22:51:15,589 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 348 conditions, 257 events. 28/257 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1224 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 273. Up to 70 conditions per place. 
[2024-03-11 22:51:15,590 INFO  L137   encePairwiseOnDemand]: 164/168 looper letters, 19 selfloop transitions, 3 changer transitions 2/56 dead transitions.
[2024-03-11 22:51:15,590 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 168 flow
[2024-03-11 22:51:15,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:51:15,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:51:15,600 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions.
[2024-03-11 22:51:15,603 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5848214285714286
[2024-03-11 22:51:15,603 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 393 transitions.
[2024-03-11 22:51:15,604 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions.
[2024-03-11 22:51:15,605 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:51:15,607 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions.
[2024-03-11 22:51:15,611 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:15,617 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:15,617 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:15,618 INFO  L175             Difference]: Start difference. First operand has 49 places, 47 transitions, 102 flow. Second operand 4 states and 393 transitions.
[2024-03-11 22:51:15,619 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 168 flow
[2024-03-11 22:51:15,621 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:51:15,623 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 118 flow
[2024-03-11 22:51:15,624 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2024-03-11 22:51:15,628 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places.
[2024-03-11 22:51:15,628 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 118 flow
[2024-03-11 22:51:15,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:15,628 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:15,628 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:51:15,629 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 22:51:15,629 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:51:15,629 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:15,630 INFO  L85        PathProgramCache]: Analyzing trace with hash -1073714049, now seen corresponding path program 1 times
[2024-03-11 22:51:15,630 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:15,630 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108807949]
[2024-03-11 22:51:15,630 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:15,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:15,647 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:15,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:15,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:15,856 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108807949]
[2024-03-11 22:51:15,856 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108807949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:51:15,856 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:51:15,856 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:51:15,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396857102]
[2024-03-11 22:51:15,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:51:15,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:51:15,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:15,858 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:51:15,858 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:51:16,026 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 168
[2024-03-11 22:51:16,027 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 118 flow. Second operand  has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:16,027 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:16,027 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 168
[2024-03-11 22:51:16,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:51:16,238 INFO  L130       PetriNetUnfolder]: 239/686 cut-off events.
[2024-03-11 22:51:16,238 INFO  L131       PetriNetUnfolder]: For 33/39 co-relation queries the response was YES.
[2024-03-11 22:51:16,240 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 686 events. 239/686 cut-off events. For 33/39 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3805 event pairs, 45 based on Foata normal form. 1/660 useless extension candidates. Maximal degree in co-relation 1226. Up to 335 conditions per place. 
[2024-03-11 22:51:16,242 INFO  L137   encePairwiseOnDemand]: 145/168 looper letters, 62 selfloop transitions, 29 changer transitions 1/103 dead transitions.
[2024-03-11 22:51:16,242 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 103 transitions, 422 flow
[2024-03-11 22:51:16,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:51:16,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:51:16,245 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions.
[2024-03-11 22:51:16,246 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5277777777777778
[2024-03-11 22:51:16,246 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 532 transitions.
[2024-03-11 22:51:16,246 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 532 transitions.
[2024-03-11 22:51:16,246 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:51:16,246 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 532 transitions.
[2024-03-11 22:51:16,248 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:16,251 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:16,251 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:16,251 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 118 flow. Second operand 6 states and 532 transitions.
[2024-03-11 22:51:16,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 103 transitions, 422 flow
[2024-03-11 22:51:16,253 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 103 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:51:16,254 INFO  L231             Difference]: Finished difference. Result has 63 places, 76 transitions, 330 flow
[2024-03-11 22:51:16,255 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=63, PETRI_TRANSITIONS=76}
[2024-03-11 22:51:16,255 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places.
[2024-03-11 22:51:16,255 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 76 transitions, 330 flow
[2024-03-11 22:51:16,256 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:16,256 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:16,256 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:51:16,256 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 22:51:16,257 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:51:16,257 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:16,257 INFO  L85        PathProgramCache]: Analyzing trace with hash -794810958, now seen corresponding path program 1 times
[2024-03-11 22:51:16,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:16,258 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482707190]
[2024-03-11 22:51:16,258 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:16,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:16,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:16,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:16,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:16,462 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482707190]
[2024-03-11 22:51:16,463 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482707190] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:51:16,463 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:51:16,463 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:51:16,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410367540]
[2024-03-11 22:51:16,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:51:16,464 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:51:16,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:16,464 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:51:16,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:51:16,553 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 168
[2024-03-11 22:51:16,554 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 76 transitions, 330 flow. Second operand  has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:16,554 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:16,554 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 168
[2024-03-11 22:51:16,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:51:16,861 INFO  L130       PetriNetUnfolder]: 391/1018 cut-off events.
[2024-03-11 22:51:16,861 INFO  L131       PetriNetUnfolder]: For 426/432 co-relation queries the response was YES.
[2024-03-11 22:51:16,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2758 conditions, 1018 events. 391/1018 cut-off events. For 426/432 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6136 event pairs, 58 based on Foata normal form. 0/960 useless extension candidates. Maximal degree in co-relation 2598. Up to 640 conditions per place. 
[2024-03-11 22:51:16,867 INFO  L137   encePairwiseOnDemand]: 145/168 looper letters, 78 selfloop transitions, 82 changer transitions 14/189 dead transitions.
[2024-03-11 22:51:16,867 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 189 transitions, 1126 flow
[2024-03-11 22:51:16,868 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:51:16,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:51:16,869 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions.
[2024-03-11 22:51:16,869 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.566468253968254
[2024-03-11 22:51:16,869 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 571 transitions.
[2024-03-11 22:51:16,870 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 571 transitions.
[2024-03-11 22:51:16,870 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:51:16,870 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 571 transitions.
[2024-03-11 22:51:16,871 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:16,873 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:16,874 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:16,874 INFO  L175             Difference]: Start difference. First operand has 63 places, 76 transitions, 330 flow. Second operand 6 states and 571 transitions.
[2024-03-11 22:51:16,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 189 transitions, 1126 flow
[2024-03-11 22:51:16,879 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 189 transitions, 1110 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-03-11 22:51:16,881 INFO  L231             Difference]: Finished difference. Result has 70 places, 155 transitions, 1046 flow
[2024-03-11 22:51:16,881 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1046, PETRI_PLACES=70, PETRI_TRANSITIONS=155}
[2024-03-11 22:51:16,882 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places.
[2024-03-11 22:51:16,882 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 155 transitions, 1046 flow
[2024-03-11 22:51:16,882 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:16,883 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:16,883 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-11 22:51:16,883 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 22:51:16,883 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:51:16,883 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:16,884 INFO  L85        PathProgramCache]: Analyzing trace with hash 1855667267, now seen corresponding path program 1 times
[2024-03-11 22:51:16,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:16,884 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308657240]
[2024-03-11 22:51:16,884 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:16,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:16,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:51:16,908 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:51:16,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:51:16,936 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:51:16,936 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:51:16,937 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-11 22:51:16,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-11 22:51:16,939 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-11 22:51:16,939 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-11 22:51:16,939 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-11 22:51:16,939 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-11 22:51:16,939 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-11 22:51:16,940 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 22:51:16,940 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-11 22:51:16,942 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:51:16,942 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 22:51:16,956 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 22:51:16,959 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 260 flow
[2024-03-11 22:51:16,980 INFO  L130       PetriNetUnfolder]: 11/269 cut-off events.
[2024-03-11 22:51:16,981 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:51:16,981 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 269 events. 11/269 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 596 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2024-03-11 22:51:16,981 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 260 flow
[2024-03-11 22:51:16,982 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 121 transitions, 260 flow
[2024-03-11 22:51:16,983 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:51:16,983 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 121 transitions, 260 flow
[2024-03-11 22:51:16,983 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 121 transitions, 260 flow
[2024-03-11 22:51:16,983 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 260 flow
[2024-03-11 22:51:17,003 INFO  L130       PetriNetUnfolder]: 11/269 cut-off events.
[2024-03-11 22:51:17,004 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:51:17,004 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 269 events. 11/269 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 596 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2024-03-11 22:51:17,007 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4512
[2024-03-11 22:51:18,389 INFO  L134        LiptonReduction]: Checked pairs total: 20830
[2024-03-11 22:51:18,389 INFO  L136        LiptonReduction]: Total number of compositions: 70
[2024-03-11 22:51:18,391 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:51:18,392 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;@1b36dea5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:51:18,392 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-11 22:51:18,393 INFO  L130       PetriNetUnfolder]: 0/18 cut-off events.
[2024-03-11 22:51:18,394 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:51:18,394 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:18,394 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:51:18,394 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:51:18,394 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:18,395 INFO  L85        PathProgramCache]: Analyzing trace with hash -1618615842, now seen corresponding path program 1 times
[2024-03-11 22:51:18,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:18,395 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596238393]
[2024-03-11 22:51:18,395 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:18,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:18,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:18,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:18,438 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:18,438 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596238393]
[2024-03-11 22:51:18,439 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596238393] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:51:18,439 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:51:18,439 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:51:18,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230407848]
[2024-03-11 22:51:18,439 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:51:18,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:51:18,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:18,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:51:18,440 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:51:18,491 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 191
[2024-03-11 22:51:18,492 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 136 flow. Second operand  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:18,492 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:18,492 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 191
[2024-03-11 22:51:18,492 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:51:18,625 INFO  L130       PetriNetUnfolder]: 319/975 cut-off events.
[2024-03-11 22:51:18,626 INFO  L131       PetriNetUnfolder]: For 75/111 co-relation queries the response was YES.
[2024-03-11 22:51:18,627 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1592 conditions, 975 events. 319/975 cut-off events. For 75/111 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5963 event pairs, 258 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 650. Up to 572 conditions per place. 
[2024-03-11 22:51:18,629 INFO  L137   encePairwiseOnDemand]: 187/191 looper letters, 26 selfloop transitions, 3 changer transitions 2/69 dead transitions.
[2024-03-11 22:51:18,629 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 218 flow
[2024-03-11 22:51:18,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:51:18,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:51:18,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions.
[2024-03-11 22:51:18,632 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6073298429319371
[2024-03-11 22:51:18,632 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 464 transitions.
[2024-03-11 22:51:18,632 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions.
[2024-03-11 22:51:18,632 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:51:18,633 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions.
[2024-03-11 22:51:18,633 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:18,635 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:18,635 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:18,635 INFO  L175             Difference]: Start difference. First operand has 62 places, 59 transitions, 136 flow. Second operand 4 states and 464 transitions.
[2024-03-11 22:51:18,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 218 flow
[2024-03-11 22:51:18,636 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:51:18,637 INFO  L231             Difference]: Finished difference. Result has 67 places, 61 transitions, 156 flow
[2024-03-11 22:51:18,637 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=67, PETRI_TRANSITIONS=61}
[2024-03-11 22:51:18,638 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places.
[2024-03-11 22:51:18,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 156 flow
[2024-03-11 22:51:18,638 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:18,638 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:18,639 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:51:18,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 22:51:18,639 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:51:18,639 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:18,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -1060138264, now seen corresponding path program 1 times
[2024-03-11 22:51:18,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:18,640 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053699206]
[2024-03-11 22:51:18,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:18,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:18,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:18,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:18,767 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:18,767 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053699206]
[2024-03-11 22:51:18,767 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053699206] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:51:18,767 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:51:18,768 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:51:18,768 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793587248]
[2024-03-11 22:51:18,768 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:51:18,768 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:51:18,768 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:18,769 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:51:18,769 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:51:18,898 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 191
[2024-03-11 22:51:18,899 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 156 flow. Second operand  has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:18,899 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:18,899 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 191
[2024-03-11 22:51:18,899 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:51:19,750 INFO  L130       PetriNetUnfolder]: 5476/10051 cut-off events.
[2024-03-11 22:51:19,751 INFO  L131       PetriNetUnfolder]: For 437/457 co-relation queries the response was YES.
[2024-03-11 22:51:19,758 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19612 conditions, 10051 events. 5476/10051 cut-off events. For 437/457 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 70102 event pairs, 1407 based on Foata normal form. 2/9766 useless extension candidates. Maximal degree in co-relation 19515. Up to 6033 conditions per place. 
[2024-03-11 22:51:19,790 INFO  L137   encePairwiseOnDemand]: 164/191 looper letters, 92 selfloop transitions, 48 changer transitions 1/154 dead transitions.
[2024-03-11 22:51:19,790 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 154 transitions, 644 flow
[2024-03-11 22:51:19,791 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:51:19,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:51:19,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2024-03-11 22:51:19,792 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5680628272251309
[2024-03-11 22:51:19,793 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2024-03-11 22:51:19,793 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2024-03-11 22:51:19,793 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:51:19,793 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2024-03-11 22:51:19,794 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:19,796 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:19,796 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:19,796 INFO  L175             Difference]: Start difference. First operand has 67 places, 61 transitions, 156 flow. Second operand 6 states and 651 transitions.
[2024-03-11 22:51:19,797 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 154 transitions, 644 flow
[2024-03-11 22:51:19,798 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 154 transitions, 641 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:51:19,800 INFO  L231             Difference]: Finished difference. Result has 76 places, 108 transitions, 490 flow
[2024-03-11 22:51:19,800 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=76, PETRI_TRANSITIONS=108}
[2024-03-11 22:51:19,801 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places.
[2024-03-11 22:51:19,801 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 108 transitions, 490 flow
[2024-03-11 22:51:19,801 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:19,801 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:19,801 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:51:19,802 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 22:51:19,802 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:51:19,802 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:19,802 INFO  L85        PathProgramCache]: Analyzing trace with hash -1448821040, now seen corresponding path program 1 times
[2024-03-11 22:51:19,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:19,803 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9655690]
[2024-03-11 22:51:19,803 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:19,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:19,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:20,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:20,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:20,011 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9655690]
[2024-03-11 22:51:20,011 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9655690] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:51:20,012 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:51:20,012 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:51:20,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561228600]
[2024-03-11 22:51:20,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:51:20,012 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:51:20,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:20,013 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:51:20,013 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:51:20,102 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 191
[2024-03-11 22:51:20,102 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 108 transitions, 490 flow. Second operand  has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:20,103 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:20,103 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 191
[2024-03-11 22:51:20,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:51:21,583 INFO  L130       PetriNetUnfolder]: 9320/16178 cut-off events.
[2024-03-11 22:51:21,584 INFO  L131       PetriNetUnfolder]: For 8208/8322 co-relation queries the response was YES.
[2024-03-11 22:51:21,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44381 conditions, 16178 events. 9320/16178 cut-off events. For 8208/8322 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 114641 event pairs, 2813 based on Foata normal form. 0/15540 useless extension candidates. Maximal degree in co-relation 26087. Up to 11753 conditions per place. 
[2024-03-11 22:51:21,652 INFO  L137   encePairwiseOnDemand]: 164/191 looper letters, 150 selfloop transitions, 142 changer transitions 0/309 dead transitions.
[2024-03-11 22:51:21,652 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 309 transitions, 1906 flow
[2024-03-11 22:51:21,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:51:21,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:51:21,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions.
[2024-03-11 22:51:21,655 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6082024432809773
[2024-03-11 22:51:21,655 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 697 transitions.
[2024-03-11 22:51:21,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions.
[2024-03-11 22:51:21,655 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:51:21,655 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions.
[2024-03-11 22:51:21,657 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:21,658 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:21,658 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:21,659 INFO  L175             Difference]: Start difference. First operand has 76 places, 108 transitions, 490 flow. Second operand 6 states and 697 transitions.
[2024-03-11 22:51:21,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 309 transitions, 1906 flow
[2024-03-11 22:51:21,673 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 309 transitions, 1896 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-03-11 22:51:21,676 INFO  L231             Difference]: Finished difference. Result has 84 places, 245 transitions, 1786 flow
[2024-03-11 22:51:21,676 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1786, PETRI_PLACES=84, PETRI_TRANSITIONS=245}
[2024-03-11 22:51:21,677 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places.
[2024-03-11 22:51:21,677 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 245 transitions, 1786 flow
[2024-03-11 22:51:21,677 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:21,677 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:21,677 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:51:21,678 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 22:51:21,678 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:51:21,678 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:21,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -1373510541, now seen corresponding path program 1 times
[2024-03-11 22:51:21,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:21,679 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375149774]
[2024-03-11 22:51:21,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:21,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:21,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:21,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:21,975 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:21,975 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375149774]
[2024-03-11 22:51:21,975 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375149774] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:51:21,975 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965393819]
[2024-03-11 22:51:21,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:21,976 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:51:21,976 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:51:21,977 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)
[2024-03-11 22:51:21,988 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
[2024-03-11 22:51:22,116 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:22,119 INFO  L263         TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjunts are in the unsatisfiable core
[2024-03-11 22:51:22,123 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:51:22,234 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
[2024-03-11 22:51:22,263 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
[2024-03-11 22:51:22,298 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:51:22,299 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
[2024-03-11 22:51:22,341 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:51:22,341 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
[2024-03-11 22:51:22,385 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:51:22,386 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
[2024-03-11 22:51:22,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:22,395 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:51:22,422 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:51:22,444 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:51:22,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:51:22,567 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [965393819] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:51:22,567 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:51:22,567 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22
[2024-03-11 22:51:22,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958038355]
[2024-03-11 22:51:22,568 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:51:22,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-11 22:51:22,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:22,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-11 22:51:22,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=379, Unknown=2, NotChecked=82, Total=552
[2024-03-11 22:51:22,682 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2024-03-11 22:51:22,684 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 245 transitions, 1786 flow. Second operand  has 24 states, 24 states have (on average 59.208333333333336) internal successors, (1421), 24 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:22,684 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:22,684 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2024-03-11 22:51:22,684 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:51:27,565 INFO  L130       PetriNetUnfolder]: 15833/26110 cut-off events.
[2024-03-11 22:51:27,566 INFO  L131       PetriNetUnfolder]: For 33789/33805 co-relation queries the response was YES.
[2024-03-11 22:51:27,618 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94974 conditions, 26110 events. 15833/26110 cut-off events. For 33789/33805 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 183295 event pairs, 2450 based on Foata normal form. 620/25264 useless extension candidates. Maximal degree in co-relation 79178. Up to 10911 conditions per place. 
[2024-03-11 22:51:27,729 INFO  L137   encePairwiseOnDemand]: 140/191 looper letters, 792 selfloop transitions, 443 changer transitions 21/1261 dead transitions.
[2024-03-11 22:51:27,729 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 1261 transitions, 10357 flow
[2024-03-11 22:51:27,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-11 22:51:27,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-11 22:51:27,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1725 transitions.
[2024-03-11 22:51:27,734 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.47533755855607607
[2024-03-11 22:51:27,734 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1725 transitions.
[2024-03-11 22:51:27,734 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1725 transitions.
[2024-03-11 22:51:27,735 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:51:27,735 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1725 transitions.
[2024-03-11 22:51:27,738 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 90.78947368421052) internal successors, (1725), 19 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:27,742 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 191.0) internal successors, (3820), 20 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:27,743 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 191.0) internal successors, (3820), 20 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:27,743 INFO  L175             Difference]: Start difference. First operand has 84 places, 245 transitions, 1786 flow. Second operand 19 states and 1725 transitions.
[2024-03-11 22:51:27,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 1261 transitions, 10357 flow
[2024-03-11 22:51:28,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 1261 transitions, 10231 flow, removed 63 selfloop flow, removed 0 redundant places.
[2024-03-11 22:51:28,233 INFO  L231             Difference]: Finished difference. Result has 115 places, 679 transitions, 6483 flow
[2024-03-11 22:51:28,234 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=1732, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6483, PETRI_PLACES=115, PETRI_TRANSITIONS=679}
[2024-03-11 22:51:28,234 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 53 predicate places.
[2024-03-11 22:51:28,234 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 679 transitions, 6483 flow
[2024-03-11 22:51:28,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 59.208333333333336) internal successors, (1421), 24 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:28,235 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:28,235 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:51:28,246 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
[2024-03-11 22:51:28,442 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:51:28,442 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:51:28,443 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:28,444 INFO  L85        PathProgramCache]: Analyzing trace with hash -530253769, now seen corresponding path program 1 times
[2024-03-11 22:51:28,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:28,444 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909916240]
[2024-03-11 22:51:28,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:28,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:28,469 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:28,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:28,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:28,726 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909916240]
[2024-03-11 22:51:28,726 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909916240] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:51:28,726 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931719056]
[2024-03-11 22:51:28,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:28,727 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:51:28,727 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:51:28,728 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)
[2024-03-11 22:51:28,730 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
[2024-03-11 22:51:28,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:28,834 INFO  L263         TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 37 conjunts are in the unsatisfiable core
[2024-03-11 22:51:28,836 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:51:28,855 INFO  L321             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2024-03-11 22:51:28,855 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 13 treesize of output 15
[2024-03-11 22:51:28,889 INFO  L321             Elim1Store]: treesize reduction 20, result has 39.4 percent of original size
[2024-03-11 22:51:28,889 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22
[2024-03-11 22:51:28,917 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-03-11 22:51:29,024 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
[2024-03-11 22:51:29,052 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:51:29,053 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
[2024-03-11 22:51:29,094 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:51:29,095 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:51:29,097 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
[2024-03-11 22:51:29,140 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:51:29,141 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:51:29,142 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:51:29,143 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
[2024-03-11 22:51:29,191 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
[2024-03-11 22:51:29,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:29,225 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:51:29,244 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2024-03-11 22:51:29,279 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2024-03-11 22:51:29,308 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-03-11 22:51:29,330 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_336) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-03-11 22:51:29,352 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:51:29,353 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
[2024-03-11 22:51:29,359 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:51:29,359 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
[2024-03-11 22:51:29,364 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
[2024-03-11 22:51:29,374 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:51:29,374 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
[2024-03-11 22:51:29,382 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:51:29,382 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
[2024-03-11 22:51:29,388 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:51:29,389 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
[2024-03-11 22:51:29,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-11 22:51:29,432 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [931719056] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:51:29,433 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:51:29,433 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2024-03-11 22:51:29,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326746008]
[2024-03-11 22:51:29,433 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:51:29,434 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:51:29,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:29,435 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:51:29,435 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=381, Unknown=4, NotChecked=172, Total=650
[2024-03-11 22:51:29,438 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2024-03-11 22:51:29,440 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 679 transitions, 6483 flow. Second operand  has 26 states, 26 states have (on average 58.80769230769231) internal successors, (1529), 26 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:29,440 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:29,440 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2024-03-11 22:51:29,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:51:36,543 INFO  L130       PetriNetUnfolder]: 20491/33565 cut-off events.
[2024-03-11 22:51:36,543 INFO  L131       PetriNetUnfolder]: For 117033/117049 co-relation queries the response was YES.
[2024-03-11 22:51:36,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 176827 conditions, 33565 events. 20491/33565 cut-off events. For 117033/117049 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 243316 event pairs, 1312 based on Foata normal form. 532/32154 useless extension candidates. Maximal degree in co-relation 171464. Up to 11529 conditions per place. 
[2024-03-11 22:51:36,798 INFO  L137   encePairwiseOnDemand]: 161/191 looper letters, 1132 selfloop transitions, 644 changer transitions 28/1808 dead transitions.
[2024-03-11 22:51:36,798 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 1808 transitions, 19862 flow
[2024-03-11 22:51:36,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-11 22:51:36,799 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-11 22:51:36,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1581 transitions.
[2024-03-11 22:51:36,803 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.41387434554973823
[2024-03-11 22:51:36,803 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1581 transitions.
[2024-03-11 22:51:36,803 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1581 transitions.
[2024-03-11 22:51:36,804 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:51:36,804 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1581 transitions.
[2024-03-11 22:51:36,806 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 79.05) internal successors, (1581), 20 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:36,810 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 191.0) internal successors, (4011), 21 states have internal predecessors, (4011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:36,811 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 191.0) internal successors, (4011), 21 states have internal predecessors, (4011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:36,811 INFO  L175             Difference]: Start difference. First operand has 115 places, 679 transitions, 6483 flow. Second operand 20 states and 1581 transitions.
[2024-03-11 22:51:36,811 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 1808 transitions, 19862 flow
[2024-03-11 22:51:40,318 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 1808 transitions, 19531 flow, removed 163 selfloop flow, removed 1 redundant places.
[2024-03-11 22:51:40,336 INFO  L231             Difference]: Finished difference. Result has 147 places, 1128 transitions, 13403 flow
[2024-03-11 22:51:40,336 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=6363, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=13403, PETRI_PLACES=147, PETRI_TRANSITIONS=1128}
[2024-03-11 22:51:40,337 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 85 predicate places.
[2024-03-11 22:51:40,337 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 1128 transitions, 13403 flow
[2024-03-11 22:51:40,338 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 58.80769230769231) internal successors, (1529), 26 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:40,338 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:40,338 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]
[2024-03-11 22:51:40,343 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-11 22:51:40,542 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:51:40,544 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:51:40,544 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:40,545 INFO  L85        PathProgramCache]: Analyzing trace with hash -1995259391, now seen corresponding path program 1 times
[2024-03-11 22:51:40,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:40,545 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131006121]
[2024-03-11 22:51:40,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:40,546 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:40,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:40,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:51:40,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:40,723 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131006121]
[2024-03-11 22:51:40,723 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131006121] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:51:40,723 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:51:40,723 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:51:40,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648756754]
[2024-03-11 22:51:40,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:51:40,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:51:40,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:40,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:51:40,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:51:40,957 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 191
[2024-03-11 22:51:40,957 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 1128 transitions, 13403 flow. Second operand  has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:40,957 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:40,958 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 191
[2024-03-11 22:51:40,958 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:51:45,467 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L1030-5-->L1030-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][1076], [Black: 126#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 86#L1030-6true, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 514#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 326#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 133#true, Black: 314#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 316#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 302#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1)), Black: 157#true, Black: 312#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 320#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 167#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 147#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), 138#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 310#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 318#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_246 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_246 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 148#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 330#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 149#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 333#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 150#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 504#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 533#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 522#(and (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 536#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 516#(and (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 525#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 500#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= |ULTIMATE.start_main_~t~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 506#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 518#(and (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 557#true, 328#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 527#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 539#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 520#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), 4#threadEXITtrue, threadThread1of2ForFork0InUse, 76#L1017-5true, threadThread2of2ForFork0InUse])
[2024-03-11 22:51:45,468 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is not cut-off event
[2024-03-11 22:51:45,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is not cut-off event
[2024-03-11 22:51:45,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is not cut-off event
[2024-03-11 22:51:45,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is not cut-off event
[2024-03-11 22:51:45,479 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L1032-4-->L1032-5: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][1080], [Black: 126#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 514#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, Black: 326#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 314#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 316#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 302#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1)), Black: 157#true, Black: 312#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 320#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 138#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 147#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 310#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 318#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_246 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_246 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 148#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 330#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 149#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 333#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 150#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 504#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 533#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 522#(and (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 536#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 516#(and (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 525#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 500#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= |ULTIMATE.start_main_~t~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 506#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 518#(and (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 557#true, 328#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ |ULTIMATE.start_main_~t~1#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 527#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (not (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 539#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= threadThread1of2ForFork0_~t~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 520#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= |threadThread1of2ForFork0_#in~arg.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_~t~1#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), 52#L1032-5true, 4#threadEXITtrue, threadThread1of2ForFork0InUse, 76#L1017-5true, threadThread2of2ForFork0InUse])
[2024-03-11 22:51:45,480 INFO  L383   tUnfolder$Statistics]: this new event has 40 ancestors and is not cut-off event
[2024-03-11 22:51:45,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is not cut-off event
[2024-03-11 22:51:45,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is not cut-off event
[2024-03-11 22:51:45,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 40 ancestors and is not cut-off event
[2024-03-11 22:51:47,494 INFO  L130       PetriNetUnfolder]: 18302/31317 cut-off events.
[2024-03-11 22:51:47,494 INFO  L131       PetriNetUnfolder]: For 179353/181833 co-relation queries the response was YES.
[2024-03-11 22:51:47,626 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181250 conditions, 31317 events. 18302/31317 cut-off events. For 179353/181833 co-relation queries the response was YES. Maximal size of possible extension queue 1137. Compared 240683 event pairs, 3015 based on Foata normal form. 168/30387 useless extension candidates. Maximal degree in co-relation 175239. Up to 20273 conditions per place. 
[2024-03-11 22:51:47,748 INFO  L137   encePairwiseOnDemand]: 176/191 looper letters, 770 selfloop transitions, 217 changer transitions 17/1399 dead transitions.
[2024-03-11 22:51:47,748 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1399 transitions, 18479 flow
[2024-03-11 22:51:47,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:51:47,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:51:47,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions.
[2024-03-11 22:51:47,750 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5837696335078534
[2024-03-11 22:51:47,751 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 669 transitions.
[2024-03-11 22:51:47,751 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions.
[2024-03-11 22:51:47,751 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:51:47,751 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions.
[2024-03-11 22:51:47,752 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:47,754 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:47,754 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:47,754 INFO  L175             Difference]: Start difference. First operand has 147 places, 1128 transitions, 13403 flow. Second operand 6 states and 669 transitions.
[2024-03-11 22:51:47,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 1399 transitions, 18479 flow
[2024-03-11 22:51:50,742 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 1399 transitions, 18457 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-11 22:51:50,758 INFO  L231             Difference]: Finished difference. Result has 154 places, 1319 transitions, 16809 flow
[2024-03-11 22:51:50,759 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=13381, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1028, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=16809, PETRI_PLACES=154, PETRI_TRANSITIONS=1319}
[2024-03-11 22:51:50,760 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 92 predicate places.
[2024-03-11 22:51:50,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 1319 transitions, 16809 flow
[2024-03-11 22:51:50,760 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:50,760 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:50,760 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:51:50,760 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-11 22:51:50,761 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:51:50,761 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:50,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -78901630, now seen corresponding path program 1 times
[2024-03-11 22:51:50,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:50,761 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193331088]
[2024-03-11 22:51:50,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:50,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:50,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:50,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-03-11 22:51:50,938 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:50,938 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193331088]
[2024-03-11 22:51:50,938 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193331088] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:51:50,939 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:51:50,939 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:51:50,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414748144]
[2024-03-11 22:51:50,939 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:51:50,939 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:51:50,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:50,940 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:51:50,940 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:51:51,053 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 191
[2024-03-11 22:51:51,054 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 1319 transitions, 16809 flow. Second operand  has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:51,054 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:51,054 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 191
[2024-03-11 22:51:51,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:52:00,877 INFO  L130       PetriNetUnfolder]: 23549/39596 cut-off events.
[2024-03-11 22:52:00,878 INFO  L131       PetriNetUnfolder]: For 248894/250837 co-relation queries the response was YES.
[2024-03-11 22:52:01,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 245955 conditions, 39596 events. 23549/39596 cut-off events. For 248894/250837 co-relation queries the response was YES. Maximal size of possible extension queue 1351. Compared 307332 event pairs, 3138 based on Foata normal form. 129/37701 useless extension candidates. Maximal degree in co-relation 238316. Up to 30188 conditions per place. 
[2024-03-11 22:52:01,258 INFO  L137   encePairwiseOnDemand]: 164/191 looper letters, 1266 selfloop transitions, 566 changer transitions 68/1969 dead transitions.
[2024-03-11 22:52:01,259 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 1969 transitions, 28140 flow
[2024-03-11 22:52:01,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:52:01,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:52:01,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions.
[2024-03-11 22:52:01,261 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6047120418848168
[2024-03-11 22:52:01,261 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 693 transitions.
[2024-03-11 22:52:01,261 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 693 transitions.
[2024-03-11 22:52:01,262 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:52:01,262 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 693 transitions.
[2024-03-11 22:52:01,263 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:52:01,264 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:52:01,265 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:52:01,265 INFO  L175             Difference]: Start difference. First operand has 154 places, 1319 transitions, 16809 flow. Second operand 6 states and 693 transitions.
[2024-03-11 22:52:01,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 1969 transitions, 28140 flow
[2024-03-11 22:52:06,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1969 transitions, 27924 flow, removed 108 selfloop flow, removed 0 redundant places.
[2024-03-11 22:52:06,678 INFO  L231             Difference]: Finished difference. Result has 164 places, 1793 transitions, 25517 flow
[2024-03-11 22:52:06,679 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=16701, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=906, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=25517, PETRI_PLACES=164, PETRI_TRANSITIONS=1793}
[2024-03-11 22:52:06,680 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 102 predicate places.
[2024-03-11 22:52:06,680 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 1793 transitions, 25517 flow
[2024-03-11 22:52:06,680 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:52:06,680 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:52:06,680 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]
[2024-03-11 22:52:06,681 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-11 22:52:06,681 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:52:06,681 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:52:06,681 INFO  L85        PathProgramCache]: Analyzing trace with hash 983773192, now seen corresponding path program 1 times
[2024-03-11 22:52:06,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:52:06,681 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015938783]
[2024-03-11 22:52:06,682 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:52:06,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:52:06,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:52:07,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:52:07,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:52:07,074 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015938783]
[2024-03-11 22:52:07,074 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015938783] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:52:07,074 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274229178]
[2024-03-11 22:52:07,074 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:52:07,074 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:52:07,075 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:52:07,076 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)
[2024-03-11 22:52:07,078 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
[2024-03-11 22:52:07,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:52:07,169 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-11 22:52:07,173 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:52:07,181 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:52:07,182 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15
[2024-03-11 22:52:07,216 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-11 22:52:07,216 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-11 22:52:07,329 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:52:07,330 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-03-11 22:52:07,389 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:52:07,390 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 22:52:07,430 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
[2024-03-11 22:52:07,450 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:52:07,468 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
[2024-03-11 22:52:07,482 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:52:07,482 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
[2024-03-11 22:52:07,496 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:52:07,496 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
[2024-03-11 22:52:07,523 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
[2024-03-11 22:52:07,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:52:07,536 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:52:07,556 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_527 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_527 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_527 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_527 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:52:07,585 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_527 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_527 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_527 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_527 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:52:07,607 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_527 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_527 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_527 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_527 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_527) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:52:07,677 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-11 22:52:07,778 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_517) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-03-11 22:52:07,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:52:07,832 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274229178] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:52:07,832 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:52:07,832 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 25
[2024-03-11 22:52:07,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855458271]
[2024-03-11 22:52:07,833 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:52:07,833 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-03-11 22:52:07,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:52:07,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-03-11 22:52:07,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=390, Unknown=10, NotChecked=220, Total=702
[2024-03-11 22:52:07,999 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 191
[2024-03-11 22:52:08,001 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 1793 transitions, 25517 flow. Second operand  has 27 states, 27 states have (on average 54.111111111111114) internal successors, (1461), 27 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:52:08,001 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:52:08,001 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 191
[2024-03-11 22:52:08,001 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:52:33,587 INFO  L130       PetriNetUnfolder]: 40979/66400 cut-off events.
[2024-03-11 22:52:33,588 INFO  L131       PetriNetUnfolder]: For 535039/535039 co-relation queries the response was YES.
[2024-03-11 22:52:34,027 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 460809 conditions, 66400 events. 40979/66400 cut-off events. For 535039/535039 co-relation queries the response was YES. Maximal size of possible extension queue 1996. Compared 521978 event pairs, 4229 based on Foata normal form. 293/66402 useless extension candidates. Maximal degree in co-relation 443210. Up to 38359 conditions per place. 
[2024-03-11 22:52:34,317 INFO  L137   encePairwiseOnDemand]: 148/191 looper letters, 3082 selfloop transitions, 1229 changer transitions 64/4377 dead transitions.
[2024-03-11 22:52:34,318 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 4377 transitions, 69156 flow
[2024-03-11 22:52:34,319 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-11 22:52:34,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-11 22:52:34,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2051 transitions.
[2024-03-11 22:52:34,323 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3579406631762653
[2024-03-11 22:52:34,323 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 2051 transitions.
[2024-03-11 22:52:34,323 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 2051 transitions.
[2024-03-11 22:52:34,324 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:52:34,324 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2051 transitions.
[2024-03-11 22:52:34,327 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 68.36666666666666) internal successors, (2051), 30 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:52:34,332 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 191.0) internal successors, (5921), 31 states have internal predecessors, (5921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:52:34,333 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 191.0) internal successors, (5921), 31 states have internal predecessors, (5921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:52:34,333 INFO  L175             Difference]: Start difference. First operand has 164 places, 1793 transitions, 25517 flow. Second operand 30 states and 2051 transitions.
[2024-03-11 22:52:34,333 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 4377 transitions, 69156 flow
[2024-03-11 22:52:53,619 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 4377 transitions, 68172 flow, removed 492 selfloop flow, removed 0 redundant places.
[2024-03-11 22:52:53,667 INFO  L231             Difference]: Finished difference. Result has 215 places, 2934 transitions, 47864 flow
[2024-03-11 22:52:53,669 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=24887, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=47864, PETRI_PLACES=215, PETRI_TRANSITIONS=2934}
[2024-03-11 22:52:53,669 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 153 predicate places.
[2024-03-11 22:52:53,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 2934 transitions, 47864 flow
[2024-03-11 22:52:53,670 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 54.111111111111114) internal successors, (1461), 27 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:52:53,670 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:52:53,670 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]
[2024-03-11 22:52:53,678 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
[2024-03-11 22:52:53,871 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-03-11 22:52:53,872 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:52:53,873 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:52:53,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 240239789, now seen corresponding path program 1 times
[2024-03-11 22:52:53,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:52:53,874 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927779165]
[2024-03-11 22:52:53,875 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:52:53,875 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:52:53,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:52:53,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:52:53,944 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:52:53,944 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927779165]
[2024-03-11 22:52:53,944 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927779165] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:52:53,944 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007766517]
[2024-03-11 22:52:53,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:52:53,945 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:52:53,945 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:52:53,946 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)
[2024-03-11 22:52:53,948 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
[2024-03-11 22:52:54,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:52:54,050 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-11 22:52:54,051 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:52:54,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:52:54,093 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:52:54,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:52:54,121 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007766517] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:52:54,121 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:52:54,122 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-03-11 22:52:54,122 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200849222]
[2024-03-11 22:52:54,122 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:52:54,122 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-11 22:52:54,122 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:52:54,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-11 22:52:54,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-11 22:52:54,234 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 191
[2024-03-11 22:52:54,234 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 2934 transitions, 47864 flow. Second operand  has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:52:54,234 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:52:54,234 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 191
[2024-03-11 22:52:54,235 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:53:11,212 INFO  L130       PetriNetUnfolder]: 27139/47237 cut-off events.
[2024-03-11 22:53:11,213 INFO  L131       PetriNetUnfolder]: For 590717/597039 co-relation queries the response was YES.
[2024-03-11 22:53:11,658 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 352286 conditions, 47237 events. 27139/47237 cut-off events. For 590717/597039 co-relation queries the response was YES. Maximal size of possible extension queue 1565. Compared 396743 event pairs, 2543 based on Foata normal form. 755/47155 useless extension candidates. Maximal degree in co-relation 352172. Up to 17659 conditions per place. 
[2024-03-11 22:53:11,877 INFO  L137   encePairwiseOnDemand]: 184/191 looper letters, 549 selfloop transitions, 14 changer transitions 53/2809 dead transitions.
[2024-03-11 22:53:11,877 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 2809 transitions, 47299 flow
[2024-03-11 22:53:11,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 22:53:11,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 22:53:11,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 774 transitions.
[2024-03-11 22:53:11,879 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5789080029917726
[2024-03-11 22:53:11,879 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 774 transitions.
[2024-03-11 22:53:11,879 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 774 transitions.
[2024-03-11 22:53:11,880 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:53:11,880 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 774 transitions.
[2024-03-11 22:53:11,881 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:11,883 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:11,883 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:11,883 INFO  L175             Difference]: Start difference. First operand has 215 places, 2934 transitions, 47864 flow. Second operand 7 states and 774 transitions.
[2024-03-11 22:53:11,883 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 2809 transitions, 47299 flow
[2024-03-11 22:53:25,065 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2809 transitions, 46839 flow, removed 216 selfloop flow, removed 6 redundant places.
[2024-03-11 22:53:25,103 INFO  L231             Difference]: Finished difference. Result has 215 places, 2581 transitions, 42439 flow
[2024-03-11 22:53:25,104 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=42934, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=42439, PETRI_PLACES=215, PETRI_TRANSITIONS=2581}
[2024-03-11 22:53:25,105 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 153 predicate places.
[2024-03-11 22:53:25,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 2581 transitions, 42439 flow
[2024-03-11 22:53:25,106 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:25,106 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:53:25,106 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]
[2024-03-11 22:53:25,111 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-11 22:53:25,310 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:53:25,310 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:53:25,311 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:53:25,311 INFO  L85        PathProgramCache]: Analyzing trace with hash 1374568054, now seen corresponding path program 2 times
[2024-03-11 22:53:25,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:53:25,311 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710280992]
[2024-03-11 22:53:25,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:53:25,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:53:25,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:53:25,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:53:25,799 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:53:25,799 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710280992]
[2024-03-11 22:53:25,799 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710280992] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:53:25,800 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587255148]
[2024-03-11 22:53:25,800 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:53:25,800 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:53:25,800 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:53:25,801 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)
[2024-03-11 22:53:25,802 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
[2024-03-11 22:53:25,945 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:53:25,945 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:53:25,947 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 51 conjunts are in the unsatisfiable core
[2024-03-11 22:53:25,951 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:53:25,960 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:25,960 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15
[2024-03-11 22:53:26,006 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-11 22:53:26,007 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-11 22:53:26,125 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:53:26,125 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-11 22:53:26,180 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 22:53:26,249 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
[2024-03-11 22:53:26,286 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
[2024-03-11 22:53:26,323 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,324 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
[2024-03-11 22:53:26,374 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,375 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,376 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
[2024-03-11 22:53:26,429 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,430 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,431 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,431 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
[2024-03-11 22:53:26,486 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,487 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
[2024-03-11 22:53:26,519 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,520 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
[2024-03-11 22:53:26,540 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,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
[2024-03-11 22:53:26,566 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:53:26,567 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
[2024-03-11 22:53:26,642 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
[2024-03-11 22:53:26,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:53:26,683 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:53:26,815 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:53:26,864 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-11 22:53:26,884 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-11 22:53:27,031 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1) |c_threadThread1of2ForFork0_#t~nondet4|) (+ c_threadThread1of2ForFork0_~t~0.offset 2) |c_threadThread1of2ForFork0_#t~nondet4|) (+ c_threadThread1of2ForFork0_~t~0.offset 3) |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_723) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_724) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) is different from false
[2024-03-11 22:53:27,047 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:53:27,048 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
[2024-03-11 22:53:27,052 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:53:27,052 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 76
[2024-03-11 22:53:27,055 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48
[2024-03-11 22:53:27,059 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28
[2024-03-11 22:53:27,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:53:27,280 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587255148] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:53:27,281 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:53:27,281 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34
[2024-03-11 22:53:27,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42798014]
[2024-03-11 22:53:27,281 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:53:27,282 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2024-03-11 22:53:27,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:53:27,283 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2024-03-11 22:53:27,283 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=830, Unknown=42, NotChecked=252, Total=1260
[2024-03-11 22:53:27,285 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 191
[2024-03-11 22:53:27,288 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 2581 transitions, 42439 flow. Second operand  has 36 states, 36 states have (on average 54.02777777777778) internal successors, (1945), 36 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:53:27,288 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:53:27,288 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 191
[2024-03-11 22:53:27,288 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:53:30,995 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-11 22:53:33,011 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-11 22:53:40,716 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-11 22:54:08,396 INFO  L130       PetriNetUnfolder]: 35389/57797 cut-off events.
[2024-03-11 22:54:08,396 INFO  L131       PetriNetUnfolder]: For 742697/742699 co-relation queries the response was YES.
[2024-03-11 22:54:08,900 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 466464 conditions, 57797 events. 35389/57797 cut-off events. For 742697/742699 co-relation queries the response was YES. Maximal size of possible extension queue 1671. Compared 448524 event pairs, 3845 based on Foata normal form. 60/57857 useless extension candidates. Maximal degree in co-relation 466161. Up to 48098 conditions per place. 
[2024-03-11 22:54:09,179 INFO  L137   encePairwiseOnDemand]: 146/191 looper letters, 2839 selfloop transitions, 886 changer transitions 21/3748 dead transitions.
[2024-03-11 22:54:09,180 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 3748 transitions, 69495 flow
[2024-03-11 22:54:09,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2024-03-11 22:54:09,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2024-03-11 22:54:09,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1840 transitions.
[2024-03-11 22:54:09,182 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3567965871630793
[2024-03-11 22:54:09,183 INFO  L72            ComplementDD]: Start complementDD. Operand 27 states and 1840 transitions.
[2024-03-11 22:54:09,183 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 27 states and 1840 transitions.
[2024-03-11 22:54:09,183 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:54:09,183 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1840 transitions.
[2024-03-11 22:54:09,185 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 28 states, 27 states have (on average 68.14814814814815) internal successors, (1840), 27 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:09,189 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 28 states, 28 states have (on average 191.0) internal successors, (5348), 28 states have internal predecessors, (5348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:09,190 INFO  L81            ComplementDD]: Finished complementDD. Result  has 28 states, 28 states have (on average 191.0) internal successors, (5348), 28 states have internal predecessors, (5348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:09,190 INFO  L175             Difference]: Start difference. First operand has 215 places, 2581 transitions, 42439 flow. Second operand 27 states and 1840 transitions.
[2024-03-11 22:54:09,190 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 3748 transitions, 69495 flow
[2024-03-11 22:54:26,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 3748 transitions, 69468 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-03-11 22:54:26,678 INFO  L231             Difference]: Finished difference. Result has 251 places, 3089 transitions, 55414 flow
[2024-03-11 22:54:26,680 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=42424, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=448, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1934, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=55414, PETRI_PLACES=251, PETRI_TRANSITIONS=3089}
[2024-03-11 22:54:26,680 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 189 predicate places.
[2024-03-11 22:54:26,681 INFO  L495      AbstractCegarLoop]: Abstraction has has 251 places, 3089 transitions, 55414 flow
[2024-03-11 22:54:26,682 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 36 states, 36 states have (on average 54.02777777777778) internal successors, (1945), 36 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:26,682 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:54:26,682 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]
[2024-03-11 22:54:26,689 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-11 22:54:26,882 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-03-11 22:54:26,886 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:54:26,887 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:54:26,887 INFO  L85        PathProgramCache]: Analyzing trace with hash -1463167472, now seen corresponding path program 3 times
[2024-03-11 22:54:26,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:54:26,887 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906360668]
[2024-03-11 22:54:26,888 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:54:26,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:54:26,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:54:27,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:27,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:54:27,443 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906360668]
[2024-03-11 22:54:27,443 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906360668] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:54:27,443 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680664138]
[2024-03-11 22:54:27,443 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-11 22:54:27,444 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:54:27,444 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:54:27,445 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)
[2024-03-11 22:54:27,448 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
[2024-03-11 22:54:27,571 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-11 22:54:27,571 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:54:27,573 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 60 conjunts are in the unsatisfiable core
[2024-03-11 22:54:27,578 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:54:27,588 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:54:27,589 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15
[2024-03-11 22:54:27,627 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:54:27,638 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-11 22:54:27,639 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-11 22:54:27,792 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:54:27,793 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-03-11 22:54:27,852 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 22:54:27,902 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:54:27,956 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:54:27,958 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:54:28,016 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:54:28,017 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:54:28,019 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:54:28,186 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:54:28,186 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:54:28,187 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:54:28,188 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:54:28,264 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-11 22:54:28,331 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
[2024-03-11 22:54:28,356 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
[2024-03-11 22:54:28,381 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
[2024-03-11 22:54:28,416 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
[2024-03-11 22:54:28,582 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:54:28,584 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 50 treesize of output 49
[2024-03-11 22:54:28,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:28,656 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:54:28,676 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-11 22:54:28,793 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1))) (and (forall ((v_ArrVal_830 (Array Int Int))) (or (forall ((v_ArrVal_831 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_830 .cse0) 0)))) (forall ((v_ArrVal_830 (Array Int Int))) (or (forall ((v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= (select v_ArrVal_830 .cse0) 0)))) (forall ((v_ArrVal_830 (Array Int Int))) (or (forall ((v_ArrVal_831 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_830 .cse0) 0)))) (forall ((v_ArrVal_830 (Array Int Int))) (or (forall ((v_ArrVal_831 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_830 .cse0) 0)))))) is different from false
[2024-03-11 22:54:29,994 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:54:29,995 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
[2024-03-11 22:54:30,003 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:54:30,004 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 248 treesize of output 154
[2024-03-11 22:54:30,041 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:54:30,041 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 70
[2024-03-11 22:54:30,046 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 118 treesize of output 102
[2024-03-11 22:54:30,089 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:54:30,089 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
[2024-03-11 22:54:30,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:54:30,486 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680664138] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:54:30,487 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:54:30,487 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 40
[2024-03-11 22:54:30,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117579114]
[2024-03-11 22:54:30,488 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:54:30,488 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-03-11 22:54:30,488 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:54:30,489 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-03-11 22:54:30,490 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1348, Unknown=18, NotChecked=154, Total=1722
[2024-03-11 22:54:31,228 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 43 out of 191
[2024-03-11 22:54:31,230 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 3089 transitions, 55414 flow. Second operand  has 42 states, 42 states have (on average 44.833333333333336) internal successors, (1883), 42 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:54:31,231 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:54:31,231 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 191
[2024-03-11 22:54:31,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:54:37,025 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:54:39,140 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:54:41,369 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:54:44,593 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:54:46,597 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:54:49,095 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:54:51,099 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:54:53,353 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:54:55,525 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:54:59,486 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:55:02,362 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:55:04,517 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:55:06,955 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:55:09,682 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:55:11,859 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:55:18,528 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:55:20,541 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:55:22,761 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:55:24,829 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:55:30,491 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-11 22:56:01,711 INFO  L130       PetriNetUnfolder]: 36395/59433 cut-off events.
[2024-03-11 22:56:01,712 INFO  L131       PetriNetUnfolder]: For 1011702/1011704 co-relation queries the response was YES.
[2024-03-11 22:56:02,325 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 527960 conditions, 59433 events. 36395/59433 cut-off events. For 1011702/1011704 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 462341 event pairs, 3908 based on Foata normal form. 27/59460 useless extension candidates. Maximal degree in co-relation 523366. Up to 48808 conditions per place. 
[2024-03-11 22:56:02,629 INFO  L137   encePairwiseOnDemand]: 152/191 looper letters, 2787 selfloop transitions, 1262 changer transitions 27/4078 dead transitions.
[2024-03-11 22:56:02,630 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 4078 transitions, 81473 flow
[2024-03-11 22:56:02,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. 
[2024-03-11 22:56:02,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 44 states.
[2024-03-11 22:56:02,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 2368 transitions.
[2024-03-11 22:56:02,634 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2817705854355069
[2024-03-11 22:56:02,634 INFO  L72            ComplementDD]: Start complementDD. Operand 44 states and 2368 transitions.
[2024-03-11 22:56:02,634 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 44 states and 2368 transitions.
[2024-03-11 22:56:02,635 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:56:02,635 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 2368 transitions.
[2024-03-11 22:56:02,638 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 45 states, 44 states have (on average 53.81818181818182) internal successors, (2368), 44 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:02,643 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 45 states, 45 states have (on average 191.0) internal successors, (8595), 45 states have internal predecessors, (8595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:02,644 INFO  L81            ComplementDD]: Finished complementDD. Result  has 45 states, 45 states have (on average 191.0) internal successors, (8595), 45 states have internal predecessors, (8595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:02,644 INFO  L175             Difference]: Start difference. First operand has 251 places, 3089 transitions, 55414 flow. Second operand 44 states and 2368 transitions.
[2024-03-11 22:56:02,644 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 4078 transitions, 81473 flow
[2024-03-11 22:56:28,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 4078 transitions, 80432 flow, removed 481 selfloop flow, removed 7 redundant places.
[2024-03-11 22:56:28,345 INFO  L231             Difference]: Finished difference. Result has 314 places, 3629 transitions, 70496 flow
[2024-03-11 22:56:28,347 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=54472, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3089, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=799, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=70496, PETRI_PLACES=314, PETRI_TRANSITIONS=3629}
[2024-03-11 22:56:28,347 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 252 predicate places.
[2024-03-11 22:56:28,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 3629 transitions, 70496 flow
[2024-03-11 22:56:28,348 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 44.833333333333336) internal successors, (1883), 42 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:28,348 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:56:28,348 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]
[2024-03-11 22:56:28,356 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-11 22:56:28,548 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,SelfDestructingSolverStorable14
[2024-03-11 22:56:28,549 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:56:28,550 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:56:28,550 INFO  L85        PathProgramCache]: Analyzing trace with hash 525823480, now seen corresponding path program 4 times
[2024-03-11 22:56:28,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:56:28,551 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736582827]
[2024-03-11 22:56:28,551 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:56:28,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:56:28,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:56:29,113 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:56:29,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:56:29,114 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736582827]
[2024-03-11 22:56:29,114 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736582827] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:56:29,114 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764531141]
[2024-03-11 22:56:29,114 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-11 22:56:29,114 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:56:29,115 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:56:29,116 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)
[2024-03-11 22:56:29,119 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
[2024-03-11 22:56:29,350 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-11 22:56:29,351 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:56:29,353 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 51 conjunts are in the unsatisfiable core
[2024-03-11 22:56:29,358 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:56:29,372 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:29,373 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15
[2024-03-11 22:56:29,422 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-11 22:56:29,423 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-11 22:56:29,611 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:56:29,612 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-11 22:56:29,677 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:29,678 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 22:56:29,735 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
[2024-03-11 22:56:29,793 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:29,794 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
[2024-03-11 22:56:29,935 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
[2024-03-11 22:56:29,994 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:29,995 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:29,996 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
[2024-03-11 22:56:30,057 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:30,058 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:30,059 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:30,060 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
[2024-03-11 22:56:30,138 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:30,139 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
[2024-03-11 22:56:30,175 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:30,176 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
[2024-03-11 22:56:30,203 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:30,204 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
[2024-03-11 22:56:30,233 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:56:30,234 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
[2024-03-11 22:56:30,332 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
[2024-03-11 22:56:30,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:56:30,385 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:56:30,412 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_938 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-11 22:56:30,456 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2024-03-11 22:56:30,522 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:56:31,102 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) .cse1 v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) .cse1 v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) .cse1 v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_937 (Array Int Int)) (v_ArrVal_938 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_937) .cse1 v_ArrVal_938) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-11 22:56:31,122 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:56:31,123 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
[2024-03-11 22:56:31,130 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:56:31,130 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 76
[2024-03-11 22:56:31,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 32 treesize of output 30
[2024-03-11 22:56:31,141 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2024-03-11 22:56:31,171 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:56:31,172 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
[2024-03-11 22:56:31,180 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:56:31,181 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
[2024-03-11 22:56:31,190 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:56:31,190 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
[2024-03-11 22:56:31,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:56:31,414 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764531141] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:56:31,415 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:56:31,415 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34
[2024-03-11 22:56:31,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499491120]
[2024-03-11 22:56:31,415 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:56:31,416 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2024-03-11 22:56:31,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:56:31,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2024-03-11 22:56:31,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=831, Unknown=48, NotChecked=252, Total=1260
[2024-03-11 22:56:31,624 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 191
[2024-03-11 22:56:31,626 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 3629 transitions, 70496 flow. Second operand  has 36 states, 36 states have (on average 54.083333333333336) internal successors, (1947), 36 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:56:31,626 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:56:31,626 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 191
[2024-03-11 22:56:31,626 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:57:22,633 INFO  L130       PetriNetUnfolder]: 37475/61186 cut-off events.
[2024-03-11 22:57:22,633 INFO  L131       PetriNetUnfolder]: For 1301774/1301776 co-relation queries the response was YES.
[2024-03-11 22:57:23,536 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 588002 conditions, 61186 events. 37475/61186 cut-off events. For 1301774/1301776 co-relation queries the response was YES. Maximal size of possible extension queue 1733. Compared 477529 event pairs, 3934 based on Foata normal form. 60/61246 useless extension candidates. Maximal degree in co-relation 586428. Up to 49479 conditions per place. 
[2024-03-11 22:57:23,851 INFO  L137   encePairwiseOnDemand]: 150/191 looper letters, 3131 selfloop transitions, 1358 changer transitions 11/4502 dead transitions.
[2024-03-11 22:57:23,851 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 4502 transitions, 98111 flow
[2024-03-11 22:57:23,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-11 22:57:23,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-11 22:57:23,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1772 transitions.
[2024-03-11 22:57:23,854 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3568264196536448
[2024-03-11 22:57:23,854 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1772 transitions.
[2024-03-11 22:57:23,854 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1772 transitions.
[2024-03-11 22:57:23,855 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:57:23,855 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1772 transitions.
[2024-03-11 22:57:23,858 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 68.15384615384616) internal successors, (1772), 26 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:23,861 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 191.0) internal successors, (5157), 27 states have internal predecessors, (5157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:23,861 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 191.0) internal successors, (5157), 27 states have internal predecessors, (5157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:57:23,862 INFO  L175             Difference]: Start difference. First operand has 314 places, 3629 transitions, 70496 flow. Second operand 26 states and 1772 transitions.
[2024-03-11 22:57:23,862 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 4502 transitions, 98111 flow
[2024-03-11 22:58:00,225 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 4502 transitions, 96141 flow, removed 971 selfloop flow, removed 6 redundant places.
[2024-03-11 22:58:00,297 INFO  L231             Difference]: Finished difference. Result has 344 places, 3979 transitions, 83045 flow
[2024-03-11 22:58:00,299 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=69258, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=83045, PETRI_PLACES=344, PETRI_TRANSITIONS=3979}
[2024-03-11 22:58:00,300 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 282 predicate places.
[2024-03-11 22:58:00,300 INFO  L495      AbstractCegarLoop]: Abstraction has has 344 places, 3979 transitions, 83045 flow
[2024-03-11 22:58:00,300 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 36 states, 36 states have (on average 54.083333333333336) internal successors, (1947), 36 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:58:00,300 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:58:00,300 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]
[2024-03-11 22:58:00,308 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-11 22:58:00,501 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
[2024-03-11 22:58:00,502 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:58:00,502 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:58:00,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 1881316316, now seen corresponding path program 5 times
[2024-03-11 22:58:00,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:58:00,504 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418142515]
[2024-03-11 22:58:00,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:58:00,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:58:00,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:58:01,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:58:01,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:58:01,020 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418142515]
[2024-03-11 22:58:01,021 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418142515] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:58:01,021 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562734376]
[2024-03-11 22:58:01,021 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-11 22:58:01,021 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:58:01,022 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:58:01,023 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)
[2024-03-11 22:58:01,024 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
[2024-03-11 22:58:01,143 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:58:01,144 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:58:01,145 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 57 conjunts are in the unsatisfiable core
[2024-03-11 22:58:01,149 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:58:01,180 INFO  L321             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2024-03-11 22:58:01,180 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26
[2024-03-11 22:58:01,236 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:01,249 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-11 22:58:01,249 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-03-11 22:58:01,460 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:58:01,460 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-03-11 22:58:01,548 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:01,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 23 treesize of output 23
[2024-03-11 22:58:01,614 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
[2024-03-11 22:58:01,715 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:01,716 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
[2024-03-11 22:58:01,783 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:01,785 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:01,785 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
[2024-03-11 22:58:01,852 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-11 22:58:01,935 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:01,936 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-11 22:58:01,968 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:01,969 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-11 22:58:01,995 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:01,996 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-11 22:58:02,014 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:02,015 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-11 22:58:02,078 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:02,079 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:02,080 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:58:02,081 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
[2024-03-11 22:58:02,159 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
[2024-03-11 22:58:02,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:58:02,212 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:58:02,237 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1046 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1046 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1046 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1046 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-11 22:58:02,280 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1046 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1046 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1046 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1046 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:58:02,317 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-03-11 22:58:02,387 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse2 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse2 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse2 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse2 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) .cse1))))) is different from false
[2024-03-11 22:58:02,414 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (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_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse3 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse3 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse3 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse6 c_threadThread1of2ForFork0_~t~0.base (store (select .cse6 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse3 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) .cse7)))))) is different from false
[2024-03-11 22:58:02,440 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (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_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse3 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse3 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse6 c_threadThread1of2ForFork0_~t~0.base (store (select .cse6 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse3 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) .cse7))) (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (= (select (select (store (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1043))) (store .cse8 c_threadThread1of2ForFork0_~t~0.base (store (select .cse8 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) .cse3 v_ArrVal_1046) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:58:02,492 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:58:02,493 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 61
[2024-03-11 22:58:02,499 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:58:02,499 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 78
[2024-03-11 22:58:02,503 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 58 treesize of output 50
[2024-03-11 22:58:02,507 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 32 treesize of output 28
[2024-03-11 22:58:02,537 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-11 22:58:02,538 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 3 case distinctions, treesize of input 68 treesize of output 1
[2024-03-11 22:58:02,543 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-11 22:58:02,543 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 3 case distinctions, treesize of input 66 treesize of output 1
[2024-03-11 22:58:02,550 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-11 22:58:02,550 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 3 case distinctions, treesize of input 68 treesize of output 1
[2024-03-11 22:58:02,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:58:02,751 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562734376] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:58:02,751 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:58:02,752 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34
[2024-03-11 22:58:02,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164952699]
[2024-03-11 22:58:02,753 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:58:02,753 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2024-03-11 22:58:02,754 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:58:02,754 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2024-03-11 22:58:02,755 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=763, Unknown=8, NotChecked=366, Total=1260
[2024-03-11 22:58:02,932 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 191
[2024-03-11 22:58:02,934 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 3979 transitions, 83045 flow. Second operand  has 36 states, 36 states have (on average 54.083333333333336) internal successors, (1947), 36 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:58:02,934 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:58:02,934 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 191
[2024-03-11 22:58:02,935 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:58:57,777 INFO  L130       PetriNetUnfolder]: 37913/61874 cut-off events.
[2024-03-11 22:58:57,777 INFO  L131       PetriNetUnfolder]: For 1583797/1583799 co-relation queries the response was YES.
[2024-03-11 22:58:58,790 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 632711 conditions, 61874 events. 37913/61874 cut-off events. For 1583797/1583799 co-relation queries the response was YES. Maximal size of possible extension queue 1746. Compared 483317 event pairs, 3941 based on Foata normal form. 50/61924 useless extension candidates. Maximal degree in co-relation 627253. Up to 49892 conditions per place. 
[2024-03-11 22:58:59,126 INFO  L137   encePairwiseOnDemand]: 150/191 looper letters, 3056 selfloop transitions, 1538 changer transitions 11/4607 dead transitions.
[2024-03-11 22:58:59,127 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 4607 transitions, 106199 flow
[2024-03-11 22:58:59,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2024-03-11 22:58:59,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2024-03-11 22:58:59,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1811 transitions.
[2024-03-11 22:58:59,131 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3511731626914873
[2024-03-11 22:58:59,132 INFO  L72            ComplementDD]: Start complementDD. Operand 27 states and 1811 transitions.
[2024-03-11 22:58:59,132 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 27 states and 1811 transitions.
[2024-03-11 22:58:59,132 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:58:59,132 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1811 transitions.
[2024-03-11 22:58:59,134 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 28 states, 27 states have (on average 67.07407407407408) internal successors, (1811), 27 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:58:59,138 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 28 states, 28 states have (on average 191.0) internal successors, (5348), 28 states have internal predecessors, (5348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:58:59,138 INFO  L81            ComplementDD]: Finished complementDD. Result  has 28 states, 28 states have (on average 191.0) internal successors, (5348), 28 states have internal predecessors, (5348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:58:59,139 INFO  L175             Difference]: Start difference. First operand has 344 places, 3979 transitions, 83045 flow. Second operand 27 states and 1811 transitions.
[2024-03-11 22:58:59,139 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 4607 transitions, 106199 flow
[2024-03-11 22:59:49,822 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 4607 transitions, 105230 flow, removed 403 selfloop flow, removed 11 redundant places.
[2024-03-11 22:59:49,898 INFO  L231             Difference]: Finished difference. Result has 370 places, 4224 transitions, 93740 flow
[2024-03-11 22:59:49,900 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=82148, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3979, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=93740, PETRI_PLACES=370, PETRI_TRANSITIONS=4224}
[2024-03-11 22:59:49,901 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 308 predicate places.
[2024-03-11 22:59:49,901 INFO  L495      AbstractCegarLoop]: Abstraction has has 370 places, 4224 transitions, 93740 flow
[2024-03-11 22:59:49,902 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 36 states, 36 states have (on average 54.083333333333336) internal successors, (1947), 36 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:59:49,902 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:59:49,902 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]
[2024-03-11 22:59:49,909 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-11 22:59:50,102 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
[2024-03-11 22:59:50,103 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:59:50,104 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:59:50,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 13517858, now seen corresponding path program 1 times
[2024-03-11 22:59:50,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:59:50,105 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148534749]
[2024-03-11 22:59:50,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:59:50,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:59:50,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:59:50,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:59:50,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:59:50,554 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148534749]
[2024-03-11 22:59:50,554 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148534749] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:59:50,555 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089123892]
[2024-03-11 22:59:50,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:59:50,555 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:59:50,555 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:59:50,556 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)
[2024-03-11 22:59:50,558 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
[2024-03-11 22:59:50,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:59:50,710 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 41 conjunts are in the unsatisfiable core
[2024-03-11 22:59:50,716 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:59:50,737 INFO  L321             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2024-03-11 22:59:50,738 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26
[2024-03-11 22:59:50,765 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-11 22:59:50,766 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-11 22:59:50,906 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:59:50,906 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-03-11 22:59:50,951 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:59:50,952 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 23 treesize of output 23
[2024-03-11 22:59:51,002 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-11 22:59:51,023 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:59:51,033 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:59:51,061 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:59:51,061 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:59:51,074 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 42 treesize of output 40
[2024-03-11 22:59:51,091 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:59:51,091 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 52 treesize of output 57
[2024-03-11 22:59:51,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:59:51,106 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:59:51,166 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1152 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1152) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1152 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1152) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1152 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1152) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)))) is different from false
[2024-03-11 22:59:51,257 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 (Array Int Int)) (v_DerPreprocessor_1 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| v_DerPreprocessor_1 v_ArrVal_1145) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= v_DerPreprocessor_1 .cse0)) (not (= |c_threadThread1of2ForFork0_#in~arg.base| .cse0))))) is different from false
[2024-03-11 22:59:51,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:59:51,481 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089123892] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:59:51,481 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:59:51,482 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22
[2024-03-11 22:59:51,482 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122995594]
[2024-03-11 22:59:51,482 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:59:51,483 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-11 22:59:51,483 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:59:51,483 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-11 22:59:51,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=376, Unknown=20, NotChecked=82, Total=552
[2024-03-11 22:59:51,485 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 191
[2024-03-11 22:59:51,486 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 4224 transitions, 93740 flow. Second operand  has 24 states, 24 states have (on average 51.25) internal successors, (1230), 24 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:59:51,486 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:59:51,487 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 191
[2024-03-11 22:59:51,487 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:00:48,868 INFO  L130       PetriNetUnfolder]: 38119/62331 cut-off events.
[2024-03-11 23:00:48,868 INFO  L131       PetriNetUnfolder]: For 1811491/1811493 co-relation queries the response was YES.
[2024-03-11 23:00:50,021 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 663746 conditions, 62331 events. 38119/62331 cut-off events. For 1811491/1811493 co-relation queries the response was YES. Maximal size of possible extension queue 1770. Compared 488498 event pairs, 3903 based on Foata normal form. 137/62468 useless extension candidates. Maximal degree in co-relation 657807. Up to 47262 conditions per place. 
[2024-03-11 23:00:50,364 INFO  L137   encePairwiseOnDemand]: 163/191 looper letters, 4214 selfloop transitions, 1441 changer transitions 6/5663 dead transitions.
[2024-03-11 23:00:50,364 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 5663 transitions, 136061 flow
[2024-03-11 23:00:50,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-03-11 23:00:50,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-03-11 23:00:50,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1479 transitions.
[2024-03-11 23:00:50,367 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3226439790575916
[2024-03-11 23:00:50,367 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1479 transitions.
[2024-03-11 23:00:50,368 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1479 transitions.
[2024-03-11 23:00:50,368 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:00:50,368 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1479 transitions.
[2024-03-11 23:00:50,370 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 61.625) internal successors, (1479), 24 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:50,373 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 191.0) internal successors, (4775), 25 states have internal predecessors, (4775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:50,373 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 191.0) internal successors, (4775), 25 states have internal predecessors, (4775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:00:50,373 INFO  L175             Difference]: Start difference. First operand has 370 places, 4224 transitions, 93740 flow. Second operand 24 states and 1479 transitions.
[2024-03-11 23:00:50,373 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 5663 transitions, 136061 flow
[2024-03-11 23:01:57,682 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 5663 transitions, 134887 flow, removed 443 selfloop flow, removed 14 redundant places.
[2024-03-11 23:01:57,771 INFO  L231             Difference]: Finished difference. Result has 393 places, 4856 transitions, 112886 flow
[2024-03-11 23:01:57,773 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=92686, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=831, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=112886, PETRI_PLACES=393, PETRI_TRANSITIONS=4856}
[2024-03-11 23:01:57,774 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 331 predicate places.
[2024-03-11 23:01:57,774 INFO  L495      AbstractCegarLoop]: Abstraction has has 393 places, 4856 transitions, 112886 flow
[2024-03-11 23:01:57,774 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 51.25) internal successors, (1230), 24 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:01:57,774 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:01:57,775 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]
[2024-03-11 23:01:57,782 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-11 23:01:57,975 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
[2024-03-11 23:01:57,976 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 23:01:57,977 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:01:57,978 INFO  L85        PathProgramCache]: Analyzing trace with hash 2082872802, now seen corresponding path program 6 times
[2024-03-11 23:01:57,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:01:57,978 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032753524]
[2024-03-11 23:01:57,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:01:57,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:01:57,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:01:58,502 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:01:58,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:01:58,503 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032753524]
[2024-03-11 23:01:58,503 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032753524] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 23:01:58,504 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645490635]
[2024-03-11 23:01:58,504 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-11 23:01:58,504 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:01:58,504 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:01:58,506 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)
[2024-03-11 23:01:58,514 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
[2024-03-11 23:01:58,686 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-11 23:01:58,687 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 23:01:58,689 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 69 conjunts are in the unsatisfiable core
[2024-03-11 23:01:58,695 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 23:01:58,708 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:01:58,709 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15
[2024-03-11 23:01:58,761 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:01:58,777 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-11 23:01:58,777 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-11 23:01:59,032 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 23:01:59,032 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37
[2024-03-11 23:01:59,041 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:01:59,042 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-11 23:01:59,135 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 23:01:59,154 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-11 23:01:59,219 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 23:01:59,422 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-11 23:01:59,433 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-11 23:01:59,502 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:01:59,504 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 23:01:59,577 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 23:01:59,598 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:01:59,600 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:01:59,601 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 23:01:59,684 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-11 23:01:59,734 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-11 23:01:59,764 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-11 23:01:59,827 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:01:59,828 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:01:59,829 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:01:59,830 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
[2024-03-11 23:01:59,917 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
[2024-03-11 23:01:59,968 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:01:59,968 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 23:01:59,994 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1264 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1264 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1264 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1264 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-11 23:02:00,216 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1261))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1261))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1261))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1261))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) .cse1))))) is different from false
[2024-03-11 23:02:00,274 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1261))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1261))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1261))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1261))) (store .cse6 c_threadThread1of2ForFork0_~t~0.base (store (select .cse6 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1264) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-11 23:02:01,113 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:02:01,114 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645490635] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 23:02:01,114 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 23:02:01,114 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 39
[2024-03-11 23:02:01,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179728639]
[2024-03-11 23:02:01,115 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 23:02:01,115 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2024-03-11 23:02:01,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:02:01,116 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2024-03-11 23:02:01,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1212, Unknown=47, NotChecked=222, Total=1640
[2024-03-11 23:02:01,531 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 43 out of 191
[2024-03-11 23:02:01,533 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 4856 transitions, 112886 flow. Second operand  has 41 states, 41 states have (on average 44.8780487804878) internal successors, (1840), 41 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:02:01,533 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:02:01,533 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 191
[2024-03-11 23:02:01,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:03:20,364 INFO  L130       PetriNetUnfolder]: 39934/65503 cut-off events.
[2024-03-11 23:03:20,365 INFO  L131       PetriNetUnfolder]: For 2031085/2031087 co-relation queries the response was YES.
[2024-03-11 23:03:21,706 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 727136 conditions, 65503 events. 39934/65503 cut-off events. For 2031085/2031087 co-relation queries the response was YES. Maximal size of possible extension queue 1823. Compared 516908 event pairs, 3751 based on Foata normal form. 112/65615 useless extension candidates. Maximal degree in co-relation 720598. Up to 49009 conditions per place. 
[2024-03-11 23:03:22,084 INFO  L137   encePairwiseOnDemand]: 152/191 looper letters, 3970 selfloop transitions, 2246 changer transitions 50/6268 dead transitions.
[2024-03-11 23:03:22,084 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 6268 transitions, 157270 flow
[2024-03-11 23:03:22,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2024-03-11 23:03:22,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2024-03-11 23:03:22,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 1970 transitions.
[2024-03-11 23:03:22,088 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3033569448721897
[2024-03-11 23:03:22,088 INFO  L72            ComplementDD]: Start complementDD. Operand 34 states and 1970 transitions.
[2024-03-11 23:03:22,088 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 34 states and 1970 transitions.
[2024-03-11 23:03:22,088 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:03:22,088 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 1970 transitions.
[2024-03-11 23:03:22,091 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 35 states, 34 states have (on average 57.94117647058823) internal successors, (1970), 34 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:03:22,095 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 35 states, 35 states have (on average 191.0) internal successors, (6685), 35 states have internal predecessors, (6685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:03:22,095 INFO  L81            ComplementDD]: Finished complementDD. Result  has 35 states, 35 states have (on average 191.0) internal successors, (6685), 35 states have internal predecessors, (6685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 23:03:22,096 INFO  L175             Difference]: Start difference. First operand has 393 places, 4856 transitions, 112886 flow. Second operand 34 states and 1970 transitions.
[2024-03-11 23:03:22,096 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 6268 transitions, 157270 flow
Killed by 15
