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


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b6eb9e7d3437ec45e42551d436b8655c54ce0f20ae1baa60ae5b9edbe177059
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 21:39:02,909 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 21:39:02,915 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 21:39:02,939 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 21:39:02,942 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 21:39:02,943 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 21:39:02,944 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 21:39:02,945 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 21:39:02,946 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 21:39:02,946 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 21:39:02,947 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 21:39:02,948 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 21:39:02,948 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 21:39:02,949 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 21:39:02,950 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 21:39:02,950 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 21:39:02,951 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 21:39:02,952 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 21:39:02,953 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 21:39:02,954 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 21:39:02,955 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 21:39:02,956 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 21:39:02,957 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 21:39:02,957 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 21:39:02,960 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 21:39:02,960 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 21:39:02,960 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 21:39:02,961 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 21:39:02,961 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 21:39:02,961 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 21:39:02,962 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 21:39:02,962 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 21:39:02,962 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 21:39:02,963 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 21:39:02,964 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 21:39:02,964 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 21:39:02,964 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 21:39:02,964 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 21:39:02,965 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 21:39:02,965 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 21:39:02,965 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 21:39:02,966 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 21:39:02,981 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 21:39:02,981 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 21:39:02,981 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 21:39:02,982 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 21:39:02,982 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 21:39:02,982 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 21:39:02,982 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 21:39:02,983 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 21:39:02,983 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 21:39:02,983 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 21:39:02,983 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 21:39:02,983 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 21:39:02,983 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 21:39:02,983 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 21:39:02,983 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 21:39:02,983 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 21:39:02,984 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 21:39:02,984 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 21:39:02,984 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 21:39:02,984 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 21:39:02,984 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 21:39:02,984 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 21:39:02,984 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 21:39:02,984 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 21:39:02,984 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 21:39:02,984 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 21:39:02,985 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 21:39:02,985 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 21:39:02,985 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 21:39:02,985 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 21:39:02,985 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 21:39:02,985 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 21:39:02,985 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 21:39:02,985 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 21:39:02,985 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 21:39:02,986 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 21:39:02,986 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 21:39:02,986 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 -> 7b6eb9e7d3437ec45e42551d436b8655c54ce0f20ae1baa60ae5b9edbe177059
[2024-03-11 21:39:03,144 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 21:39:03,181 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 21:39:03,183 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 21:39:03,184 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 21:39:03,185 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 21:39:03,185 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2024-03-11 21:39:04,228 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 21:39:04,420 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 21:39:04,420 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2024-03-11 21:39:04,430 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/548489a70/eaf1048f9c394e138e32a3876dd8dac6/FLAG11f1d3ca3
[2024-03-11 21:39:04,789 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/548489a70/eaf1048f9c394e138e32a3876dd8dac6
[2024-03-11 21:39:04,792 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 21:39:04,794 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 21:39:04,796 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 21:39:04,796 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 21:39:04,814 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 21:39:04,815 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 09:39:04" (1/1) ...
[2024-03-11 21:39:04,817 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55728e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:04, skipping insertion in model container
[2024-03-11 21:39:04,817 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 09:39:04" (1/1) ...
[2024-03-11 21:39:04,826 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 21:39:04,859 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 21:39:04,973 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 21:39:05,111 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 21:39:05,116 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 21:39:05,126 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 21:39:05,148 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 21:39:05,185 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 21:39:05,186 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05 WrapperNode
[2024-03-11 21:39:05,186 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 21:39:05,187 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 21:39:05,187 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 21:39:05,187 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 21:39:05,192 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,212 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,231 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2024-03-11 21:39:05,232 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 21:39:05,232 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 21:39:05,233 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 21:39:05,233 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 21:39:05,239 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,240 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,243 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,243 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,251 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,253 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,255 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,256 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,258 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 21:39:05,259 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 21:39:05,259 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 21:39:05,259 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 21:39:05,260 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (1/1) ...
[2024-03-11 21:39:05,265 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 21:39:05,273 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 21:39:05,287 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 21:39:05,290 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 21:39:05,309 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 21:39:05,309 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 21:39:05,309 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 21:39:05,310 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 21:39:05,310 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 21:39:05,310 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 21:39:05,310 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 21:39:05,310 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 21:39:05,310 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 21:39:05,310 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 21:39:05,310 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 21:39:05,311 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 21:39:05,450 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 21:39:05,451 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 21:39:05,639 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 21:39:05,645 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 21:39:05,645 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 21:39:05,647 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 09:39:05 BoogieIcfgContainer
[2024-03-11 21:39:05,647 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 21:39:05,648 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 21:39:05,648 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 21:39:05,651 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 21:39:05,651 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 09:39:04" (1/3) ...
[2024-03-11 21:39:05,651 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7372a18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 09:39:05, skipping insertion in model container
[2024-03-11 21:39:05,651 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 09:39:05" (2/3) ...
[2024-03-11 21:39:05,652 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7372a18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 09:39:05, skipping insertion in model container
[2024-03-11 21:39:05,652 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 09:39:05" (3/3) ...
[2024-03-11 21:39:05,653 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i
[2024-03-11 21:39:05,658 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 21:39:05,665 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 21:39:05,665 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-03-11 21:39:05,666 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 21:39:05,705 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 21:39:05,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2024-03-11 21:39:05,775 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2024-03-11 21:39:05,775 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 21:39:05,779 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 338 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2024-03-11 21:39:05,779 INFO  L82        GeneralOperation]: Start removeDead. Operand has 115 places, 116 transitions, 240 flow
[2024-03-11 21:39:05,783 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 115 places, 116 transitions, 240 flow
[2024-03-11 21:39:05,785 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 21:39:05,792 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 116 transitions, 240 flow
[2024-03-11 21:39:05,794 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 116 transitions, 240 flow
[2024-03-11 21:39:05,794 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2024-03-11 21:39:05,819 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2024-03-11 21:39:05,819 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 21:39:05,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 338 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2024-03-11 21:39:05,821 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2166
[2024-03-11 21:39:08,242 INFO  L134        LiptonReduction]: Checked pairs total: 12504
[2024-03-11 21:39:08,243 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2024-03-11 21:39:08,258 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 21:39:08,263 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;@7ebbf727, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 21:39:08,263 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-11 21:39:08,264 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2024-03-11 21:39:08,264 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 21:39:08,264 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:08,265 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-11 21:39:08,265 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-11 21:39:08,268 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:08,269 INFO  L85        PathProgramCache]: Analyzing trace with hash 384, now seen corresponding path program 1 times
[2024-03-11 21:39:08,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:08,275 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937998511]
[2024-03-11 21:39:08,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:08,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:08,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:08,349 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 21:39:08,350 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:08,350 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937998511]
[2024-03-11 21:39:08,350 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937998511] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:08,350 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:08,351 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-11 21:39:08,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673365205]
[2024-03-11 21:39:08,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:08,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 21:39:08,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:08,372 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 21:39:08,373 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 21:39:08,374 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 194
[2024-03-11 21:39:08,376 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 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 21:39:08,376 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:08,376 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 194
[2024-03-11 21:39:08,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:08,434 INFO  L130       PetriNetUnfolder]: 33/213 cut-off events.
[2024-03-11 21:39:08,434 INFO  L131       PetriNetUnfolder]: For 7/10 co-relation queries the response was YES.
[2024-03-11 21:39:08,435 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 213 events. 33/213 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1010 event pairs, 32 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 250. Up to 88 conditions per place. 
[2024-03-11 21:39:08,436 INFO  L137   encePairwiseOnDemand]: 193/194 looper letters, 16 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2024-03-11 21:39:08,436 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 138 flow
[2024-03-11 21:39:08,437 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 21:39:08,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 21:39:08,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions.
[2024-03-11 21:39:08,447 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.615979381443299
[2024-03-11 21:39:08,447 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 239 transitions.
[2024-03-11 21:39:08,447 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 239 transitions.
[2024-03-11 21:39:08,448 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:08,450 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 239 transitions.
[2024-03-11 21:39:08,452 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 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 21:39:08,456 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 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 21:39:08,456 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 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 21:39:08,457 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 239 transitions.
[2024-03-11 21:39:08,458 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 138 flow
[2024-03-11 21:39:08,460 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:08,461 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2024-03-11 21:39:08,463 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=49}
[2024-03-11 21:39:08,466 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2024-03-11 21:39:08,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2024-03-11 21:39:08,466 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 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 21:39:08,466 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:08,466 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:08,467 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 21:39:08,467 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-11 21:39:08,467 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:08,467 INFO  L85        PathProgramCache]: Analyzing trace with hash 1913299805, now seen corresponding path program 1 times
[2024-03-11 21:39:08,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:08,468 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749208611]
[2024-03-11 21:39:08,468 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:08,468 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:08,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:08,802 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 21:39:08,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:08,802 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749208611]
[2024-03-11 21:39:08,802 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749208611] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:08,802 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:08,803 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 21:39:08,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088160048]
[2024-03-11 21:39:08,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:08,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 21:39:08,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:08,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 21:39:08,805 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 21:39:09,003 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 194
[2024-03-11 21:39:09,003 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 21:39:09,004 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:09,004 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 194
[2024-03-11 21:39:09,004 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:09,162 INFO  L130       PetriNetUnfolder]: 245/703 cut-off events.
[2024-03-11 21:39:09,163 INFO  L131       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2024-03-11 21:39:09,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 703 events. 245/703 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4013 event pairs, 86 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 1296. Up to 291 conditions per place. 
[2024-03-11 21:39:09,167 INFO  L137   encePairwiseOnDemand]: 171/194 looper letters, 61 selfloop transitions, 29 changer transitions 0/102 dead transitions.
[2024-03-11 21:39:09,167 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 395 flow
[2024-03-11 21:39:09,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 21:39:09,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 21:39:09,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 609 transitions.
[2024-03-11 21:39:09,171 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5231958762886598
[2024-03-11 21:39:09,171 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 609 transitions.
[2024-03-11 21:39:09,171 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 609 transitions.
[2024-03-11 21:39:09,172 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:09,172 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 609 transitions.
[2024-03-11 21:39:09,175 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 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 21:39:09,178 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 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 21:39:09,178 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 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 21:39:09,178 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 609 transitions.
[2024-03-11 21:39:09,178 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 395 flow
[2024-03-11 21:39:09,180 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:09,181 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2024-03-11 21:39:09,181 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=78}
[2024-03-11 21:39:09,182 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2024-03-11 21:39:09,182 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2024-03-11 21:39:09,182 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 21:39:09,182 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:09,182 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:09,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 21:39:09,183 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-11 21:39:09,183 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:09,183 INFO  L85        PathProgramCache]: Analyzing trace with hash 109715366, now seen corresponding path program 1 times
[2024-03-11 21:39:09,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:09,183 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774705983]
[2024-03-11 21:39:09,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:09,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:09,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:09,209 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 21:39:09,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:09,210 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774705983]
[2024-03-11 21:39:09,210 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774705983] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:09,210 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:09,210 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 21:39:09,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930499431]
[2024-03-11 21:39:09,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:09,210 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 21:39:09,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:09,211 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 21:39:09,211 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 21:39:09,221 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 194
[2024-03-11 21:39:09,222 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 21:39:09,222 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:09,222 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 194
[2024-03-11 21:39:09,222 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:09,290 INFO  L130       PetriNetUnfolder]: 122/485 cut-off events.
[2024-03-11 21:39:09,291 INFO  L131       PetriNetUnfolder]: For 113/118 co-relation queries the response was YES.
[2024-03-11 21:39:09,292 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 485 events. 122/485 cut-off events. For 113/118 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2716 event pairs, 10 based on Foata normal form. 11/468 useless extension candidates. Maximal degree in co-relation 1076. Up to 129 conditions per place. 
[2024-03-11 21:39:09,294 INFO  L137   encePairwiseOnDemand]: 190/194 looper letters, 24 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2024-03-11 21:39:09,294 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 392 flow
[2024-03-11 21:39:09,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 21:39:09,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 21:39:09,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions.
[2024-03-11 21:39:09,295 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5807560137457045
[2024-03-11 21:39:09,295 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 338 transitions.
[2024-03-11 21:39:09,295 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions.
[2024-03-11 21:39:09,295 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:09,296 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions.
[2024-03-11 21:39:09,296 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 21:39:09,298 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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 21:39:09,298 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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 21:39:09,298 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 338 transitions.
[2024-03-11 21:39:09,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 392 flow
[2024-03-11 21:39:09,301 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:09,302 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2024-03-11 21:39:09,303 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=78}
[2024-03-11 21:39:09,303 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2024-03-11 21:39:09,303 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2024-03-11 21:39:09,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 21:39:09,304 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:09,304 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:09,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 21:39:09,304 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-11 21:39:09,304 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:09,304 INFO  L85        PathProgramCache]: Analyzing trace with hash 377180626, now seen corresponding path program 1 times
[2024-03-11 21:39:09,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:09,305 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112508887]
[2024-03-11 21:39:09,305 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:09,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:09,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:09,496 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 21:39:09,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:09,496 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112508887]
[2024-03-11 21:39:09,496 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112508887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:09,496 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:09,496 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 21:39:09,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772362636]
[2024-03-11 21:39:09,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:09,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 21:39:09,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:09,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 21:39:09,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 21:39:09,730 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 194
[2024-03-11 21:39:09,730 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 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 21:39:09,730 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:09,731 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 194
[2024-03-11 21:39:09,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:09,873 INFO  L130       PetriNetUnfolder]: 228/665 cut-off events.
[2024-03-11 21:39:09,873 INFO  L131       PetriNetUnfolder]: For 293/299 co-relation queries the response was YES.
[2024-03-11 21:39:09,874 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 665 events. 228/665 cut-off events. For 293/299 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3546 event pairs, 57 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 1716. Up to 360 conditions per place. 
[2024-03-11 21:39:09,876 INFO  L137   encePairwiseOnDemand]: 183/194 looper letters, 52 selfloop transitions, 33 changer transitions 8/128 dead transitions.
[2024-03-11 21:39:09,876 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 725 flow
[2024-03-11 21:39:09,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 21:39:09,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 21:39:09,878 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-11 21:39:09,878 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5506872852233677
[2024-03-11 21:39:09,878 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-11 21:39:09,878 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-11 21:39:09,878 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:09,878 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-11 21:39:09,880 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 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 21:39:09,881 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 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 21:39:09,882 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 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 21:39:09,882 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 641 transitions.
[2024-03-11 21:39:09,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 725 flow
[2024-03-11 21:39:09,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:09,886 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2024-03-11 21:39:09,886 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=108}
[2024-03-11 21:39:09,887 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2024-03-11 21:39:09,887 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2024-03-11 21:39:09,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 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 21:39:09,888 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:09,888 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:09,888 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 21:39:09,888 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-11 21:39:09,888 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:09,888 INFO  L85        PathProgramCache]: Analyzing trace with hash -55836617, now seen corresponding path program 1 times
[2024-03-11 21:39:09,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:09,889 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986903056]
[2024-03-11 21:39:09,889 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:09,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:09,905 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:10,107 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 21:39:10,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:10,108 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986903056]
[2024-03-11 21:39:10,108 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986903056] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:10,108 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:10,108 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 21:39:10,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347798481]
[2024-03-11 21:39:10,108 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:10,108 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 21:39:10,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:10,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 21:39:10,109 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 21:39:10,228 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 194
[2024-03-11 21:39:10,229 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 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 21:39:10,229 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:10,229 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 194
[2024-03-11 21:39:10,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:10,579 INFO  L130       PetriNetUnfolder]: 402/1014 cut-off events.
[2024-03-11 21:39:10,579 INFO  L131       PetriNetUnfolder]: For 764/772 co-relation queries the response was YES.
[2024-03-11 21:39:10,581 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1014 events. 402/1014 cut-off events. For 764/772 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6004 event pairs, 103 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 3282. Up to 729 conditions per place. 
[2024-03-11 21:39:10,584 INFO  L137   encePairwiseOnDemand]: 172/194 looper letters, 105 selfloop transitions, 76 changer transitions 24/218 dead transitions.
[2024-03-11 21:39:10,584 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 218 transitions, 1523 flow
[2024-03-11 21:39:10,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 21:39:10,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 21:39:10,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions.
[2024-03-11 21:39:10,587 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5446735395189003
[2024-03-11 21:39:10,587 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 634 transitions.
[2024-03-11 21:39:10,587 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions.
[2024-03-11 21:39:10,587 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:10,588 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions.
[2024-03-11 21:39:10,589 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 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 21:39:10,590 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 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 21:39:10,591 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 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 21:39:10,591 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 634 transitions.
[2024-03-11 21:39:10,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 218 transitions, 1523 flow
[2024-03-11 21:39:10,595 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 218 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:10,598 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2024-03-11 21:39:10,598 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=81, PETRI_TRANSITIONS=174}
[2024-03-11 21:39:10,598 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2024-03-11 21:39:10,599 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2024-03-11 21:39:10,599 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 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 21:39:10,599 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:10,599 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-11 21:39:10,599 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 21:39:10,599 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-11 21:39:10,600 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:10,600 INFO  L85        PathProgramCache]: Analyzing trace with hash 1003106096, now seen corresponding path program 1 times
[2024-03-11 21:39:10,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:10,600 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250941863]
[2024-03-11 21:39:10,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:10,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:10,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 21:39:10,623 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 21:39:10,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 21:39:10,648 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 21:39:10,649 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 21:39:10,650 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-03-11 21:39:10,651 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-03-11 21:39:10,651 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-03-11 21:39:10,651 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-03-11 21:39:10,651 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-03-11 21:39:10,651 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-03-11 21:39:10,652 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-03-11 21:39:10,652 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-03-11 21:39:10,652 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-03-11 21:39:10,652 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-03-11 21:39:10,652 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-03-11 21:39:10,652 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 21:39:10,652 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:10,654 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 21:39:10,654 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 21:39:10,671 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 21:39:10,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2024-03-11 21:39:10,701 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2024-03-11 21:39:10,702 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 21:39:10,702 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 725 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2024-03-11 21:39:10,702 INFO  L82        GeneralOperation]: Start removeDead. Operand has 137 places, 137 transitions, 292 flow
[2024-03-11 21:39:10,703 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 137 places, 137 transitions, 292 flow
[2024-03-11 21:39:10,703 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 21:39:10,703 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 137 transitions, 292 flow
[2024-03-11 21:39:10,703 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 137 transitions, 292 flow
[2024-03-11 21:39:10,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2024-03-11 21:39:10,720 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2024-03-11 21:39:10,721 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 21:39:10,721 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 725 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2024-03-11 21:39:10,724 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5548
[2024-03-11 21:39:13,270 INFO  L134        LiptonReduction]: Checked pairs total: 27446
[2024-03-11 21:39:13,270 INFO  L136        LiptonReduction]: Total number of compositions: 83
[2024-03-11 21:39:13,272 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 21:39:13,273 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;@7ebbf727, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 21:39:13,273 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2024-03-11 21:39:13,274 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-03-11 21:39:13,274 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 21:39:13,274 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:13,274 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-11 21:39:13,274 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:13,274 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:13,274 INFO  L85        PathProgramCache]: Analyzing trace with hash 624, now seen corresponding path program 1 times
[2024-03-11 21:39:13,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:13,275 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763886682]
[2024-03-11 21:39:13,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:13,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:13,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:13,278 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 21:39:13,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:13,278 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763886682]
[2024-03-11 21:39:13,279 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763886682] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:13,279 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:13,279 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-11 21:39:13,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85911945]
[2024-03-11 21:39:13,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:13,279 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 21:39:13,279 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:13,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 21:39:13,280 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 21:39:13,280 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 220
[2024-03-11 21:39:13,280 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 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 21:39:13,280 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:13,280 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 220
[2024-03-11 21:39:13,280 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:13,376 INFO  L130       PetriNetUnfolder]: 411/1257 cut-off events.
[2024-03-11 21:39:13,376 INFO  L131       PetriNetUnfolder]: For 71/158 co-relation queries the response was YES.
[2024-03-11 21:39:13,377 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1257 events. 411/1257 cut-off events. For 71/158 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8130 event pairs, 404 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1664. Up to 731 conditions per place. 
[2024-03-11 21:39:13,390 INFO  L137   encePairwiseOnDemand]: 219/220 looper letters, 22 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2024-03-11 21:39:13,391 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 188 flow
[2024-03-11 21:39:13,391 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 21:39:13,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 21:39:13,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 283 transitions.
[2024-03-11 21:39:13,392 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6431818181818182
[2024-03-11 21:39:13,392 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 283 transitions.
[2024-03-11 21:39:13,392 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 283 transitions.
[2024-03-11 21:39:13,393 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:13,393 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 283 transitions.
[2024-03-11 21:39:13,393 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 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 21:39:13,394 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 21:39:13,394 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 21:39:13,394 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 283 transitions.
[2024-03-11 21:39:13,394 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 188 flow
[2024-03-11 21:39:13,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:13,396 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2024-03-11 21:39:13,396 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2024-03-11 21:39:13,396 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2024-03-11 21:39:13,396 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2024-03-11 21:39:13,397 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 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 21:39:13,397 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:13,397 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:13,397 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 21:39:13,397 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:13,397 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:13,397 INFO  L85        PathProgramCache]: Analyzing trace with hash 455692181, now seen corresponding path program 1 times
[2024-03-11 21:39:13,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:13,397 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685753793]
[2024-03-11 21:39:13,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:13,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:13,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:13,522 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 21:39:13,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:13,522 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685753793]
[2024-03-11 21:39:13,523 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685753793] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:13,523 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:13,523 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 21:39:13,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310040874]
[2024-03-11 21:39:13,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:13,523 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 21:39:13,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:13,523 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 21:39:13,524 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 21:39:13,683 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 220
[2024-03-11 21:39:13,684 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 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 21:39:13,684 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:13,684 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 220
[2024-03-11 21:39:13,684 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:14,609 INFO  L130       PetriNetUnfolder]: 5742/10965 cut-off events.
[2024-03-11 21:39:14,610 INFO  L131       PetriNetUnfolder]: For 239/274 co-relation queries the response was YES.
[2024-03-11 21:39:14,617 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20646 conditions, 10965 events. 5742/10965 cut-off events. For 239/274 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 81992 event pairs, 1527 based on Foata normal form. 16/10302 useless extension candidates. Maximal degree in co-relation 20641. Up to 5895 conditions per place. 
[2024-03-11 21:39:14,650 INFO  L137   encePairwiseOnDemand]: 193/220 looper letters, 93 selfloop transitions, 48 changer transitions 0/158 dead transitions.
[2024-03-11 21:39:14,650 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 158 transitions, 627 flow
[2024-03-11 21:39:14,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 21:39:14,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 21:39:14,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions.
[2024-03-11 21:39:14,653 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5681818181818182
[2024-03-11 21:39:14,653 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 750 transitions.
[2024-03-11 21:39:14,653 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions.
[2024-03-11 21:39:14,654 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:14,654 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions.
[2024-03-11 21:39:14,655 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 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 21:39:14,657 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 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 21:39:14,658 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 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 21:39:14,658 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 750 transitions.
[2024-03-11 21:39:14,658 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 158 transitions, 627 flow
[2024-03-11 21:39:14,659 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:14,661 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2024-03-11 21:39:14,661 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2024-03-11 21:39:14,662 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2024-03-11 21:39:14,662 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2024-03-11 21:39:14,662 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 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 21:39:14,662 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:14,663 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:14,663 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-11 21:39:14,663 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:14,663 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:14,663 INFO  L85        PathProgramCache]: Analyzing trace with hash 1684042827, now seen corresponding path program 1 times
[2024-03-11 21:39:14,663 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:14,663 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586428569]
[2024-03-11 21:39:14,663 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:14,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:14,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:14,713 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 21:39:14,714 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:14,714 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586428569]
[2024-03-11 21:39:14,714 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586428569] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:14,714 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:14,714 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 21:39:14,714 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915646943]
[2024-03-11 21:39:14,714 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:14,715 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 21:39:14,715 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:14,715 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 21:39:14,716 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 21:39:14,730 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 220
[2024-03-11 21:39:14,730 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 21:39:14,730 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:14,731 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 220
[2024-03-11 21:39:14,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:15,153 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([575] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_69| v_~datas~0.base_71)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_37 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_63))) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_63 1))) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_63))) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= (select .cse0 (+ .cse1 3 v_~datas~0.offset_63)) |v_threadThread1of2ForFork0_#t~nondet4_28|) (= |v_threadThread1of2ForFork0_#res.base_9| 0)))  InVars {#race=|v_#race_69|, ~datas~0.base=v_~datas~0.base_71, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_28|, ~datas~0.offset=v_~datas~0.offset_63}  OutVars{#race=|v_#race_69|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_15|, ~datas~0.base=v_~datas~0.base_71, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, ~datas~0.offset=v_~datas~0.offset_63}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [140#true, 20#L1016-4true, 143#true, 2#ULTIMATE.startEXITtrue, Black: 146#(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: 147#(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)), 157#(= |#race~datas~0| 0), threadThread1of2ForFork0InUse, Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 46#threadEXITtrue, Black: 148#(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)), threadThread2of2ForFork0InUse])
[2024-03-11 21:39:15,153 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-03-11 21:39:15,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-11 21:39:15,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-11 21:39:15,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-11 21:39:15,154 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L1016-4-->L1016-6: Formula: (= (store |v_#race_60| v_~datas~0.base_57 (store (select |v_#race_60| v_~datas~0.base_57) (+ v_~datas~0.offset_51 (* v_threadThread2of2ForFork0_~i~0_23 4)) |v_threadThread2of2ForFork0_#t~nondet4_21|)) |v_#race_59|)  InVars {#race=|v_#race_60|, ~datas~0.base=v_~datas~0.base_57, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_23}  OutVars{#race=|v_#race_59|, ~datas~0.base=v_~datas~0.base_57, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_21|, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [140#true, 2#ULTIMATE.startEXITtrue, 143#true, Black: 146#(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: 147#(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)), threadThread1of2ForFork0InUse, 63#L1016-9true, 157#(= |#race~datas~0| 0), Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 148#(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)), threadThread2of2ForFork0InUse, 125#L1016-6true])
[2024-03-11 21:39:15,154 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-03-11 21:39:15,154 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-11 21:39:15,154 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-11 21:39:15,154 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-11 21:39:15,255 INFO  L130       PetriNetUnfolder]: 2751/6464 cut-off events.
[2024-03-11 21:39:15,255 INFO  L131       PetriNetUnfolder]: For 2099/2651 co-relation queries the response was YES.
[2024-03-11 21:39:15,264 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14862 conditions, 6464 events. 2751/6464 cut-off events. For 2099/2651 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53226 event pairs, 926 based on Foata normal form. 125/6165 useless extension candidates. Maximal degree in co-relation 14852. Up to 2371 conditions per place. 
[2024-03-11 21:39:15,282 INFO  L137   encePairwiseOnDemand]: 214/220 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2024-03-11 21:39:15,282 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2024-03-11 21:39:15,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 21:39:15,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 21:39:15,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2024-03-11 21:39:15,283 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-03-11 21:39:15,283 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 396 transitions.
[2024-03-11 21:39:15,283 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions.
[2024-03-11 21:39:15,283 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:15,284 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions.
[2024-03-11 21:39:15,284 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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 21:39:15,285 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 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 21:39:15,285 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 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 21:39:15,285 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 396 transitions.
[2024-03-11 21:39:15,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2024-03-11 21:39:15,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:15,296 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2024-03-11 21:39:15,296 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2024-03-11 21:39:15,297 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2024-03-11 21:39:15,297 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2024-03-11 21:39:15,297 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 21:39:15,297 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:15,297 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:15,297 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-11 21:39:15,298 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:15,298 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:15,298 INFO  L85        PathProgramCache]: Analyzing trace with hash 546192249, now seen corresponding path program 1 times
[2024-03-11 21:39:15,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:15,298 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743388876]
[2024-03-11 21:39:15,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:15,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:15,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:15,436 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 21:39:15,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:15,436 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743388876]
[2024-03-11 21:39:15,436 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743388876] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:15,437 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:15,437 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 21:39:15,437 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938275592]
[2024-03-11 21:39:15,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:15,437 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 21:39:15,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:15,437 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 21:39:15,437 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 21:39:15,675 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 220
[2024-03-11 21:39:15,675 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 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 21:39:15,675 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:15,675 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 220
[2024-03-11 21:39:15,675 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:16,816 INFO  L130       PetriNetUnfolder]: 5675/10752 cut-off events.
[2024-03-11 21:39:16,817 INFO  L131       PetriNetUnfolder]: For 6547/6645 co-relation queries the response was YES.
[2024-03-11 21:39:16,831 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28674 conditions, 10752 events. 5675/10752 cut-off events. For 6547/6645 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 79188 event pairs, 1877 based on Foata normal form. 0/10233 useless extension candidates. Maximal degree in co-relation 28663. Up to 6983 conditions per place. 
[2024-03-11 21:39:16,856 INFO  L137   encePairwiseOnDemand]: 205/220 looper letters, 110 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2024-03-11 21:39:16,857 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1313 flow
[2024-03-11 21:39:16,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 21:39:16,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 21:39:16,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions.
[2024-03-11 21:39:16,859 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2024-03-11 21:39:16,859 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 770 transitions.
[2024-03-11 21:39:16,859 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions.
[2024-03-11 21:39:16,859 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:16,859 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions.
[2024-03-11 21:39:16,861 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 21:39:16,862 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 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 21:39:16,862 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 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 21:39:16,862 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 770 transitions.
[2024-03-11 21:39:16,863 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1313 flow
[2024-03-11 21:39:16,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:16,872 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2024-03-11 21:39:16,872 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=87, PETRI_TRANSITIONS=180}
[2024-03-11 21:39:16,872 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2024-03-11 21:39:16,872 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2024-03-11 21:39:16,873 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 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 21:39:16,873 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:16,873 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:16,873 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-11 21:39:16,873 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:16,873 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:16,873 INFO  L85        PathProgramCache]: Analyzing trace with hash -1368584717, now seen corresponding path program 1 times
[2024-03-11 21:39:16,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:16,873 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210957978]
[2024-03-11 21:39:16,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:16,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:16,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:17,040 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 21:39:17,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:17,040 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210957978]
[2024-03-11 21:39:17,040 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210957978] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:17,040 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:17,041 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 21:39:17,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738733335]
[2024-03-11 21:39:17,041 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:17,041 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 21:39:17,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:17,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 21:39:17,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 21:39:17,246 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220
[2024-03-11 21:39:17,246 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 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 21:39:17,246 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:17,247 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220
[2024-03-11 21:39:17,247 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:19,532 INFO  L130       PetriNetUnfolder]: 11355/20109 cut-off events.
[2024-03-11 21:39:19,532 INFO  L131       PetriNetUnfolder]: For 18621/18782 co-relation queries the response was YES.
[2024-03-11 21:39:19,571 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64116 conditions, 20109 events. 11355/20109 cut-off events. For 18621/18782 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 151317 event pairs, 3272 based on Foata normal form. 0/18814 useless extension candidates. Maximal degree in co-relation 64100. Up to 13848 conditions per place. 
[2024-03-11 21:39:19,630 INFO  L137   encePairwiseOnDemand]: 194/220 looper letters, 239 selfloop transitions, 132 changer transitions 0/389 dead transitions.
[2024-03-11 21:39:19,630 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 389 transitions, 2939 flow
[2024-03-11 21:39:19,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 21:39:19,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 21:39:19,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions.
[2024-03-11 21:39:19,632 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.593939393939394
[2024-03-11 21:39:19,632 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 784 transitions.
[2024-03-11 21:39:19,632 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 784 transitions.
[2024-03-11 21:39:19,633 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:19,633 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 784 transitions.
[2024-03-11 21:39:19,634 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 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 21:39:19,636 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 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 21:39:19,636 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 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 21:39:19,636 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 784 transitions.
[2024-03-11 21:39:19,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 389 transitions, 2939 flow
[2024-03-11 21:39:19,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 389 transitions, 2939 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:19,667 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2024-03-11 21:39:19,668 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2326, PETRI_PLACES=96, PETRI_TRANSITIONS=302}
[2024-03-11 21:39:19,668 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2024-03-11 21:39:19,668 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2024-03-11 21:39:19,669 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 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 21:39:19,669 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:19,669 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:19,669 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-11 21:39:19,669 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:19,669 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:19,669 INFO  L85        PathProgramCache]: Analyzing trace with hash -1735763816, now seen corresponding path program 1 times
[2024-03-11 21:39:19,669 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:19,669 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950822386]
[2024-03-11 21:39:19,669 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:19,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:19,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:19,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 21:39:19,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:19,917 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950822386]
[2024-03-11 21:39:19,918 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950822386] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 21:39:19,918 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229225658]
[2024-03-11 21:39:19,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:19,918 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:39:19,918 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 21:39:19,922 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 21:39:19,994 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 21:39:20,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:20,090 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2024-03-11 21:39:20,094 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 21:39:20,220 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 21:39:20,244 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:39:20,245 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 21:39:20,272 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:39:20,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:39:20,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 21:39:20,316 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:39:20,317 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:39:20,318 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:39:20,319 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 21:39:20,359 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:39:20,360 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 21:39:20,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 21:39:20,387 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 21:39:20,418 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-11 21:39:20,441 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_318 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-03-11 21:39:20,467 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_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-03-11 21:39:20,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2024-03-11 21:39:20,525 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [229225658] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 21:39:20,525 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 21:39:20,525 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15
[2024-03-11 21:39:20,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245077894]
[2024-03-11 21:39:20,526 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 21:39:20,526 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-03-11 21:39:20,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:20,527 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-03-11 21:39:20,527 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=121, Unknown=3, NotChecked=78, Total=272
[2024-03-11 21:39:20,632 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 220
[2024-03-11 21:39:20,633 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 17 states, 17 states have (on average 83.3529411764706) internal successors, (1417), 17 states have internal predecessors, (1417), 0 states have call successors, (0), 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 21:39:20,633 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:20,634 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 220
[2024-03-11 21:39:20,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:23,293 INFO  L130       PetriNetUnfolder]: 13999/23442 cut-off events.
[2024-03-11 21:39:23,293 INFO  L131       PetriNetUnfolder]: For 44014/44014 co-relation queries the response was YES.
[2024-03-11 21:39:23,363 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90855 conditions, 23442 events. 13999/23442 cut-off events. For 44014/44014 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 166306 event pairs, 5754 based on Foata normal form. 498/22445 useless extension candidates. Maximal degree in co-relation 90834. Up to 21949 conditions per place. 
[2024-03-11 21:39:23,452 INFO  L137   encePairwiseOnDemand]: 203/220 looper letters, 325 selfloop transitions, 7 changer transitions 11/350 dead transitions.
[2024-03-11 21:39:23,452 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 350 transitions, 3333 flow
[2024-03-11 21:39:23,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 21:39:23,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 21:39:23,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 654 transitions.
[2024-03-11 21:39:23,456 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.42467532467532465
[2024-03-11 21:39:23,456 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 654 transitions.
[2024-03-11 21:39:23,456 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 654 transitions.
[2024-03-11 21:39:23,457 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:23,457 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 654 transitions.
[2024-03-11 21:39:23,458 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 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 21:39:23,460 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 21:39:23,460 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 21:39:23,460 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 654 transitions.
[2024-03-11 21:39:23,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 350 transitions, 3333 flow
[2024-03-11 21:39:23,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 350 transitions, 3237 flow, removed 48 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:23,775 INFO  L231             Difference]: Finished difference. Result has 103 places, 303 transitions, 2290 flow
[2024-03-11 21:39:23,776 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2290, PETRI_PLACES=103, PETRI_TRANSITIONS=303}
[2024-03-11 21:39:23,776 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 36 predicate places.
[2024-03-11 21:39:23,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 303 transitions, 2290 flow
[2024-03-11 21:39:23,777 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 83.3529411764706) internal successors, (1417), 17 states have internal predecessors, (1417), 0 states have call successors, (0), 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 21:39:23,777 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:23,777 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:23,790 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 21:39:23,981 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-03-11 21:39:23,982 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:23,982 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:23,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -2081569429, now seen corresponding path program 1 times
[2024-03-11 21:39:23,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:23,983 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172747401]
[2024-03-11 21:39:23,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:23,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:24,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:24,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 21:39:24,260 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:24,260 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172747401]
[2024-03-11 21:39:24,260 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172747401] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:24,260 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:24,260 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-03-11 21:39:24,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056035938]
[2024-03-11 21:39:24,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:24,260 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-11 21:39:24,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:24,261 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-11 21:39:24,261 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-03-11 21:39:24,522 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 220
[2024-03-11 21:39:24,523 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 303 transitions, 2290 flow. Second operand  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 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 21:39:24,523 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:24,523 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 220
[2024-03-11 21:39:24,523 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:27,682 INFO  L130       PetriNetUnfolder]: 13786/24057 cut-off events.
[2024-03-11 21:39:27,682 INFO  L131       PetriNetUnfolder]: For 44038/44107 co-relation queries the response was YES.
[2024-03-11 21:39:27,739 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95209 conditions, 24057 events. 13786/24057 cut-off events. For 44038/44107 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 184197 event pairs, 3653 based on Foata normal form. 354/23937 useless extension candidates. Maximal degree in co-relation 95183. Up to 11376 conditions per place. 
[2024-03-11 21:39:27,808 INFO  L137   encePairwiseOnDemand]: 204/220 looper letters, 454 selfloop transitions, 166 changer transitions 1/636 dead transitions.
[2024-03-11 21:39:27,809 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 636 transitions, 5725 flow
[2024-03-11 21:39:27,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-11 21:39:27,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-11 21:39:27,811 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 981 transitions.
[2024-03-11 21:39:27,811 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5573863636363636
[2024-03-11 21:39:27,811 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 981 transitions.
[2024-03-11 21:39:27,811 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 981 transitions.
[2024-03-11 21:39:27,812 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:27,812 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 981 transitions.
[2024-03-11 21:39:27,814 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 122.625) internal successors, (981), 8 states have internal predecessors, (981), 0 states have call successors, (0), 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 21:39:27,815 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 0 states have call successors, (0), 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 21:39:27,816 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 0 states have call successors, (0), 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 21:39:27,816 INFO  L175             Difference]: Start difference. First operand has 103 places, 303 transitions, 2290 flow. Second operand 8 states and 981 transitions.
[2024-03-11 21:39:27,816 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 636 transitions, 5725 flow
[2024-03-11 21:39:28,095 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 636 transitions, 5641 flow, removed 31 selfloop flow, removed 2 redundant places.
[2024-03-11 21:39:28,100 INFO  L231             Difference]: Finished difference. Result has 114 places, 420 transitions, 3916 flow
[2024-03-11 21:39:28,101 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3916, PETRI_PLACES=114, PETRI_TRANSITIONS=420}
[2024-03-11 21:39:28,101 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 47 predicate places.
[2024-03-11 21:39:28,101 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 420 transitions, 3916 flow
[2024-03-11 21:39:28,102 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 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 21:39:28,102 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:28,102 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:39:28,102 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-11 21:39:28,102 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:28,102 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:28,102 INFO  L85        PathProgramCache]: Analyzing trace with hash 1215917229, now seen corresponding path program 1 times
[2024-03-11 21:39:28,102 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:28,102 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118075524]
[2024-03-11 21:39:28,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:28,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:28,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:28,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-03-11 21:39:28,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:28,292 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118075524]
[2024-03-11 21:39:28,292 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118075524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:28,292 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:39:28,292 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 21:39:28,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279935530]
[2024-03-11 21:39:28,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:28,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 21:39:28,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:28,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 21:39:28,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 21:39:28,440 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220
[2024-03-11 21:39:28,441 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 420 transitions, 3916 flow. Second operand  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 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 21:39:28,442 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:28,442 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220
[2024-03-11 21:39:28,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:33,075 INFO  L130       PetriNetUnfolder]: 18158/31406 cut-off events.
[2024-03-11 21:39:33,075 INFO  L131       PetriNetUnfolder]: For 123674/124225 co-relation queries the response was YES.
[2024-03-11 21:39:33,177 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 146145 conditions, 31406 events. 18158/31406 cut-off events. For 123674/124225 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 247090 event pairs, 4204 based on Foata normal form. 54/29250 useless extension candidates. Maximal degree in co-relation 146113. Up to 23999 conditions per place. 
[2024-03-11 21:39:33,280 INFO  L137   encePairwiseOnDemand]: 194/220 looper letters, 446 selfloop transitions, 164 changer transitions 1/626 dead transitions.
[2024-03-11 21:39:33,280 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 626 transitions, 6684 flow
[2024-03-11 21:39:33,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 21:39:33,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 21:39:33,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions.
[2024-03-11 21:39:33,283 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.593939393939394
[2024-03-11 21:39:33,283 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 784 transitions.
[2024-03-11 21:39:33,283 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 784 transitions.
[2024-03-11 21:39:33,283 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:33,284 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 784 transitions.
[2024-03-11 21:39:33,285 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 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 21:39:33,286 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 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 21:39:33,287 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 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 21:39:33,287 INFO  L175             Difference]: Start difference. First operand has 114 places, 420 transitions, 3916 flow. Second operand 6 states and 784 transitions.
[2024-03-11 21:39:33,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 626 transitions, 6684 flow
[2024-03-11 21:39:33,709 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 626 transitions, 6646 flow, removed 19 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:33,715 INFO  L231             Difference]: Finished difference. Result has 123 places, 535 transitions, 5508 flow
[2024-03-11 21:39:33,716 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=3878, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5508, PETRI_PLACES=123, PETRI_TRANSITIONS=535}
[2024-03-11 21:39:33,716 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 56 predicate places.
[2024-03-11 21:39:33,716 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 535 transitions, 5508 flow
[2024-03-11 21:39:33,717 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 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 21:39:33,717 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:33,717 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 21:39:33,717 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-11 21:39:33,717 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:33,717 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:33,718 INFO  L85        PathProgramCache]: Analyzing trace with hash -536985687, now seen corresponding path program 1 times
[2024-03-11 21:39:33,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:33,718 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487248352]
[2024-03-11 21:39:33,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:33,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:33,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:33,787 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 21:39:33,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:33,787 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487248352]
[2024-03-11 21:39:33,788 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487248352] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 21:39:33,788 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835665023]
[2024-03-11 21:39:33,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:33,788 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:39:33,788 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 21:39:33,789 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 21:39:33,794 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 21:39:33,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:33,926 INFO  L263         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-11 21:39:33,928 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 21:39:33,961 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 21:39:33,961 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 21:39:33,990 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 21:39:33,990 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [835665023] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 21:39:33,990 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 21:39:33,990 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-03-11 21:39:33,991 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503202131]
[2024-03-11 21:39:33,991 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 21:39:33,991 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-11 21:39:33,991 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:33,991 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-11 21:39:33,992 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-11 21:39:34,092 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 220
[2024-03-11 21:39:34,093 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 535 transitions, 5508 flow. Second operand  has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 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 21:39:34,093 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:34,093 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 220
[2024-03-11 21:39:34,093 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:35,187 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L1016-4-->L1016-6: Formula: (= (store |v_#race_60| v_~datas~0.base_57 (store (select |v_#race_60| v_~datas~0.base_57) (+ v_~datas~0.offset_51 (* v_threadThread2of2ForFork0_~i~0_23 4)) |v_threadThread2of2ForFork0_#t~nondet4_21|)) |v_#race_59|)  InVars {#race=|v_#race_60|, ~datas~0.base=v_~datas~0.base_57, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_23}  OutVars{#race=|v_#race_59|, ~datas~0.base=v_~datas~0.base_57, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_21|, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][109], [Black: 248#(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) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 194#(and (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 240#(and (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), threadThread1of2ForFork0InUse, 157#(= |#race~datas~0| 0), Black: 244#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), threadThread2of2ForFork0InUse, 530#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), Black: 337#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 101#L1025-8true, Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 334#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 146#(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: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 335#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 333#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 46#threadEXITtrue, Black: 148#(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: 155#true, Black: 350#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset))) (= (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread2of2ForFork0_#t~nondet4|)), Black: 349#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset)))), Black: 348#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset)))), 172#true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), 125#L1016-6true, Black: 177#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 140#true, Black: 175#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 347#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), 143#true, Black: 176#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 174#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), 332#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), 160#true])
[2024-03-11 21:39:35,187 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-03-11 21:39:35,188 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-03-11 21:39:35,188 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-03-11 21:39:35,188 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-03-11 21:39:36,213 INFO  L130       PetriNetUnfolder]: 7723/16643 cut-off events.
[2024-03-11 21:39:36,213 INFO  L131       PetriNetUnfolder]: For 78292/81894 co-relation queries the response was YES.
[2024-03-11 21:39:36,287 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80102 conditions, 16643 events. 7723/16643 cut-off events. For 78292/81894 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 148758 event pairs, 478 based on Foata normal form. 439/16712 useless extension candidates. Maximal degree in co-relation 80065. Up to 6510 conditions per place. 
[2024-03-11 21:39:36,351 INFO  L137   encePairwiseOnDemand]: 213/220 looper letters, 168 selfloop transitions, 6 changer transitions 25/600 dead transitions.
[2024-03-11 21:39:36,351 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 600 transitions, 6451 flow
[2024-03-11 21:39:36,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-11 21:39:36,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-11 21:39:36,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1012 transitions.
[2024-03-11 21:39:36,354 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.575
[2024-03-11 21:39:36,354 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1012 transitions.
[2024-03-11 21:39:36,354 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1012 transitions.
[2024-03-11 21:39:36,354 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:36,355 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1012 transitions.
[2024-03-11 21:39:36,356 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 0 states have call successors, (0), 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 21:39:36,358 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 0 states have call successors, (0), 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 21:39:36,358 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 0 states have call successors, (0), 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 21:39:36,359 INFO  L175             Difference]: Start difference. First operand has 123 places, 535 transitions, 5508 flow. Second operand 8 states and 1012 transitions.
[2024-03-11 21:39:36,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 600 transitions, 6451 flow
[2024-03-11 21:39:37,063 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 600 transitions, 6261 flow, removed 95 selfloop flow, removed 0 redundant places.
[2024-03-11 21:39:37,070 INFO  L231             Difference]: Finished difference. Result has 134 places, 492 transitions, 4903 flow
[2024-03-11 21:39:37,070 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=5011, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4903, PETRI_PLACES=134, PETRI_TRANSITIONS=492}
[2024-03-11 21:39:37,070 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 67 predicate places.
[2024-03-11 21:39:37,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 492 transitions, 4903 flow
[2024-03-11 21:39:37,071 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 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 21:39:37,071 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:37,071 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 21:39:37,079 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-03-11 21:39:37,273 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:39:37,273 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:37,274 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:37,274 INFO  L85        PathProgramCache]: Analyzing trace with hash 760508491, now seen corresponding path program 1 times
[2024-03-11 21:39:37,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:37,275 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659923592]
[2024-03-11 21:39:37,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:37,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:37,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:38,096 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 21:39:38,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:38,096 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659923592]
[2024-03-11 21:39:38,097 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659923592] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 21:39:38,097 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275305633]
[2024-03-11 21:39:38,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:38,097 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:39:38,097 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 21:39:38,098 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 21:39:38,099 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 21:39:38,260 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:38,262 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2024-03-11 21:39:38,269 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 21:39:38,288 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:39:38,294 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-11 21:39:38,295 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 44 treesize of output 36
[2024-03-11 21:39:38,432 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 21:39:38,433 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 21:39:38,466 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:39:38,467 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 21:39:38,499 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 21:39:38,533 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 21:39:38,560 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 21:39:38,598 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:39:38,598 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 21:39:38,644 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:39:38,645 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 52 treesize of output 57
[2024-03-11 21:39:38,704 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 54 treesize of output 50
[2024-03-11 21:39:38,713 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 21:39:38,713 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 21:39:38,713 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [275305633] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:38,713 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-11 21:39:38,713 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20
[2024-03-11 21:39:38,714 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985101142]
[2024-03-11 21:39:38,714 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:38,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-11 21:39:38,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:38,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-11 21:39:38,715 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462
[2024-03-11 21:39:39,196 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 220
[2024-03-11 21:39:39,198 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 492 transitions, 4903 flow. Second operand  has 10 states, 10 states have (on average 92.4) internal successors, (924), 10 states have internal predecessors, (924), 0 states have call successors, (0), 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 21:39:39,198 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:39,198 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 220
[2024-03-11 21:39:39,198 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:44,632 INFO  L130       PetriNetUnfolder]: 16068/28221 cut-off events.
[2024-03-11 21:39:44,632 INFO  L131       PetriNetUnfolder]: For 149522/149869 co-relation queries the response was YES.
[2024-03-11 21:39:44,823 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 147461 conditions, 28221 events. 16068/28221 cut-off events. For 149522/149869 co-relation queries the response was YES. Maximal size of possible extension queue 930. Compared 220862 event pairs, 2413 based on Foata normal form. 231/28250 useless extension candidates. Maximal degree in co-relation 147419. Up to 10207 conditions per place. 
[2024-03-11 21:39:45,139 INFO  L137   encePairwiseOnDemand]: 204/220 looper letters, 919 selfloop transitions, 284 changer transitions 35/1250 dead transitions.
[2024-03-11 21:39:45,140 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 1250 transitions, 15473 flow
[2024-03-11 21:39:45,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-11 21:39:45,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-11 21:39:45,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1178 transitions.
[2024-03-11 21:39:45,143 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48677685950413224
[2024-03-11 21:39:45,143 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1178 transitions.
[2024-03-11 21:39:45,143 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1178 transitions.
[2024-03-11 21:39:45,144 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:45,144 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1178 transitions.
[2024-03-11 21:39:45,146 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 107.0909090909091) internal successors, (1178), 11 states have internal predecessors, (1178), 0 states have call successors, (0), 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 21:39:45,148 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 220.0) internal successors, (2640), 12 states have internal predecessors, (2640), 0 states have call successors, (0), 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 21:39:45,149 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 220.0) internal successors, (2640), 12 states have internal predecessors, (2640), 0 states have call successors, (0), 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 21:39:45,149 INFO  L175             Difference]: Start difference. First operand has 134 places, 492 transitions, 4903 flow. Second operand 11 states and 1178 transitions.
[2024-03-11 21:39:45,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 1250 transitions, 15473 flow
[2024-03-11 21:39:45,748 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 1250 transitions, 15190 flow, removed 36 selfloop flow, removed 3 redundant places.
[2024-03-11 21:39:45,762 INFO  L231             Difference]: Finished difference. Result has 146 places, 746 transitions, 9163 flow
[2024-03-11 21:39:45,762 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=4798, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9163, PETRI_PLACES=146, PETRI_TRANSITIONS=746}
[2024-03-11 21:39:45,762 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 79 predicate places.
[2024-03-11 21:39:45,763 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 746 transitions, 9163 flow
[2024-03-11 21:39:45,763 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 92.4) internal successors, (924), 10 states have internal predecessors, (924), 0 states have call successors, (0), 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 21:39:45,763 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:45,763 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 21:39:45,770 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-11 21:39:45,964 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,SelfDestructingSolverStorable15
[2024-03-11 21:39:45,965 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:45,965 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:45,966 INFO  L85        PathProgramCache]: Analyzing trace with hash 244372249, now seen corresponding path program 2 times
[2024-03-11 21:39:45,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:45,966 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024515014]
[2024-03-11 21:39:45,967 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:45,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:45,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:46,423 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 21:39:46,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:46,424 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024515014]
[2024-03-11 21:39:46,424 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024515014] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 21:39:46,424 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197110430]
[2024-03-11 21:39:46,424 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 21:39:46,424 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:39:46,424 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 21:39:46,425 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 21:39:46,426 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 21:39:46,548 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 21:39:46,548 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 21:39:46,549 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core
[2024-03-11 21:39:46,553 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 21:39:46,561 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 18 treesize of output 16
[2024-03-11 21:39:46,667 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 21:39:46,668 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 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-11 21:39:46,701 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 21:39:46,717 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 15 treesize of output 11
[2024-03-11 21:39:46,748 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 28 treesize of output 27
[2024-03-11 21:39:46,793 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:39:46,794 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 21:39:46,897 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 21:39:46,940 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 42 treesize of output 40
[2024-03-11 21:39:46,965 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:39:46,966 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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 21:39:47,022 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 54 treesize of output 50
[2024-03-11 21:39:47,051 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 54 treesize of output 50
[2024-03-11 21:39:47,079 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 54 treesize of output 50
[2024-03-11 21:39:47,131 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 54 treesize of output 50
[2024-03-11 21:39:47,152 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 21:39:47,152 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 21:39:47,152 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197110430] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:47,152 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-11 21:39:47,153 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2024-03-11 21:39:47,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449850683]
[2024-03-11 21:39:47,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:47,153 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-03-11 21:39:47,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:47,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-03-11 21:39:47,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2024-03-11 21:39:47,838 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 220
[2024-03-11 21:39:47,839 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 746 transitions, 9163 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 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 21:39:47,840 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:47,840 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 220
[2024-03-11 21:39:47,840 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:39:55,609 INFO  L130       PetriNetUnfolder]: 17191/30263 cut-off events.
[2024-03-11 21:39:55,610 INFO  L131       PetriNetUnfolder]: For 203890/204265 co-relation queries the response was YES.
[2024-03-11 21:39:55,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172299 conditions, 30263 events. 17191/30263 cut-off events. For 203890/204265 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 239117 event pairs, 2198 based on Foata normal form. 278/30358 useless extension candidates. Maximal degree in co-relation 172252. Up to 12908 conditions per place. 
[2024-03-11 21:39:55,863 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 824 selfloop transitions, 531 changer transitions 48/1415 dead transitions.
[2024-03-11 21:39:55,864 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 1415 transitions, 18867 flow
[2024-03-11 21:39:55,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-11 21:39:55,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-11 21:39:55,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1666 transitions.
[2024-03-11 21:39:55,867 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5048484848484849
[2024-03-11 21:39:55,867 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1666 transitions.
[2024-03-11 21:39:55,867 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1666 transitions.
[2024-03-11 21:39:55,868 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:39:55,868 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1666 transitions.
[2024-03-11 21:39:55,871 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 111.06666666666666) internal successors, (1666), 15 states have internal predecessors, (1666), 0 states have call successors, (0), 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 21:39:55,874 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 220.0) internal successors, (3520), 16 states have internal predecessors, (3520), 0 states have call successors, (0), 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 21:39:55,875 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 220.0) internal successors, (3520), 16 states have internal predecessors, (3520), 0 states have call successors, (0), 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 21:39:55,875 INFO  L175             Difference]: Start difference. First operand has 146 places, 746 transitions, 9163 flow. Second operand 15 states and 1666 transitions.
[2024-03-11 21:39:55,875 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 1415 transitions, 18867 flow
[2024-03-11 21:39:56,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 1415 transitions, 18801 flow, removed 25 selfloop flow, removed 2 redundant places.
[2024-03-11 21:39:56,959 INFO  L231             Difference]: Finished difference. Result has 164 places, 994 transitions, 14214 flow
[2024-03-11 21:39:56,960 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=9122, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=293, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14214, PETRI_PLACES=164, PETRI_TRANSITIONS=994}
[2024-03-11 21:39:56,960 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 97 predicate places.
[2024-03-11 21:39:56,960 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 994 transitions, 14214 flow
[2024-03-11 21:39:56,961 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 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 21:39:56,961 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:39:56,961 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 21:39:56,966 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-03-11 21:39:57,165 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:39:57,166 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:39:57,166 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:39:57,166 INFO  L85        PathProgramCache]: Analyzing trace with hash -2051933622, now seen corresponding path program 1 times
[2024-03-11 21:39:57,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:39:57,167 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257179715]
[2024-03-11 21:39:57,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:57,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:39:57,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:57,528 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 21:39:57,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:39:57,528 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257179715]
[2024-03-11 21:39:57,528 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257179715] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 21:39:57,529 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131102846]
[2024-03-11 21:39:57,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:39:57,529 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:39:57,529 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 21:39:57,530 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 21:39:57,532 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 21:39:57,669 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:39:57,670 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-11 21:39:57,676 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 21:39:57,692 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-11 21:39:57,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27
[2024-03-11 21:39:57,797 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 21:39:57,798 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 27 treesize of output 28
[2024-03-11 21:39:57,818 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 21:39:57,838 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 24 treesize of output 12
[2024-03-11 21:39:57,854 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 21:39:57,878 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 21:39:57,897 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:39:57,897 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 21:39:57,912 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:39:57,913 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 52 treesize of output 57
[2024-03-11 21:39:57,936 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 54 treesize of output 50
[2024-03-11 21:39:57,949 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 21:39:57,949 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 21:39:57,949 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [131102846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:39:57,949 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-11 21:39:57,949 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 11
[2024-03-11 21:39:57,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877307659]
[2024-03-11 21:39:57,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:39:57,950 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-11 21:39:57,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:39:57,950 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-11 21:39:57,950 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2024-03-11 21:39:58,694 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 220
[2024-03-11 21:39:58,695 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 994 transitions, 14214 flow. Second operand  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 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 21:39:58,696 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:39:58,696 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 220
[2024-03-11 21:39:58,696 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:40:05,071 INFO  L130       PetriNetUnfolder]: 14519/26970 cut-off events.
[2024-03-11 21:40:05,072 INFO  L131       PetriNetUnfolder]: For 259365/260694 co-relation queries the response was YES.
[2024-03-11 21:40:05,208 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 169013 conditions, 26970 events. 14519/26970 cut-off events. For 259365/260694 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 224584 event pairs, 1149 based on Foata normal form. 502/27009 useless extension candidates. Maximal degree in co-relation 168960. Up to 10064 conditions per place. 
[2024-03-11 21:40:05,313 INFO  L137   encePairwiseOnDemand]: 209/220 looper letters, 1230 selfloop transitions, 98 changer transitions 15/1481 dead transitions.
[2024-03-11 21:40:05,314 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1481 transitions, 23541 flow
[2024-03-11 21:40:05,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-03-11 21:40:05,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-03-11 21:40:05,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1075 transitions.
[2024-03-11 21:40:05,317 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5429292929292929
[2024-03-11 21:40:05,317 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1075 transitions.
[2024-03-11 21:40:05,317 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1075 transitions.
[2024-03-11 21:40:05,317 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:40:05,318 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1075 transitions.
[2024-03-11 21:40:05,319 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 119.44444444444444) internal successors, (1075), 9 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 21:40:05,321 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 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 21:40:05,321 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 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 21:40:05,321 INFO  L175             Difference]: Start difference. First operand has 164 places, 994 transitions, 14214 flow. Second operand 9 states and 1075 transitions.
[2024-03-11 21:40:05,321 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1481 transitions, 23541 flow
[2024-03-11 21:40:07,006 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 1481 transitions, 22871 flow, removed 328 selfloop flow, removed 3 redundant places.
[2024-03-11 21:40:07,024 INFO  L231             Difference]: Finished difference. Result has 166 places, 993 transitions, 13840 flow
[2024-03-11 21:40:07,024 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=13644, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=895, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13840, PETRI_PLACES=166, PETRI_TRANSITIONS=993}
[2024-03-11 21:40:07,025 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 99 predicate places.
[2024-03-11 21:40:07,025 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 993 transitions, 13840 flow
[2024-03-11 21:40:07,025 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 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 21:40:07,025 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:40:07,026 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 21:40:07,032 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 21:40:07,226 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,SelfDestructingSolverStorable17
[2024-03-11 21:40:07,227 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:40:07,228 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:40:07,228 INFO  L85        PathProgramCache]: Analyzing trace with hash 1915501259, now seen corresponding path program 3 times
[2024-03-11 21:40:07,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:40:07,228 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78274738]
[2024-03-11 21:40:07,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:40:07,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:40:07,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:40:07,775 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 21:40:07,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:40:07,776 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78274738]
[2024-03-11 21:40:07,776 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78274738] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 21:40:07,776 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118448276]
[2024-03-11 21:40:07,776 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-11 21:40:07,776 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:40:07,776 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 21:40:07,777 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 21:40:07,797 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 21:40:07,954 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-11 21:40:07,954 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 21:40:07,956 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-03-11 21:40:07,962 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 21:40:07,981 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:40:07,985 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-11 21:40:07,985 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 27 treesize of output 19
[2024-03-11 21:40:08,166 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 21:40:08,167 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 21:40:08,171 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:40:08,172 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 21:40:08,297 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 21:40:08,307 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 21:40:08,378 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 15 treesize of output 11
[2024-03-11 21:40:08,425 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 28 treesize of output 27
[2024-03-11 21:40:08,485 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 21:40:08,492 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 21:40:08,537 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 30 treesize of output 30
[2024-03-11 21:40:08,559 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 40 treesize of output 42
[2024-03-11 21:40:08,613 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 52 treesize of output 57
[2024-03-11 21:40:08,671 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 54 treesize of output 50
[2024-03-11 21:40:08,705 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 54 treesize of output 50
[2024-03-11 21:40:08,730 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 54 treesize of output 50
[2024-03-11 21:40:08,821 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-11 21:40:08,864 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 21:40:08,865 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 21:40:08,889 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_947 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))))) is different from false
[2024-03-11 21:40:08,931 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-03-11 21:40:08,986 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))))))) is different from false
[2024-03-11 21:40:09,153 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse3)) (.cse1 (+ c_~datas~0.offset 2 .cse3))) (and (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_939))) (store .cse0 c_~datas~0.base (store (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_939))) (store .cse4 c_~datas~0.base (store (store (select .cse4 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_939))) (store .cse5 c_~datas~0.base (store (store (select .cse5 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset .cse3)))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_939))) (store .cse6 c_~datas~0.base (store (store (select .cse6 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_947) c_~datas~0.base) .cse1)))))) is different from false
[2024-03-11 21:40:09,183 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 2 .cse5)) (.cse2 (+ c_~datas~0.offset 3 .cse5)) (.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_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_939))) (store .cse0 c_~datas~0.base (store (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) .cse3 v_ArrVal_947) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_939))) (store .cse4 c_~datas~0.base (store (store (select .cse4 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) .cse3 v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset .cse5 1)))) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_939 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_939))) (store .cse6 c_~datas~0.base (store (store (select .cse6 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) .cse3 v_ArrVal_947) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_939 (Array Int Int))) (= (select (select (store (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_939))) (store .cse7 c_~datas~0.base (store (store (select .cse7 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_946) .cse3 v_ArrVal_947) c_~datas~0.base) (+ c_~datas~0.offset .cse5)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 21:40:09,353 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:40:09,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 2 case distinctions, treesize of input 88 treesize of output 74
[2024-03-11 21:40:09,361 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:40:09,361 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 172
[2024-03-11 21:40:09,368 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80
[2024-03-11 21:40:09,371 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 150 treesize of output 126
[2024-03-11 21:40:09,374 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114
[2024-03-11 21:40:09,567 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 21:40:09,567 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [118448276] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 21:40:09,567 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 21:40:09,567 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2024-03-11 21:40:09,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242550220]
[2024-03-11 21:40:09,568 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 21:40:09,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-11 21:40:09,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:40:09,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-11 21:40:09,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=560, Unknown=31, NotChecked=270, Total=992
[2024-03-11 21:40:09,722 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 220
[2024-03-11 21:40:09,723 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 993 transitions, 13840 flow. Second operand  has 32 states, 32 states have (on average 69.3125) internal successors, (2218), 32 states have internal predecessors, (2218), 0 states have call successors, (0), 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 21:40:09,723 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:40:09,724 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 220
[2024-03-11 21:40:09,724 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:40:25,182 INFO  L130       PetriNetUnfolder]: 26607/43992 cut-off events.
[2024-03-11 21:40:25,182 INFO  L131       PetriNetUnfolder]: For 380936/380936 co-relation queries the response was YES.
[2024-03-11 21:40:25,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 273335 conditions, 43992 events. 26607/43992 cut-off events. For 380936/380936 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 335114 event pairs, 4478 based on Foata normal form. 263/44255 useless extension candidates. Maximal degree in co-relation 273284. Up to 17814 conditions per place. 
[2024-03-11 21:40:25,617 INFO  L137   encePairwiseOnDemand]: 179/220 looper letters, 1214 selfloop transitions, 704 changer transitions 56/1977 dead transitions.
[2024-03-11 21:40:25,617 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 1977 transitions, 29309 flow
[2024-03-11 21:40:25,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-11 21:40:25,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-11 21:40:25,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2171 transitions.
[2024-03-11 21:40:25,620 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3795454545454545
[2024-03-11 21:40:25,620 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 2171 transitions.
[2024-03-11 21:40:25,620 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 2171 transitions.
[2024-03-11 21:40:25,621 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:40:25,621 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2171 transitions.
[2024-03-11 21:40:25,624 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 83.5) internal successors, (2171), 26 states have internal predecessors, (2171), 0 states have call successors, (0), 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 21:40:25,629 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 220.0) internal successors, (5940), 27 states have internal predecessors, (5940), 0 states have call successors, (0), 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 21:40:25,629 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 220.0) internal successors, (5940), 27 states have internal predecessors, (5940), 0 states have call successors, (0), 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 21:40:25,629 INFO  L175             Difference]: Start difference. First operand has 166 places, 993 transitions, 13840 flow. Second operand 26 states and 2171 transitions.
[2024-03-11 21:40:25,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 1977 transitions, 29309 flow
[2024-03-11 21:40:28,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 1977 transitions, 28917 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-03-11 21:40:28,327 INFO  L231             Difference]: Finished difference. Result has 194 places, 1346 transitions, 21497 flow
[2024-03-11 21:40:28,327 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=13644, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=386, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=21497, PETRI_PLACES=194, PETRI_TRANSITIONS=1346}
[2024-03-11 21:40:28,328 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 127 predicate places.
[2024-03-11 21:40:28,328 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 1346 transitions, 21497 flow
[2024-03-11 21:40:28,328 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 69.3125) internal successors, (2218), 32 states have internal predecessors, (2218), 0 states have call successors, (0), 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 21:40:28,329 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:40:28,329 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 21:40:28,337 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 21:40:28,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:40:28,530 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:40:28,530 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:40:28,531 INFO  L85        PathProgramCache]: Analyzing trace with hash -833319605, now seen corresponding path program 4 times
[2024-03-11 21:40:28,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:40:28,531 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651478488]
[2024-03-11 21:40:28,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:40:28,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:40:28,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:40:28,960 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 21:40:28,960 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:40:28,960 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651478488]
[2024-03-11 21:40:28,960 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651478488] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 21:40:28,960 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624305987]
[2024-03-11 21:40:28,961 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-11 21:40:28,961 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:40:28,961 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 21:40:28,962 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 21:40:28,967 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 21:40:29,220 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-11 21:40:29,220 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 21:40:29,222 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 62 conjunts are in the unsatisfiable core
[2024-03-11 21:40:29,238 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 21:40:29,253 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:40:29,259 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 26 treesize of output 24
[2024-03-11 21:40:29,495 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 21:40:29,495 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 21:40:29,507 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:40:29,508 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 14 treesize of output 16
[2024-03-11 21:40:29,667 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:40:29,668 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 21:40:29,680 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:40:29,682 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-11 21:40:29,833 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 21:40:29,908 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 21:40:29,922 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-03-11 21:40:29,971 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 28 treesize of output 27
[2024-03-11 21:40:30,040 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 40 treesize of output 42
[2024-03-11 21:40:30,120 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 52 treesize of output 57
[2024-03-11 21:40:30,207 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:40:30,208 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 54 treesize of output 50
[2024-03-11 21:40:30,239 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:40:30,240 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 54 treesize of output 50
[2024-03-11 21:40:30,276 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:40:30,277 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 54 treesize of output 50
[2024-03-11 21:40:30,304 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:40:30,305 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 54 treesize of output 50
[2024-03-11 21:40:30,413 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67
[2024-03-11 21:40:30,461 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 21:40:30,462 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 21:40:30,610 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1060 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1060))) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse2)))) (forall ((v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1060 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1060))) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1060 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1060))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))) (forall ((v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1060 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1060))) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))))) is different from false
[2024-03-11 21:40:34,393 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:40:34,394 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 114 treesize of output 94
[2024-03-11 21:40:34,411 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:40:34,411 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 387 treesize of output 355
[2024-03-11 21:40:34,423 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 360 treesize of output 332
[2024-03-11 21:40:34,493 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 199 treesize of output 185
[2024-03-11 21:40:34,635 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:40:34,636 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 147 treesize of output 85
[2024-03-11 21:40:34,685 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:40:34,685 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 93
[2024-03-11 21:40:34,694 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 21:40:34,714 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-11 21:40:34,715 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 197
[2024-03-11 21:40:34,729 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96
[2024-03-11 21:40:34,748 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 152
[2024-03-11 21:40:34,808 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:40:34,809 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 94
[2024-03-11 21:40:34,819 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 21:40:34,839 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-11 21:40:34,839 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 201
[2024-03-11 21:40:34,856 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 106 treesize of output 99
[2024-03-11 21:40:34,883 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 156
[2024-03-11 21:40:34,944 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:40:34,945 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 94
[2024-03-11 21:40:34,977 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 21:40:34,997 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-11 21:40:34,997 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 201
[2024-03-11 21:40:35,013 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 106 treesize of output 99
[2024-03-11 21:40:35,030 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 156
[2024-03-11 21:40:36,971 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 21:40:36,971 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [624305987] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 21:40:36,971 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 21:40:36,971 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 36
[2024-03-11 21:40:36,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84902934]
[2024-03-11 21:40:36,972 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 21:40:36,973 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2024-03-11 21:40:36,973 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:40:36,973 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2024-03-11 21:40:36,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1067, Unknown=49, NotChecked=70, Total=1406
[2024-03-11 21:40:38,058 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 220
[2024-03-11 21:40:38,061 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 1346 transitions, 21497 flow. Second operand  has 38 states, 38 states have (on average 60.10526315789474) internal successors, (2284), 38 states have internal predecessors, (2284), 0 states have call successors, (0), 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 21:40:38,061 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:40:38,061 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 220
[2024-03-11 21:40:38,061 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:40:51,562 WARN  L233               SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 67 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-03-11 21:41:06,844 WARN  L233               SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 72 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-03-11 21:41:19,661 WARN  L233               SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 75 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-03-11 21:41:30,895 WARN  L233               SmtUtils]: Spent 10.36s on a formula simplification. DAG size of input: 78 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-03-11 21:42:15,705 WARN  L233               SmtUtils]: Spent 12.31s on a formula simplification. DAG size of input: 106 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-03-11 21:42:33,653 INFO  L130       PetriNetUnfolder]: 55541/91602 cut-off events.
[2024-03-11 21:42:33,653 INFO  L131       PetriNetUnfolder]: For 1436398/1436408 co-relation queries the response was YES.
[2024-03-11 21:42:34,403 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 726186 conditions, 91602 events. 55541/91602 cut-off events. For 1436398/1436408 co-relation queries the response was YES. Maximal size of possible extension queue 2407. Compared 763345 event pairs, 7762 based on Foata normal form. 454/92055 useless extension candidates. Maximal degree in co-relation 726124. Up to 30613 conditions per place. 
[2024-03-11 21:42:34,829 INFO  L137   encePairwiseOnDemand]: 184/220 looper letters, 2952 selfloop transitions, 1201 changer transitions 450/4606 dead transitions.
[2024-03-11 21:42:34,829 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 4606 transitions, 78714 flow
[2024-03-11 21:42:34,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. 
[2024-03-11 21:42:34,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 42 states.
[2024-03-11 21:42:34,832 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 3186 transitions.
[2024-03-11 21:42:34,833 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3448051948051948
[2024-03-11 21:42:34,833 INFO  L72            ComplementDD]: Start complementDD. Operand 42 states and 3186 transitions.
[2024-03-11 21:42:34,833 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 42 states and 3186 transitions.
[2024-03-11 21:42:34,834 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:42:34,834 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 3186 transitions.
[2024-03-11 21:42:34,837 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 43 states, 42 states have (on average 75.85714285714286) internal successors, (3186), 42 states have internal predecessors, (3186), 0 states have call successors, (0), 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 21:42:34,843 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 43 states, 43 states have (on average 220.0) internal successors, (9460), 43 states have internal predecessors, (9460), 0 states have call successors, (0), 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 21:42:34,844 INFO  L81            ComplementDD]: Finished complementDD. Result  has 43 states, 43 states have (on average 220.0) internal successors, (9460), 43 states have internal predecessors, (9460), 0 states have call successors, (0), 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 21:42:34,844 INFO  L175             Difference]: Start difference. First operand has 194 places, 1346 transitions, 21497 flow. Second operand 42 states and 3186 transitions.
[2024-03-11 21:42:34,844 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 4606 transitions, 78714 flow
[2024-03-11 21:43:00,752 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 4606 transitions, 76020 flow, removed 1171 selfloop flow, removed 11 redundant places.
[2024-03-11 21:43:00,802 INFO  L231             Difference]: Finished difference. Result has 252 places, 2204 transitions, 40696 flow
[2024-03-11 21:43:00,803 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=20316, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=401, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=40696, PETRI_PLACES=252, PETRI_TRANSITIONS=2204}
[2024-03-11 21:43:00,804 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 185 predicate places.
[2024-03-11 21:43:00,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 2204 transitions, 40696 flow
[2024-03-11 21:43:00,804 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 38 states have (on average 60.10526315789474) internal successors, (2284), 38 states have internal predecessors, (2284), 0 states have call successors, (0), 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 21:43:00,804 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:43:00,804 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 21:43:00,813 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 21:43:01,006 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:43:01,006 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:43:01,007 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:43:01,007 INFO  L85        PathProgramCache]: Analyzing trace with hash -1580836759, now seen corresponding path program 5 times
[2024-03-11 21:43:01,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:43:01,007 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130090676]
[2024-03-11 21:43:01,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:43:01,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:43:01,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:43:01,603 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 21:43:01,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:43:01,603 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130090676]
[2024-03-11 21:43:01,603 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130090676] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 21:43:01,603 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865836296]
[2024-03-11 21:43:01,604 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-11 21:43:01,604 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:43:01,604 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 21:43:01,606 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 21:43:01,607 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 21:43:01,750 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 21:43:01,750 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 21:43:01,752 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2024-03-11 21:43:01,759 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 21:43:01,781 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:43:01,786 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 26 treesize of output 24
[2024-03-11 21:43:01,974 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 21:43:01,975 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 21:43:02,026 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:43:02,027 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 21:43:02,076 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 21:43:02,124 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 21:43:02,197 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 21:43:02,272 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:43:02,272 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 21:43:02,349 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:43:02,350 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 42 treesize of output 40
[2024-03-11 21:43:02,370 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:43:02,371 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 42 treesize of output 40
[2024-03-11 21:43:02,412 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:43:02,413 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 42 treesize of output 40
[2024-03-11 21:43:02,443 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:43:02,444 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 42 treesize of output 40
[2024-03-11 21:43:02,495 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:43:02,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 52 treesize of output 57
[2024-03-11 21:43:02,525 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 54 treesize of output 50
[2024-03-11 21:43:02,544 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 21:43:02,544 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 21:43:02,544 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865836296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:43:02,544 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-11 21:43:02,545 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16
[2024-03-11 21:43:02,545 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764827450]
[2024-03-11 21:43:02,545 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:43:02,546 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-03-11 21:43:02,546 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:43:02,547 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-03-11 21:43:02,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306
[2024-03-11 21:43:03,527 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 220
[2024-03-11 21:43:03,529 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 2204 transitions, 40696 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 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 21:43:03,529 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:43:03,529 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 220
[2024-03-11 21:43:03,529 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:43:43,088 INFO  L130       PetriNetUnfolder]: 48354/83021 cut-off events.
[2024-03-11 21:43:43,088 INFO  L131       PetriNetUnfolder]: For 2284669/2295708 co-relation queries the response was YES.
[2024-03-11 21:43:44,068 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 773439 conditions, 83021 events. 48354/83021 cut-off events. For 2284669/2295708 co-relation queries the response was YES. Maximal size of possible extension queue 2487. Compared 732035 event pairs, 7551 based on Foata normal form. 1467/83307 useless extension candidates. Maximal degree in co-relation 773352. Up to 33591 conditions per place. 
[2024-03-11 21:43:44,607 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 1440 selfloop transitions, 1169 changer transitions 45/2680 dead transitions.
[2024-03-11 21:43:44,607 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 2680 transitions, 53728 flow
[2024-03-11 21:43:44,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-03-11 21:43:44,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-03-11 21:43:44,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1422 transitions.
[2024-03-11 21:43:44,610 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4972027972027972
[2024-03-11 21:43:44,610 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1422 transitions.
[2024-03-11 21:43:44,610 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1422 transitions.
[2024-03-11 21:43:44,610 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:43:44,610 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1422 transitions.
[2024-03-11 21:43:44,612 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 109.38461538461539) internal successors, (1422), 13 states have internal predecessors, (1422), 0 states have call successors, (0), 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 21:43:44,614 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 220.0) internal successors, (3080), 14 states have internal predecessors, (3080), 0 states have call successors, (0), 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 21:43:44,614 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 220.0) internal successors, (3080), 14 states have internal predecessors, (3080), 0 states have call successors, (0), 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 21:43:44,614 INFO  L175             Difference]: Start difference. First operand has 252 places, 2204 transitions, 40696 flow. Second operand 13 states and 1422 transitions.
[2024-03-11 21:43:44,615 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 2680 transitions, 53728 flow
[2024-03-11 21:44:16,282 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 2680 transitions, 51731 flow, removed 966 selfloop flow, removed 16 redundant places.
[2024-03-11 21:44:16,323 INFO  L231             Difference]: Finished difference. Result has 243 places, 2266 transitions, 43137 flow
[2024-03-11 21:44:16,324 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=38931, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1071, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=43137, PETRI_PLACES=243, PETRI_TRANSITIONS=2266}
[2024-03-11 21:44:16,324 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 176 predicate places.
[2024-03-11 21:44:16,325 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 2266 transitions, 43137 flow
[2024-03-11 21:44:16,325 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 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 21:44:16,325 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:44:16,325 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2024-03-11 21:44:16,330 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 21:44:16,526 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,SelfDestructingSolverStorable20
[2024-03-11 21:44:16,527 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-11 21:44:16,527 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:44:16,527 INFO  L85        PathProgramCache]: Analyzing trace with hash 1145920694, now seen corresponding path program 1 times
[2024-03-11 21:44:16,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:44:16,528 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117095593]
[2024-03-11 21:44:16,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:44:16,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:44:16,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 21:44:16,551 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 21:44:16,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 21:44:16,564 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 21:44:16,564 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 21:44:16,564 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2024-03-11 21:44:16,565 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2024-03-11 21:44:16,565 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2024-03-11 21:44:16,565 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2024-03-11 21:44:16,565 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2024-03-11 21:44:16,565 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2024-03-11 21:44:16,565 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2024-03-11 21:44:16,566 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2024-03-11 21:44:16,566 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2024-03-11 21:44:16,566 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2024-03-11 21:44:16,566 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2024-03-11 21:44:16,566 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2024-03-11 21:44:16,566 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2024-03-11 21:44:16,566 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-11 21:44:16,566 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:44:16,567 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 21:44:16,567 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-11 21:44:16,584 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-11 21:44:16,585 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2024-03-11 21:44:16,613 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2024-03-11 21:44:16,613 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-03-11 21:44:16,614 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1515 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2024-03-11 21:44:16,614 INFO  L82        GeneralOperation]: Start removeDead. Operand has 159 places, 158 transitions, 346 flow
[2024-03-11 21:44:16,615 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 159 places, 158 transitions, 346 flow
[2024-03-11 21:44:16,616 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 21:44:16,616 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 158 transitions, 346 flow
[2024-03-11 21:44:16,616 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 158 transitions, 346 flow
[2024-03-11 21:44:16,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2024-03-11 21:44:16,644 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2024-03-11 21:44:16,645 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-03-11 21:44:16,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1515 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2024-03-11 21:44:16,654 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9576
[2024-03-11 21:44:20,588 INFO  L134        LiptonReduction]: Checked pairs total: 47214
[2024-03-11 21:44:20,588 INFO  L136        LiptonReduction]: Total number of compositions: 92
[2024-03-11 21:44:20,590 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 21:44:20,591 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;@7ebbf727, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 21:44:20,591 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-03-11 21:44:20,591 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-03-11 21:44:20,592 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 21:44:20,592 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:44:20,592 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-11 21:44:20,592 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 21:44:20,593 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:44:20,593 INFO  L85        PathProgramCache]: Analyzing trace with hash 895, now seen corresponding path program 1 times
[2024-03-11 21:44:20,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:44:20,593 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090642155]
[2024-03-11 21:44:20,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:44:20,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:44:20,597 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:44:20,598 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 21:44:20,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:44:20,598 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090642155]
[2024-03-11 21:44:20,598 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090642155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:44:20,598 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:44:20,599 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-11 21:44:20,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692382328]
[2024-03-11 21:44:20,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:44:20,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-11 21:44:20,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:44:20,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-11 21:44:20,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-11 21:44:20,600 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 250
[2024-03-11 21:44:20,600 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 182 flow. Second operand  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 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 21:44:20,600 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:44:20,600 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 250
[2024-03-11 21:44:20,601 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:44:21,135 INFO  L130       PetriNetUnfolder]: 3680/8504 cut-off events.
[2024-03-11 21:44:21,135 INFO  L131       PetriNetUnfolder]: For 658/1638 co-relation queries the response was YES.
[2024-03-11 21:44:21,147 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14271 conditions, 8504 events. 3680/8504 cut-off events. For 658/1638 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 72179 event pairs, 3637 based on Foata normal form. 0/7831 useless extension candidates. Maximal degree in co-relation 11836. Up to 5535 conditions per place. 
[2024-03-11 21:44:21,168 INFO  L137   encePairwiseOnDemand]: 249/250 looper letters, 28 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2024-03-11 21:44:21,169 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 236 flow
[2024-03-11 21:44:21,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-11 21:44:21,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-11 21:44:21,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 327 transitions.
[2024-03-11 21:44:21,170 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.654
[2024-03-11 21:44:21,170 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 327 transitions.
[2024-03-11 21:44:21,170 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 327 transitions.
[2024-03-11 21:44:21,171 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:44:21,171 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 327 transitions.
[2024-03-11 21:44:21,171 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 163.5) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 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 21:44:21,172 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 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 21:44:21,172 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 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 21:44:21,172 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 327 transitions.
[2024-03-11 21:44:21,172 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 236 flow
[2024-03-11 21:44:21,173 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:44:21,174 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2024-03-11 21:44:21,174 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=80, PETRI_TRANSITIONS=75}
[2024-03-11 21:44:21,174 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2024-03-11 21:44:21,174 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2024-03-11 21:44:21,175 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 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 21:44:21,175 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:44:21,175 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:44:21,175 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-11 21:44:21,175 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 21:44:21,175 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:44:21,175 INFO  L85        PathProgramCache]: Analyzing trace with hash -93167708, now seen corresponding path program 1 times
[2024-03-11 21:44:21,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:44:21,176 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467691603]
[2024-03-11 21:44:21,176 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:44:21,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:44:21,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:44:21,304 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 21:44:21,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:44:21,304 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467691603]
[2024-03-11 21:44:21,304 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467691603] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:44:21,305 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:44:21,305 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 21:44:21,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364404646]
[2024-03-11 21:44:21,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:44:21,305 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 21:44:21,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:44:21,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 21:44:21,306 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 21:44:21,631 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 250
[2024-03-11 21:44:21,632 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 180 flow. Second operand  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 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 21:44:21,632 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:44:21,632 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 250
[2024-03-11 21:44:21,633 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:44:29,110 INFO  L130       PetriNetUnfolder]: 75663/120904 cut-off events.
[2024-03-11 21:44:29,111 INFO  L131       PetriNetUnfolder]: For 3728/4209 co-relation queries the response was YES.
[2024-03-11 21:44:29,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 231350 conditions, 120904 events. 75663/120904 cut-off events. For 3728/4209 co-relation queries the response was YES. Maximal size of possible extension queue 2764. Compared 1003579 event pairs, 19231 based on Foata normal form. 157/116595 useless extension candidates. Maximal degree in co-relation 231344. Up to 73144 conditions per place. 
[2024-03-11 21:44:29,630 INFO  L137   encePairwiseOnDemand]: 219/250 looper letters, 111 selfloop transitions, 64 changer transitions 0/196 dead transitions.
[2024-03-11 21:44:29,631 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 196 transitions, 793 flow
[2024-03-11 21:44:29,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 21:44:29,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 21:44:29,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions.
[2024-03-11 21:44:29,633 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5826666666666667
[2024-03-11 21:44:29,633 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 874 transitions.
[2024-03-11 21:44:29,633 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 874 transitions.
[2024-03-11 21:44:29,634 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:44:29,634 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 874 transitions.
[2024-03-11 21:44:29,635 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 145.66666666666666) internal successors, (874), 6 states have internal predecessors, (874), 0 states have call successors, (0), 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 21:44:29,636 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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 21:44:29,636 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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 21:44:29,636 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 874 transitions.
[2024-03-11 21:44:29,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 196 transitions, 793 flow
[2024-03-11 21:44:29,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 196 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:44:29,641 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2024-03-11 21:44:29,642 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=139}
[2024-03-11 21:44:29,642 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2024-03-11 21:44:29,642 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2024-03-11 21:44:29,642 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 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 21:44:29,642 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:44:29,642 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:44:29,643 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-11 21:44:29,643 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 21:44:29,643 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:44:29,643 INFO  L85        PathProgramCache]: Analyzing trace with hash 1118363942, now seen corresponding path program 1 times
[2024-03-11 21:44:29,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:44:29,643 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402540359]
[2024-03-11 21:44:29,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:44:29,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:44:29,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:44:29,664 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 21:44:29,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:44:29,665 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402540359]
[2024-03-11 21:44:29,665 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402540359] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:44:29,665 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:44:29,665 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 21:44:29,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522988649]
[2024-03-11 21:44:29,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:44:29,666 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 21:44:29,666 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:44:29,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 21:44:29,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 21:44:29,692 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 250
[2024-03-11 21:44:29,692 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 139 transitions, 626 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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 21:44:29,693 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:44:29,693 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 250
[2024-03-11 21:44:29,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:44:32,670 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_191| v_~datas~0.base_119)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_33 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 1 v_~datas~0.offset_105))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_105)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_105))) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_105)))))  InVars {#race=|v_#race_191|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_119, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_191|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_119, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, Black: 170#(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: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 85#threadEXITtrue, 165#true, 123#L1016-3true, 129#L1016-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-11 21:44:32,670 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2024-03-11 21:44:32,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-11 21:44:32,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-11 21:44:32,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-11 21:44:32,670 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_191| v_~datas~0.base_119)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_33 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 1 v_~datas~0.offset_105))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_105)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_105))) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_105)))))  InVars {#race=|v_#race_191|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_119, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_191|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_119, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, Black: 170#(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)), 81#L1016-3true, Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 85#threadEXITtrue, 165#true, 46#L1016-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-11 21:44:32,670 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2024-03-11 21:44:32,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-11 21:44:32,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-11 21:44:32,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-11 21:44:32,895 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_191| v_~datas~0.base_119)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_33 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 1 v_~datas~0.offset_105))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_105)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_105))) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_105)))))  InVars {#race=|v_#race_191|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_119, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_191|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_119, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, Black: 170#(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: 169#(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)), 81#L1016-3true, Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 85#threadEXITtrue, 165#true, 123#L1016-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-11 21:44:32,895 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,895 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,895 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,895 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,896 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([801] L1016-4-->L1016-6: Formula: (= |v_#race_185| (store |v_#race_186| v_~datas~0.base_109 (store (select |v_#race_186| v_~datas~0.base_109) (+ (* v_threadThread2of3ForFork0_~i~0_29 4) v_~datas~0.offset_97) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_186|, ~datas~0.base=v_~datas~0.base_109, ~datas~0.offset=v_~datas~0.offset_97, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_29}  OutVars{#race=|v_#race_185|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_109, ~datas~0.offset=v_~datas~0.offset_97, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_29}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, 36#L1016-9true, 97#L1016-6true, Black: 170#(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: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 129#L1016-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-11 21:44:32,896 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,896 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,896 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,896 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,896 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([774] L1016-4-->L1016-6: Formula: (= (store |v_#race_172| v_~datas~0.base_99 (store (select |v_#race_172| v_~datas~0.base_99) (+ v_~datas~0.offset_87 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)) |v_#race_171|)  InVars {#race=|v_#race_172|, ~datas~0.base=v_~datas~0.base_99, ~datas~0.offset=v_~datas~0.offset_87, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_171|, ~datas~0.base=v_~datas~0.base_99, ~datas~0.offset=v_~datas~0.offset_87, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, 36#L1016-9true, Black: 170#(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)), 52#L1016-6true, Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 46#L1016-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-11 21:44:32,896 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,897 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,897 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 21:44:32,897 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 21:44:33,095 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([801] L1016-4-->L1016-6: Formula: (= |v_#race_185| (store |v_#race_186| v_~datas~0.base_109 (store (select |v_#race_186| v_~datas~0.base_109) (+ (* v_threadThread2of3ForFork0_~i~0_29 4) v_~datas~0.offset_97) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_186|, ~datas~0.base=v_~datas~0.base_109, ~datas~0.offset=v_~datas~0.offset_97, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_29}  OutVars{#race=|v_#race_185|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_109, ~datas~0.offset=v_~datas~0.offset_97, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_29}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, 36#L1016-9true, Black: 170#(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)), 97#L1016-6true, Black: 169#(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)), 81#L1016-3true, Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-11 21:44:33,095 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-03-11 21:44:33,095 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 21:44:33,095 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 21:44:33,095 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 21:44:33,095 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([774] L1016-4-->L1016-6: Formula: (= (store |v_#race_172| v_~datas~0.base_99 (store (select |v_#race_172| v_~datas~0.base_99) (+ v_~datas~0.offset_87 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)) |v_#race_171|)  InVars {#race=|v_#race_172|, ~datas~0.base=v_~datas~0.base_99, ~datas~0.offset=v_~datas~0.offset_87, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_171|, ~datas~0.base=v_~datas~0.base_99, ~datas~0.offset=v_~datas~0.offset_87, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, 36#L1016-9true, Black: 170#(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)), 52#L1016-6true, Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 123#L1016-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-11 21:44:33,096 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-03-11 21:44:33,096 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 21:44:33,096 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 21:44:33,096 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 21:44:34,701 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([844] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_193| v_~datas~0.base_123)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_37 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 3 v_~datas~0.offset_107)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= (select .cse0 (+ .cse1 v_~datas~0.offset_107)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_107)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_107)) |v_threadThread3of3ForFork0_#t~nondet4_28|)))  InVars {#race=|v_#race_193|, ~datas~0.base=v_~datas~0.base_123, ~datas~0.offset=v_~datas~0.offset_107, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_37}  OutVars{#race=|v_#race_193|, ~datas~0.base=v_~datas~0.base_123, ~datas~0.offset=v_~datas~0.offset_107, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_37}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 162#true, 6#threadEXITtrue, Black: 170#(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: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 85#threadEXITtrue, 165#true, 82#L1028-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2024-03-11 21:44:34,701 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2024-03-11 21:44:34,701 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-11 21:44:34,701 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-11 21:44:34,701 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-11 21:44:34,701 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([844] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_193| v_~datas~0.base_123)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_37 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 3 v_~datas~0.offset_107)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= (select .cse0 (+ .cse1 v_~datas~0.offset_107)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_107)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_107)) |v_threadThread3of3ForFork0_#t~nondet4_28|)))  InVars {#race=|v_#race_193|, ~datas~0.base=v_~datas~0.base_123, ~datas~0.offset=v_~datas~0.offset_107, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_37}  OutVars{#race=|v_#race_193|, ~datas~0.base=v_~datas~0.base_123, ~datas~0.offset=v_~datas~0.offset_107, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_37}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 162#true, 6#threadEXITtrue, Black: 170#(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: 169#(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)), 94#L1030true, Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 85#threadEXITtrue, 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2024-03-11 21:44:34,701 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2024-03-11 21:44:34,701 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-11 21:44:34,701 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-11 21:44:34,701 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-11 21:44:34,864 INFO  L130       PetriNetUnfolder]: 36197/69248 cut-off events.
[2024-03-11 21:44:34,864 INFO  L131       PetriNetUnfolder]: For 38526/45070 co-relation queries the response was YES.
[2024-03-11 21:44:35,034 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 166376 conditions, 69248 events. 36197/69248 cut-off events. For 38526/45070 co-relation queries the response was YES. Maximal size of possible extension queue 2423. Compared 690518 event pairs, 15578 based on Foata normal form. 967/64851 useless extension candidates. Maximal degree in co-relation 166365. Up to 32701 conditions per place. 
[2024-03-11 21:44:35,261 INFO  L137   encePairwiseOnDemand]: 242/250 looper letters, 50 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2024-03-11 21:44:35,262 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 764 flow
[2024-03-11 21:44:35,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 21:44:35,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 21:44:35,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions.
[2024-03-11 21:44:35,263 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6026666666666667
[2024-03-11 21:44:35,263 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 452 transitions.
[2024-03-11 21:44:35,263 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions.
[2024-03-11 21:44:35,263 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:44:35,263 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions.
[2024-03-11 21:44:35,264 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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 21:44:35,265 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 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 21:44:35,265 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 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 21:44:35,265 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 452 transitions.
[2024-03-11 21:44:35,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 764 flow
[2024-03-11 21:44:35,625 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 764 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:44:35,626 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2024-03-11 21:44:35,626 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=139}
[2024-03-11 21:44:35,627 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2024-03-11 21:44:35,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2024-03-11 21:44:35,627 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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 21:44:35,627 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:44:35,627 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:44:35,627 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-11 21:44:35,627 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 21:44:35,627 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:44:35,627 INFO  L85        PathProgramCache]: Analyzing trace with hash 239957306, now seen corresponding path program 1 times
[2024-03-11 21:44:35,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:44:35,628 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255936671]
[2024-03-11 21:44:35,628 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:44:35,628 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:44:35,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:44:35,781 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 21:44:35,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:44:35,782 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255936671]
[2024-03-11 21:44:35,782 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255936671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:44:35,782 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:44:35,782 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 21:44:35,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503077447]
[2024-03-11 21:44:35,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:44:35,783 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 21:44:35,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:44:35,783 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 21:44:35,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 21:44:36,178 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 250
[2024-03-11 21:44:36,179 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 139 transitions, 646 flow. Second operand  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 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 21:44:36,179 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:44:36,179 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 250
[2024-03-11 21:44:36,179 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:44:45,973 INFO  L130       PetriNetUnfolder]: 78201/123586 cut-off events.
[2024-03-11 21:44:45,973 INFO  L131       PetriNetUnfolder]: For 94283/95509 co-relation queries the response was YES.
[2024-03-11 21:44:46,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 340505 conditions, 123586 events. 78201/123586 cut-off events. For 94283/95509 co-relation queries the response was YES. Maximal size of possible extension queue 2848. Compared 1012193 event pairs, 27187 based on Foata normal form. 0/117876 useless extension candidates. Maximal degree in co-relation 340493. Up to 88234 conditions per place. 
[2024-03-11 21:44:46,757 INFO  L137   encePairwiseOnDemand]: 231/250 looper letters, 148 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2024-03-11 21:44:46,758 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1807 flow
[2024-03-11 21:44:46,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 21:44:46,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 21:44:46,759 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 893 transitions.
[2024-03-11 21:44:46,759 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5953333333333334
[2024-03-11 21:44:46,759 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 893 transitions.
[2024-03-11 21:44:46,759 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 893 transitions.
[2024-03-11 21:44:46,759 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:44:46,759 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 893 transitions.
[2024-03-11 21:44:46,761 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 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 21:44:46,762 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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 21:44:46,762 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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 21:44:46,762 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 893 transitions.
[2024-03-11 21:44:46,762 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1807 flow
[2024-03-11 21:44:46,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1807 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:44:46,845 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2024-03-11 21:44:46,845 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1604, PETRI_PLACES=99, PETRI_TRANSITIONS=240}
[2024-03-11 21:44:46,845 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2024-03-11 21:44:46,845 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2024-03-11 21:44:46,846 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 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 21:44:46,846 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:44:46,846 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:44:46,846 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-11 21:44:46,846 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 21:44:46,846 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:44:46,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 1459769595, now seen corresponding path program 1 times
[2024-03-11 21:44:46,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:44:46,846 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142366847]
[2024-03-11 21:44:46,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:44:46,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:44:46,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:44:46,993 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 21:44:46,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:44:46,993 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142366847]
[2024-03-11 21:44:46,993 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142366847] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:44:46,993 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:44:46,993 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 21:44:46,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777432487]
[2024-03-11 21:44:46,993 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:44:46,994 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 21:44:46,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:44:46,994 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 21:44:46,994 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 21:44:47,315 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 250
[2024-03-11 21:44:47,316 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 240 transitions, 1604 flow. Second operand  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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 21:44:47,316 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:44:47,316 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 250
[2024-03-11 21:44:47,316 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:45:11,144 INFO  L130       PetriNetUnfolder]: 165587/252270 cut-off events.
[2024-03-11 21:45:11,145 INFO  L131       PetriNetUnfolder]: For 288404/291163 co-relation queries the response was YES.
[2024-03-11 21:45:11,852 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 817394 conditions, 252270 events. 165587/252270 cut-off events. For 288404/291163 co-relation queries the response was YES. Maximal size of possible extension queue 5144. Compared 2087744 event pairs, 47460 based on Foata normal form. 0/237884 useless extension candidates. Maximal degree in co-relation 817377. Up to 165386 conditions per place. 
[2024-03-11 21:45:12,831 INFO  L137   encePairwiseOnDemand]: 220/250 looper letters, 334 selfloop transitions, 162 changer transitions 0/517 dead transitions.
[2024-03-11 21:45:12,831 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 517 transitions, 4078 flow
[2024-03-11 21:45:12,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 21:45:12,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 21:45:12,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 918 transitions.
[2024-03-11 21:45:12,833 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.612
[2024-03-11 21:45:12,833 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 918 transitions.
[2024-03-11 21:45:12,833 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 918 transitions.
[2024-03-11 21:45:12,833 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:45:12,833 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 918 transitions.
[2024-03-11 21:45:12,834 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 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 21:45:12,835 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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 21:45:12,835 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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 21:45:12,835 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 918 transitions.
[2024-03-11 21:45:12,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 517 transitions, 4078 flow
[2024-03-11 21:45:14,207 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 517 transitions, 4078 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 21:45:14,212 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2024-03-11 21:45:14,212 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3161, PETRI_PLACES=108, PETRI_TRANSITIONS=395}
[2024-03-11 21:45:14,212 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2024-03-11 21:45:14,212 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2024-03-11 21:45:14,213 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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 21:45:14,213 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:45:14,213 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:45:14,213 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-11 21:45:14,213 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 21:45:14,213 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:45:14,213 INFO  L85        PathProgramCache]: Analyzing trace with hash 1725887645, now seen corresponding path program 1 times
[2024-03-11 21:45:14,213 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:45:14,214 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326391757]
[2024-03-11 21:45:14,214 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:45:14,214 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:45:14,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:45:14,502 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 21:45:14,502 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:45:14,502 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326391757]
[2024-03-11 21:45:14,502 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326391757] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 21:45:14,502 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588177302]
[2024-03-11 21:45:14,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:45:14,502 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 21:45:14,503 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 21:45:14,504 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 21:45:14,506 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 21:45:14,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:45:14,663 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2024-03-11 21:45:14,666 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 21:45:14,750 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 21:45:14,784 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:45:14,784 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 21:45:14,819 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:45:14,821 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:45:14,822 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 21:45:14,873 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:45:14,874 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:45:14,875 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:45:14,876 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 21:45:14,953 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 21:45:14,954 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 21:45:15,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-11 21:45:15,005 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 21:45:15,085 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1407 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1407) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1407 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1407) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1407 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1407) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1407 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1407) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-11 21:45:15,251 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1407) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1407 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1407) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1407 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1407) |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 21:45:15,277 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1407) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1407 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1407) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1407 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1407) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-03-11 21:45:15,298 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:45:15,298 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 21:45:15,306 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 21:45:15,306 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 21:45:15,315 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-11 21:45:15,324 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 21:45:15,324 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 21:45:15,332 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 21:45:15,332 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 21:45:15,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2024-03-11 21:45:15,362 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588177302] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 21:45:15,362 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 21:45:15,362 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2024-03-11 21:45:15,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381910731]
[2024-03-11 21:45:15,363 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 21:45:15,363 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-03-11 21:45:15,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:45:15,364 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-03-11 21:45:15,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=136, Unknown=9, NotChecked=84, Total=306
[2024-03-11 21:45:15,570 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 250
[2024-03-11 21:45:15,572 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 395 transitions, 3161 flow. Second operand  has 18 states, 18 states have (on average 95.33333333333333) internal successors, (1716), 18 states have internal predecessors, (1716), 0 states have call successors, (0), 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 21:45:15,572 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:45:15,572 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 250
[2024-03-11 21:45:15,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 21:46:00,509 INFO  L130       PetriNetUnfolder]: 291944/413535 cut-off events.
[2024-03-11 21:46:00,509 INFO  L131       PetriNetUnfolder]: For 908915/908915 co-relation queries the response was YES.
[2024-03-11 21:46:01,851 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1581109 conditions, 413535 events. 291944/413535 cut-off events. For 908915/908915 co-relation queries the response was YES. Maximal size of possible extension queue 6772. Compared 3087121 event pairs, 146441 based on Foata normal form. 6822/389899 useless extension candidates. Maximal degree in co-relation 1581087. Up to 397760 conditions per place. 
[2024-03-11 21:46:03,498 INFO  L137   encePairwiseOnDemand]: 233/250 looper letters, 440 selfloop transitions, 7 changer transitions 11/464 dead transitions.
[2024-03-11 21:46:03,498 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 464 transitions, 4550 flow
[2024-03-11 21:46:03,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 21:46:03,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 21:46:03,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 760 transitions.
[2024-03-11 21:46:03,500 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4342857142857143
[2024-03-11 21:46:03,500 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 760 transitions.
[2024-03-11 21:46:03,500 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 760 transitions.
[2024-03-11 21:46:03,500 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 21:46:03,501 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 760 transitions.
[2024-03-11 21:46:03,501 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 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 21:46:03,503 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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 21:46:03,503 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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 21:46:03,503 INFO  L175             Difference]: Start difference. First operand has 108 places, 395 transitions, 3161 flow. Second operand 7 states and 760 transitions.
[2024-03-11 21:46:03,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 464 transitions, 4550 flow
[2024-03-11 21:46:32,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 464 transitions, 4454 flow, removed 48 selfloop flow, removed 0 redundant places.
[2024-03-11 21:46:32,909 INFO  L231             Difference]: Finished difference. Result has 115 places, 396 transitions, 3125 flow
[2024-03-11 21:46:32,909 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=3053, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3125, PETRI_PLACES=115, PETRI_TRANSITIONS=396}
[2024-03-11 21:46:32,910 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 35 predicate places.
[2024-03-11 21:46:32,910 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 396 transitions, 3125 flow
[2024-03-11 21:46:32,910 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 95.33333333333333) internal successors, (1716), 18 states have internal predecessors, (1716), 0 states have call successors, (0), 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 21:46:32,910 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 21:46:32,910 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 21:46:32,955 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 21:46:33,111 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,SelfDestructingSolverStorable27
[2024-03-11 21:46:33,112 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 21:46:33,113 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 21:46:33,113 INFO  L85        PathProgramCache]: Analyzing trace with hash -742669094, now seen corresponding path program 1 times
[2024-03-11 21:46:33,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 21:46:33,114 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826870370]
[2024-03-11 21:46:33,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 21:46:33,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 21:46:33,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 21:46:33,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 21:46:33,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 21:46:33,365 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826870370]
[2024-03-11 21:46:33,365 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826870370] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 21:46:33,365 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 21:46:33,365 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-03-11 21:46:33,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813506018]
[2024-03-11 21:46:33,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 21:46:33,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-11 21:46:33,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 21:46:33,367 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-11 21:46:33,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-03-11 21:46:34,059 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250
[2024-03-11 21:46:34,060 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 396 transitions, 3125 flow. Second operand  has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 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 21:46:34,060 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 21:46:34,060 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250
[2024-03-11 21:46:34,060 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
