./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-2.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-2.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 588c01face7baa7cf65cc649c1ffef36a83824bf6956581c1ca3de7e95a23299
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-01 16:05:02,037 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-01 16:05:02,039 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-01 16:05:02,184 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-01 16:05:02,185 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-01 16:05:02,186 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-01 16:05:02,188 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-01 16:05:02,189 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-01 16:05:02,191 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-01 16:05:02,191 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-01 16:05:02,192 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-01 16:05:02,193 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-01 16:05:02,193 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-01 16:05:02,194 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-01 16:05:02,195 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-01 16:05:02,196 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-01 16:05:02,197 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-01 16:05:02,198 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-01 16:05:02,199 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-01 16:05:02,201 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-01 16:05:02,202 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-01 16:05:02,203 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-01 16:05:02,204 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-01 16:05:02,205 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-01 16:05:02,207 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-01 16:05:02,208 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-01 16:05:02,208 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-01 16:05:02,209 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-01 16:05:02,209 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-01 16:05:02,210 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-01 16:05:02,210 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-01 16:05:02,211 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-01 16:05:02,212 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-01 16:05:02,213 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-01 16:05:02,213 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-01 16:05:02,214 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-01 16:05:02,214 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-01 16:05:02,214 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-01 16:05:02,215 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-01 16:05:02,215 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-01 16:05:02,216 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-01 16:05:02,217 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-01 16:05:02,251 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-01 16:05:02,251 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-01 16:05:02,251 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-01 16:05:02,252 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-01 16:05:02,252 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-01 16:05:02,252 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-01 16:05:02,253 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-01 16:05:02,253 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-01 16:05:02,253 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-01 16:05:02,253 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-01 16:05:02,253 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-01 16:05:02,253 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-01 16:05:02,253 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-01 16:05:02,254 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-01 16:05:02,254 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-01 16:05:02,254 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-01 16:05:02,254 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-01 16:05:02,254 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-01 16:05:02,254 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-01 16:05:02,254 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-01 16:05:02,254 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-01 16:05:02,267 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-01 16:05:02,268 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-01 16:05:02,268 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-01 16:05:02,268 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-01 16:05:02,268 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-01 16:05:02,268 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 16:05:02,268 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-01 16:05:02,269 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-01 16:05:02,269 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-01 16:05:02,269 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-01 16:05:02,269 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-01 16:05:02,269 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-01 16:05:02,269 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-01 16:05:02,269 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-01 16:05:02,269 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-01 16:05:02,270 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-01 16:05:02,270 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 -> 588c01face7baa7cf65cc649c1ffef36a83824bf6956581c1ca3de7e95a23299
[2023-11-01 16:05:03,518 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-01 16:05:03,856 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-01 16:05:03,860 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-01 16:05:03,861 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-01 16:05:03,862 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-01 16:05:03,863 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i
[2023-11-01 16:05:06,244 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-01 16:05:06,441 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-01 16:05:06,441 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i
[2023-11-01 16:05:06,537 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/71302cedc/8d27aa97f6fb4e2c9a27854a7a6f57c3/FLAG63dc519c2
[2023-11-01 16:05:06,796 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/71302cedc/8d27aa97f6fb4e2c9a27854a7a6f57c3
[2023-11-01 16:05:06,799 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-01 16:05:06,800 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-01 16:05:06,801 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-01 16:05:06,801 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-01 16:05:06,804 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-01 16:05:06,805 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:05:06" (1/1) ...
[2023-11-01 16:05:06,806 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf647f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:06, skipping insertion in model container
[2023-11-01 16:05:06,806 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:05:06" (1/1) ...
[2023-11-01 16:05:06,811 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-01 16:05:06,857 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-01 16:05:06,972 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-01 16:05:07,105 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 16:05:07,112 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-01 16:05:07,126 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-01 16:05:07,161 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 16:05:07,201 INFO  L208         MainTranslator]: Completed translation
[2023-11-01 16:05:07,202 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07 WrapperNode
[2023-11-01 16:05:07,202 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-01 16:05:07,203 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-01 16:05:07,203 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-01 16:05:07,203 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-01 16:05:07,228 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,249 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,268 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2023-11-01 16:05:07,269 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-01 16:05:07,269 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-01 16:05:07,269 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-01 16:05:07,270 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-01 16:05:07,322 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,323 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,329 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,329 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,336 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,339 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,341 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,342 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,344 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-01 16:05:07,345 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-01 16:05:07,345 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-01 16:05:07,345 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-01 16:05:07,346 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (1/1) ...
[2023-11-01 16:05:07,376 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 16:05:07,386 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:05:07,402 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-01 16:05:07,406 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-01 16:05:07,652 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-01 16:05:07,652 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-01 16:05:07,652 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-01 16:05:07,652 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-01 16:05:07,653 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-01 16:05:07,653 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-01 16:05:07,653 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-01 16:05:07,654 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-01 16:05:07,654 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-01 16:05:07,654 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-01 16:05:07,654 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-01 16:05:07,658 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-01 16:05:08,155 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-01 16:05:08,158 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-01 16:05:08,516 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-01 16:05:08,523 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-01 16:05:08,523 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-01 16:05:08,524 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:05:08 BoogieIcfgContainer
[2023-11-01 16:05:08,524 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-01 16:05:08,526 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-01 16:05:08,526 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-01 16:05:08,627 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-01 16:05:08,627 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 04:05:06" (1/3) ...
[2023-11-01 16:05:08,628 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba91eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:05:08, skipping insertion in model container
[2023-11-01 16:05:08,628 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:05:07" (2/3) ...
[2023-11-01 16:05:08,628 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba91eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:05:08, skipping insertion in model container
[2023-11-01 16:05:08,628 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:05:08" (3/3) ...
[2023-11-01 16:05:08,630 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race-2.i
[2023-11-01 16:05:08,639 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-01 16:05:08,654 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-01 16:05:08,654 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-11-01 16:05:08,654 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-01 16:05:08,714 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-01 16:05:08,770 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2023-11-01 16:05:08,872 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2023-11-01 16:05:08,873 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 16:05:08,877 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 6/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-11-01 16:05:08,877 INFO  L82        GeneralOperation]: Start removeDead. Operand has 114 places, 115 transitions, 238 flow
[2023-11-01 16:05:08,881 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 114 places, 115 transitions, 238 flow
[2023-11-01 16:05:08,883 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 16:05:08,891 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 115 transitions, 238 flow
[2023-11-01 16:05:08,893 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 238 flow
[2023-11-01 16:05:08,893 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2023-11-01 16:05:08,918 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2023-11-01 16:05:08,918 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 16:05:08,919 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 6/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-11-01 16:05:08,921 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2052
[2023-11-01 16:05:11,283 INFO  L134        LiptonReduction]: Checked pairs total: 12265
[2023-11-01 16:05:11,283 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-11-01 16:05:11,297 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 16:05:11,302 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;@1f2b8c68, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 16:05:11,302 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-11-01 16:05:11,303 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-11-01 16:05:11,303 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 16:05:11,303 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:11,304 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-01 16:05:11,304 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)] ===
[2023-11-01 16:05:11,308 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:11,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 381, now seen corresponding path program 1 times
[2023-11-01 16:05:11,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:11,317 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104463107]
[2023-11-01 16:05:11,317 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:11,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:11,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:11,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:11,569 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:11,569 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104463107]
[2023-11-01 16:05:11,570 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104463107] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:11,570 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:11,570 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-01 16:05:11,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928164026]
[2023-11-01 16:05:11,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:11,604 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-01 16:05:11,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:11,624 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-01 16:05:11,625 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-01 16:05:11,627 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193
[2023-11-01 16:05:11,629 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:11,629 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:11,629 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193
[2023-11-01 16:05:11,630 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:11,694 INFO  L130       PetriNetUnfolder]: 33/213 cut-off events.
[2023-11-01 16:05:11,694 INFO  L131       PetriNetUnfolder]: For 4/7 co-relation queries the response was YES.
[2023-11-01 16:05:11,695 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 213 events. 33/213 cut-off events. For 4/7 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. 
[2023-11-01 16:05:11,697 INFO  L137   encePairwiseOnDemand]: 192/193 looper letters, 16 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2023-11-01 16:05:11,698 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 138 flow
[2023-11-01 16:05:11,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-01 16:05:11,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-01 16:05:11,709 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions.
[2023-11-01 16:05:11,712 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6139896373056994
[2023-11-01 16:05:11,712 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 237 transitions.
[2023-11-01 16:05:11,713 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions.
[2023-11-01 16:05:11,714 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:11,716 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions.
[2023-11-01 16:05:11,718 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:11,722 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:11,722 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:11,724 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 237 transitions.
[2023-11-01 16:05:11,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 138 flow
[2023-11-01 16:05:11,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:11,728 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2023-11-01 16:05:11,729 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, 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}
[2023-11-01 16:05:11,733 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2023-11-01 16:05:11,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2023-11-01 16:05:11,734 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:11,734 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:11,734 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:11,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-01 16:05:11,734 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)] ===
[2023-11-01 16:05:11,735 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:11,735 INFO  L85        PathProgramCache]: Analyzing trace with hash -835068003, now seen corresponding path program 1 times
[2023-11-01 16:05:11,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:11,735 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903479415]
[2023-11-01 16:05:11,735 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:11,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:11,774 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:12,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:12,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:12,081 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903479415]
[2023-11-01 16:05:12,081 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903479415] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:12,081 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:12,081 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:05:12,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987325848]
[2023-11-01 16:05:12,081 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:12,082 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:05:12,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:12,083 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:05:12,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:05:12,288 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-11-01 16:05:12,288 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:12,289 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:12,289 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-11-01 16:05:12,289 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:12,502 INFO  L130       PetriNetUnfolder]: 245/703 cut-off events.
[2023-11-01 16:05:12,502 INFO  L131       PetriNetUnfolder]: For 7/9 co-relation queries the response was YES.
[2023-11-01 16:05:12,505 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 703 events. 245/703 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4008 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. 
[2023-11-01 16:05:12,509 INFO  L137   encePairwiseOnDemand]: 170/193 looper letters, 61 selfloop transitions, 29 changer transitions 0/102 dead transitions.
[2023-11-01 16:05:12,509 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 395 flow
[2023-11-01 16:05:12,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:05:12,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:05:12,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions.
[2023-11-01 16:05:12,516 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5207253886010362
[2023-11-01 16:05:12,516 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 603 transitions.
[2023-11-01 16:05:12,516 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 603 transitions.
[2023-11-01 16:05:12,517 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:12,517 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 603 transitions.
[2023-11-01 16:05:12,520 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 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)
[2023-11-01 16:05:12,522 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:12,523 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:12,523 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 603 transitions.
[2023-11-01 16:05:12,523 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 395 flow
[2023-11-01 16:05:12,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:12,526 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2023-11-01 16:05:12,526 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, 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}
[2023-11-01 16:05:12,527 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2023-11-01 16:05:12,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2023-11-01 16:05:12,527 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:12,527 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:12,527 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:12,528 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-01 16:05:12,528 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)] ===
[2023-11-01 16:05:12,528 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:12,528 INFO  L85        PathProgramCache]: Analyzing trace with hash 1573274442, now seen corresponding path program 1 times
[2023-11-01 16:05:12,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:12,529 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257602576]
[2023-11-01 16:05:12,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:12,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:12,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:12,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:12,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:12,562 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257602576]
[2023-11-01 16:05:12,563 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257602576] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:12,563 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:12,563 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 16:05:12,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575038792]
[2023-11-01 16:05:12,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:12,564 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 16:05:12,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:12,565 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 16:05:12,565 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 16:05:12,585 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 193
[2023-11-01 16:05:12,585 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:12,585 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:12,585 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 193
[2023-11-01 16:05:12,586 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:12,676 INFO  L130       PetriNetUnfolder]: 122/485 cut-off events.
[2023-11-01 16:05:12,676 INFO  L131       PetriNetUnfolder]: For 111/116 co-relation queries the response was YES.
[2023-11-01 16:05:12,678 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 485 events. 122/485 cut-off events. For 111/116 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2711 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. 
[2023-11-01 16:05:12,680 INFO  L137   encePairwiseOnDemand]: 189/193 looper letters, 24 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2023-11-01 16:05:12,680 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 392 flow
[2023-11-01 16:05:12,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 16:05:12,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 16:05:12,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions.
[2023-11-01 16:05:12,681 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5785837651122625
[2023-11-01 16:05:12,681 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 335 transitions.
[2023-11-01 16:05:12,682 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions.
[2023-11-01 16:05:12,682 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:12,682 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions.
[2023-11-01 16:05:12,683 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:12,684 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:12,685 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:12,685 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 335 transitions.
[2023-11-01 16:05:12,685 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 392 flow
[2023-11-01 16:05:12,689 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:12,690 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2023-11-01 16:05:12,690 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, 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}
[2023-11-01 16:05:12,691 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2023-11-01 16:05:12,691 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2023-11-01 16:05:12,691 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:12,691 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:12,691 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:12,692 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-01 16:05:12,692 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)] ===
[2023-11-01 16:05:12,692 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:12,692 INFO  L85        PathProgramCache]: Analyzing trace with hash 348753171, now seen corresponding path program 1 times
[2023-11-01 16:05:12,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:12,693 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115067047]
[2023-11-01 16:05:12,693 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:12,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:12,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:12,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:12,896 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:12,896 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115067047]
[2023-11-01 16:05:12,897 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115067047] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:12,897 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:12,897 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:05:12,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203178417]
[2023-11-01 16:05:12,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:12,897 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:05:12,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:12,898 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:05:12,898 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:05:13,081 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193
[2023-11-01 16:05:13,083 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:13,083 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:13,083 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193
[2023-11-01 16:05:13,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:13,270 INFO  L130       PetriNetUnfolder]: 228/682 cut-off events.
[2023-11-01 16:05:13,270 INFO  L131       PetriNetUnfolder]: For 296/304 co-relation queries the response was YES.
[2023-11-01 16:05:13,272 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 682 events. 228/682 cut-off events. For 296/304 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3726 event pairs, 57 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 1748. Up to 360 conditions per place. 
[2023-11-01 16:05:13,275 INFO  L137   encePairwiseOnDemand]: 182/193 looper letters, 52 selfloop transitions, 33 changer transitions 8/128 dead transitions.
[2023-11-01 16:05:13,276 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 725 flow
[2023-11-01 16:05:13,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:05:13,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:05:13,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2023-11-01 16:05:13,278 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5483592400690847
[2023-11-01 16:05:13,278 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2023-11-01 16:05:13,278 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2023-11-01 16:05:13,279 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:13,279 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2023-11-01 16:05:13,280 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:13,282 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:13,283 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:13,283 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2023-11-01 16:05:13,283 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 725 flow
[2023-11-01 16:05:13,286 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:13,288 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2023-11-01 16:05:13,288 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, 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}
[2023-11-01 16:05:13,288 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2023-11-01 16:05:13,289 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2023-11-01 16:05:13,289 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:13,289 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:13,289 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:13,289 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-01 16:05:13,289 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-01 16:05:13,290 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:13,290 INFO  L85        PathProgramCache]: Analyzing trace with hash -1543790880, now seen corresponding path program 1 times
[2023-11-01 16:05:13,290 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:13,290 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544866977]
[2023-11-01 16:05:13,290 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:13,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:13,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:13,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:13,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:13,536 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544866977]
[2023-11-01 16:05:13,536 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544866977] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:13,536 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:13,536 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:05:13,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458609178]
[2023-11-01 16:05:13,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:13,537 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:05:13,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:13,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:05:13,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:05:13,671 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193
[2023-11-01 16:05:13,671 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)
[2023-11-01 16:05:13,671 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:13,672 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193
[2023-11-01 16:05:13,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:14,096 INFO  L130       PetriNetUnfolder]: 402/1014 cut-off events.
[2023-11-01 16:05:14,097 INFO  L131       PetriNetUnfolder]: For 761/769 co-relation queries the response was YES.
[2023-11-01 16:05:14,099 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1014 events. 402/1014 cut-off events. For 761/769 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6010 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. 
[2023-11-01 16:05:14,103 INFO  L137   encePairwiseOnDemand]: 171/193 looper letters, 105 selfloop transitions, 76 changer transitions 24/218 dead transitions.
[2023-11-01 16:05:14,103 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 218 transitions, 1523 flow
[2023-11-01 16:05:14,104 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:05:14,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:05:14,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions.
[2023-11-01 16:05:14,107 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5474956822107081
[2023-11-01 16:05:14,107 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 634 transitions.
[2023-11-01 16:05:14,108 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions.
[2023-11-01 16:05:14,108 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:14,109 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions.
[2023-11-01 16:05:14,112 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)
[2023-11-01 16:05:14,115 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:14,116 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:14,116 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 634 transitions.
[2023-11-01 16:05:14,116 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 218 transitions, 1523 flow
[2023-11-01 16:05:14,123 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 218 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:14,126 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2023-11-01 16:05:14,126 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, 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}
[2023-11-01 16:05:14,127 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2023-11-01 16:05:14,127 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2023-11-01 16:05:14,127 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)
[2023-11-01 16:05:14,127 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:14,127 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-11-01 16:05:14,128 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-01 16:05:14,128 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)] ===
[2023-11-01 16:05:14,128 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:14,128 INFO  L85        PathProgramCache]: Analyzing trace with hash -1557923308, now seen corresponding path program 1 times
[2023-11-01 16:05:14,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:14,129 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322504499]
[2023-11-01 16:05:14,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:14,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:14,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 16:05:14,154 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 16:05:14,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 16:05:14,184 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 16:05:14,184 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 16:05:14,185 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-11-01 16:05:14,186 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-11-01 16:05:14,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-11-01 16:05:14,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-11-01 16:05:14,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-11-01 16:05:14,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-11-01 16:05:14,187 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-11-01 16:05:14,188 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-11-01 16:05:14,188 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-11-01 16:05:14,188 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-11-01 16:05:14,188 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-11-01 16:05:14,188 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-01 16:05:14,188 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:14,190 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 16:05:14,190 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-01 16:05:14,209 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-01 16:05:14,211 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2023-11-01 16:05:14,229 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2023-11-01 16:05:14,229 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 16:05:14,229 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 289 events. 11/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. 
[2023-11-01 16:05:14,230 INFO  L82        GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 288 flow
[2023-11-01 16:05:14,231 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 135 places, 135 transitions, 288 flow
[2023-11-01 16:05:14,231 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 16:05:14,231 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 135 transitions, 288 flow
[2023-11-01 16:05:14,231 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 135 transitions, 288 flow
[2023-11-01 16:05:14,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2023-11-01 16:05:14,248 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2023-11-01 16:05:14,248 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 16:05:14,248 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 289 events. 11/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. 
[2023-11-01 16:05:14,252 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5220
[2023-11-01 16:05:16,196 INFO  L134        LiptonReduction]: Checked pairs total: 30411
[2023-11-01 16:05:16,196 INFO  L136        LiptonReduction]: Total number of compositions: 82
[2023-11-01 16:05:16,199 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 16:05:16,200 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;@1f2b8c68, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 16:05:16,200 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-01 16:05:16,201 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-11-01 16:05:16,202 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 16:05:16,202 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:16,202 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-01 16:05:16,202 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)] ===
[2023-11-01 16:05:16,203 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:16,203 INFO  L85        PathProgramCache]: Analyzing trace with hash 617, now seen corresponding path program 1 times
[2023-11-01 16:05:16,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:16,204 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249597167]
[2023-11-01 16:05:16,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:16,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:16,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:16,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:16,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:16,210 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249597167]
[2023-11-01 16:05:16,210 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249597167] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:16,210 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:16,210 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-01 16:05:16,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879722326]
[2023-11-01 16:05:16,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:16,210 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-01 16:05:16,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:16,211 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-01 16:05:16,211 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-01 16:05:16,211 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 217
[2023-11-01 16:05:16,212 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:16,212 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:16,212 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 217
[2023-11-01 16:05:16,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:16,351 INFO  L130       PetriNetUnfolder]: 411/1257 cut-off events.
[2023-11-01 16:05:16,351 INFO  L131       PetriNetUnfolder]: For 71/158 co-relation queries the response was YES.
[2023-11-01 16:05:16,353 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 8092 event pairs, 404 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 1664. Up to 731 conditions per place. 
[2023-11-01 16:05:16,357 INFO  L137   encePairwiseOnDemand]: 216/217 looper letters, 22 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2023-11-01 16:05:16,357 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 188 flow
[2023-11-01 16:05:16,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-01 16:05:16,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-01 16:05:16,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions.
[2023-11-01 16:05:16,359 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6428571428571429
[2023-11-01 16:05:16,359 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 279 transitions.
[2023-11-01 16:05:16,359 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 279 transitions.
[2023-11-01 16:05:16,359 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:16,359 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 279 transitions.
[2023-11-01 16:05:16,360 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:16,360 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:16,361 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:16,361 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 279 transitions.
[2023-11-01 16:05:16,361 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 188 flow
[2023-11-01 16:05:16,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:16,362 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2023-11-01 16:05:16,362 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, 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}
[2023-11-01 16:05:16,363 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2023-11-01 16:05:16,363 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2023-11-01 16:05:16,363 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:16,363 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:16,363 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:16,364 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-01 16:05:16,364 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)] ===
[2023-11-01 16:05:16,364 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:16,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578260816, now seen corresponding path program 1 times
[2023-11-01 16:05:16,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:16,364 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044680822]
[2023-11-01 16:05:16,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:16,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:16,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:16,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:16,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:16,523 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044680822]
[2023-11-01 16:05:16,523 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044680822] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:16,523 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:16,523 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:05:16,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763390715]
[2023-11-01 16:05:16,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:16,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:05:16,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:16,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:05:16,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:05:16,733 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217
[2023-11-01 16:05:16,734 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:16,734 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:16,734 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217
[2023-11-01 16:05:16,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:17,720 INFO  L130       PetriNetUnfolder]: 5742/10965 cut-off events.
[2023-11-01 16:05:17,721 INFO  L131       PetriNetUnfolder]: For 239/274 co-relation queries the response was YES.
[2023-11-01 16:05:17,730 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 81958 event pairs, 1527 based on Foata normal form. 16/10301 useless extension candidates. Maximal degree in co-relation 20641. Up to 5895 conditions per place. 
[2023-11-01 16:05:17,765 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 93 selfloop transitions, 48 changer transitions 0/158 dead transitions.
[2023-11-01 16:05:17,765 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 158 transitions, 627 flow
[2023-11-01 16:05:17,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:05:17,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:05:17,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions.
[2023-11-01 16:05:17,771 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5668202764976958
[2023-11-01 16:05:17,771 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 738 transitions.
[2023-11-01 16:05:17,771 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions.
[2023-11-01 16:05:17,772 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:17,773 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions.
[2023-11-01 16:05:17,775 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:17,778 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:17,779 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:17,779 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 738 transitions.
[2023-11-01 16:05:17,779 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 158 transitions, 627 flow
[2023-11-01 16:05:17,781 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:17,783 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2023-11-01 16:05:17,783 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, 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}
[2023-11-01 16:05:17,784 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-11-01 16:05:17,784 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2023-11-01 16:05:17,784 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:17,784 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:17,785 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:17,785 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-01 16:05:17,785 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)] ===
[2023-11-01 16:05:17,785 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:17,785 INFO  L85        PathProgramCache]: Analyzing trace with hash 933296301, now seen corresponding path program 1 times
[2023-11-01 16:05:17,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:17,785 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427267909]
[2023-11-01 16:05:17,786 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:17,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:17,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:17,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:17,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:17,822 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427267909]
[2023-11-01 16:05:17,822 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427267909] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:17,822 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:17,822 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 16:05:17,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102923150]
[2023-11-01 16:05:17,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:17,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 16:05:17,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:17,824 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 16:05:17,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 16:05:17,836 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2023-11-01 16:05:17,836 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:17,836 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:17,836 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2023-11-01 16:05:17,836 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:18,282 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_71| v_~datas~0.base_81)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_29 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_30| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_71))) (= |v_threadThread1of2ForFork0_#t~nondet4_30| (select .cse0 (+ .cse1 v_~datas~0.offset_71))) (= (select .cse0 (+ .cse1 v_~datas~0.offset_71 1)) |v_threadThread1of2ForFork0_#t~nondet4_30|) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#res.base_9| 0) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_71)) |v_threadThread1of2ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_71|, ~datas~0.base=v_~datas~0.base_81, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_29, ~datas~0.offset=v_~datas~0.offset_71, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_30|}  OutVars{#race=|v_#race_71|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_17|, ~datas~0.base=v_~datas~0.base_81, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_29, ~datas~0.offset=v_~datas~0.offset_71}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [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|) (+ 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)), 141#true, 2#ULTIMATE.startEXITtrue, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, Black: 145#(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: 144#(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)), 138#true, threadThread2of2ForFork0InUse, 47#threadEXITtrue, 21#L1016-4true, 155#(= |#race~datas~0| 0)])
[2023-11-01 16:05:18,283 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-01 16:05:18,283 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 16:05:18,283 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 16:05:18,283 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 16:05:18,283 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] 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_threadThread2of2ForFork0_~i~0_19 4) v_~datas~0.offset_51) |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_19}  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_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [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|) (+ 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)), 2#ULTIMATE.startEXITtrue, 141#true, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, Black: 145#(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)), 138#true, Black: 144#(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)), threadThread2of2ForFork0InUse, 123#L1016-6true, 64#L1016-9true, 155#(= |#race~datas~0| 0)])
[2023-11-01 16:05:18,284 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-11-01 16:05:18,284 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 16:05:18,284 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 16:05:18,284 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-11-01 16:05:18,397 INFO  L130       PetriNetUnfolder]: 2751/6463 cut-off events.
[2023-11-01 16:05:18,397 INFO  L131       PetriNetUnfolder]: For 1904/2456 co-relation queries the response was YES.
[2023-11-01 16:05:18,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14861 conditions, 6463 events. 2751/6463 cut-off events. For 1904/2456 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53231 event pairs, 924 based on Foata normal form. 125/6164 useless extension candidates. Maximal degree in co-relation 14851. Up to 2371 conditions per place. 
[2023-11-01 16:05:18,430 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2023-11-01 16:05:18,430 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2023-11-01 16:05:18,431 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 16:05:18,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 16:05:18,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions.
[2023-11-01 16:05:18,432 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5990783410138248
[2023-11-01 16:05:18,432 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 390 transitions.
[2023-11-01 16:05:18,432 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions.
[2023-11-01 16:05:18,432 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:18,432 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions.
[2023-11-01 16:05:18,433 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:18,434 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:18,434 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:18,434 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 390 transitions.
[2023-11-01 16:05:18,434 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2023-11-01 16:05:18,443 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:18,444 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2023-11-01 16:05:18,444 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, 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}
[2023-11-01 16:05:18,445 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-11-01 16:05:18,445 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2023-11-01 16:05:18,445 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:18,445 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:18,445 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:18,446 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-01 16:05:18,446 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)] ===
[2023-11-01 16:05:18,446 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:18,446 INFO  L85        PathProgramCache]: Analyzing trace with hash -2101318696, now seen corresponding path program 1 times
[2023-11-01 16:05:18,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:18,446 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025471028]
[2023-11-01 16:05:18,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:18,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:18,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:18,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:18,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:18,622 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025471028]
[2023-11-01 16:05:18,623 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025471028] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:18,623 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:18,623 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:05:18,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590072259]
[2023-11-01 16:05:18,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:18,624 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:05:18,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:18,624 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:05:18,624 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:05:18,790 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2023-11-01 16:05:18,790 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:18,790 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:18,790 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2023-11-01 16:05:18,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:20,011 INFO  L130       PetriNetUnfolder]: 5675/10752 cut-off events.
[2023-11-01 16:05:20,012 INFO  L131       PetriNetUnfolder]: For 6509/6607 co-relation queries the response was YES.
[2023-11-01 16:05:20,030 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28674 conditions, 10752 events. 5675/10752 cut-off events. For 6509/6607 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 79142 event pairs, 1877 based on Foata normal form. 0/10235 useless extension candidates. Maximal degree in co-relation 28663. Up to 6983 conditions per place. 
[2023-11-01 16:05:20,061 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 110 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2023-11-01 16:05:20,061 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1313 flow
[2023-11-01 16:05:20,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:05:20,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:05:20,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions.
[2023-11-01 16:05:20,064 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821812596006144
[2023-11-01 16:05:20,064 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 758 transitions.
[2023-11-01 16:05:20,064 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions.
[2023-11-01 16:05:20,064 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:20,064 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions.
[2023-11-01 16:05:20,065 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:20,067 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:20,067 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:20,067 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 758 transitions.
[2023-11-01 16:05:20,067 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1313 flow
[2023-11-01 16:05:20,075 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:20,077 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2023-11-01 16:05:20,077 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, 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}
[2023-11-01 16:05:20,078 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2023-11-01 16:05:20,078 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2023-11-01 16:05:20,078 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:20,078 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:20,078 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:20,078 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-01 16:05:20,078 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 16:05:20,079 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:20,079 INFO  L85        PathProgramCache]: Analyzing trace with hash 1490734773, now seen corresponding path program 1 times
[2023-11-01 16:05:20,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:20,079 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390650548]
[2023-11-01 16:05:20,079 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:20,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:20,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:20,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:20,243 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:20,243 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390650548]
[2023-11-01 16:05:20,243 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390650548] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:20,244 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:20,244 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:05:20,244 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884613530]
[2023-11-01 16:05:20,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:20,244 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:05:20,244 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:20,244 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:05:20,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:05:20,375 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-11-01 16:05:20,376 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:20,376 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:20,376 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-11-01 16:05:20,376 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:22,698 INFO  L130       PetriNetUnfolder]: 11355/20109 cut-off events.
[2023-11-01 16:05:22,698 INFO  L131       PetriNetUnfolder]: For 18604/18765 co-relation queries the response was YES.
[2023-11-01 16:05:22,729 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64116 conditions, 20109 events. 11355/20109 cut-off events. For 18604/18765 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 151214 event pairs, 3272 based on Foata normal form. 0/18815 useless extension candidates. Maximal degree in co-relation 64100. Up to 13848 conditions per place. 
[2023-11-01 16:05:22,790 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 239 selfloop transitions, 132 changer transitions 0/389 dead transitions.
[2023-11-01 16:05:22,791 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 389 transitions, 2939 flow
[2023-11-01 16:05:22,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:05:22,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:05:22,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2023-11-01 16:05:22,793 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2023-11-01 16:05:22,793 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2023-11-01 16:05:22,794 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2023-11-01 16:05:22,794 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:22,794 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2023-11-01 16:05:22,795 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:22,797 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:22,797 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:22,797 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 778 transitions.
[2023-11-01 16:05:22,797 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 389 transitions, 2939 flow
[2023-11-01 16:05:22,827 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 389 transitions, 2939 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:22,831 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2023-11-01 16:05:22,831 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, 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}
[2023-11-01 16:05:22,831 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2023-11-01 16:05:22,832 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2023-11-01 16:05:22,832 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:22,832 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:22,832 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:22,832 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-01 16:05:22,832 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)] ===
[2023-11-01 16:05:22,833 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:22,833 INFO  L85        PathProgramCache]: Analyzing trace with hash -686777030, now seen corresponding path program 1 times
[2023-11-01 16:05:22,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:22,833 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332407583]
[2023-11-01 16:05:22,833 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:22,833 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:22,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:23,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-01 16:05:23,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:23,093 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332407583]
[2023-11-01 16:05:23,093 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332407583] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:05:23,093 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137342908]
[2023-11-01 16:05:23,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:23,093 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:05:23,094 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:05:23,095 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:05:23,100 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-01 16:05:23,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:23,214 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-11-01 16:05:23,220 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:05:23,363 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:05:23,395 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:23,396 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:05:23,443 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:23,445 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:23,446 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:05:23,489 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:23,490 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:23,491 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:23,492 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:05:23,545 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:23,546 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:05:23,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-01 16:05:23,578 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:05:23,612 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
[2023-11-01 16:05:23,637 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
[2023-11-01 16:05:23,668 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
[2023-11-01 16:05:23,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2023-11-01 16:05:23,734 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [137342908] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:05:23,734 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:05:23,734 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15
[2023-11-01 16:05:23,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889479574]
[2023-11-01 16:05:23,735 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:05:23,735 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2023-11-01 16:05:23,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:23,735 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2023-11-01 16:05:23,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=121, Unknown=3, NotChecked=78, Total=272
[2023-11-01 16:05:23,743 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 217
[2023-11-01 16:05:23,744 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 17 states, 17 states have (on average 81.3529411764706) internal successors, (1383), 17 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:23,745 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:23,745 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 217
[2023-11-01 16:05:23,745 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:26,788 INFO  L130       PetriNetUnfolder]: 14603/24245 cut-off events.
[2023-11-01 16:05:26,788 INFO  L131       PetriNetUnfolder]: For 41050/41050 co-relation queries the response was YES.
[2023-11-01 16:05:26,857 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94260 conditions, 24245 events. 14603/24245 cut-off events. For 41050/41050 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 173289 event pairs, 3234 based on Foata normal form. 162/22857 useless extension candidates. Maximal degree in co-relation 94239. Up to 14161 conditions per place. 
[2023-11-01 16:05:26,944 INFO  L137   encePairwiseOnDemand]: 207/217 looper letters, 500 selfloop transitions, 54 changer transitions 1/562 dead transitions.
[2023-11-01 16:05:26,944 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 562 transitions, 5374 flow
[2023-11-01 16:05:26,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-01 16:05:26,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-01 16:05:26,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions.
[2023-11-01 16:05:26,946 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46017116524028967
[2023-11-01 16:05:26,946 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 699 transitions.
[2023-11-01 16:05:26,946 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions.
[2023-11-01 16:05:26,946 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:26,947 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions.
[2023-11-01 16:05:26,948 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:26,949 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:26,950 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:26,950 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 699 transitions.
[2023-11-01 16:05:26,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 562 transitions, 5374 flow
[2023-11-01 16:05:27,269 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 562 transitions, 5278 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:27,275 INFO  L231             Difference]: Finished difference. Result has 102 places, 314 transitions, 2506 flow
[2023-11-01 16:05:27,275 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2506, PETRI_PLACES=102, PETRI_TRANSITIONS=314}
[2023-11-01 16:05:27,276 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 35 predicate places.
[2023-11-01 16:05:27,276 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 314 transitions, 2506 flow
[2023-11-01 16:05:27,276 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 81.3529411764706) internal successors, (1383), 17 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:27,277 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:27,277 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:05:27,300 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-01 16:05:27,477 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
[2023-11-01 16:05:27,478 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 16:05:27,479 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:27,479 INFO  L85        PathProgramCache]: Analyzing trace with hash -1154275821, now seen corresponding path program 1 times
[2023-11-01 16:05:27,479 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:27,480 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682016801]
[2023-11-01 16:05:27,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:27,480 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:27,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:27,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 16:05:27,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:27,805 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682016801]
[2023-11-01 16:05:27,805 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682016801] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:27,805 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:27,805 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-01 16:05:27,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108725200]
[2023-11-01 16:05:27,805 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:27,805 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-01 16:05:27,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:27,806 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-01 16:05:27,806 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-01 16:05:28,232 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217
[2023-11-01 16:05:28,233 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 314 transitions, 2506 flow. Second operand  has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:28,234 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:28,234 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217
[2023-11-01 16:05:28,234 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:31,694 INFO  L130       PetriNetUnfolder]: 13820/24388 cut-off events.
[2023-11-01 16:05:31,695 INFO  L131       PetriNetUnfolder]: For 46821/46988 co-relation queries the response was YES.
[2023-11-01 16:05:31,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97397 conditions, 24388 events. 13820/24388 cut-off events. For 46821/46988 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 189768 event pairs, 3201 based on Foata normal form. 348/24232 useless extension candidates. Maximal degree in co-relation 97374. Up to 11426 conditions per place. 
[2023-11-01 16:05:31,891 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 462 selfloop transitions, 166 changer transitions 2/647 dead transitions.
[2023-11-01 16:05:31,891 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 647 transitions, 6020 flow
[2023-11-01 16:05:31,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-01 16:05:31,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-01 16:05:31,893 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 973 transitions.
[2023-11-01 16:05:31,894 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5604838709677419
[2023-11-01 16:05:31,894 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 973 transitions.
[2023-11-01 16:05:31,894 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 973 transitions.
[2023-11-01 16:05:31,894 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:31,894 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 973 transitions.
[2023-11-01 16:05:31,896 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 121.625) internal successors, (973), 8 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:31,898 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:31,899 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:31,899 INFO  L175             Difference]: Start difference. First operand has 102 places, 314 transitions, 2506 flow. Second operand 8 states and 973 transitions.
[2023-11-01 16:05:31,899 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 647 transitions, 6020 flow
[2023-11-01 16:05:32,107 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 647 transitions, 5921 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-01 16:05:32,113 INFO  L231             Difference]: Finished difference. Result has 111 places, 430 transitions, 4113 flow
[2023-11-01 16:05:32,114 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4113, PETRI_PLACES=111, PETRI_TRANSITIONS=430}
[2023-11-01 16:05:32,114 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 44 predicate places.
[2023-11-01 16:05:32,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 430 transitions, 4113 flow
[2023-11-01 16:05:32,114 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:32,115 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:32,115 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]
[2023-11-01 16:05:32,115 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-01 16:05:32,115 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 16:05:32,115 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:32,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 340394548, now seen corresponding path program 1 times
[2023-11-01 16:05:32,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:32,115 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057426584]
[2023-11-01 16:05:32,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:32,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:32,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:32,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:32,170 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:32,170 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057426584]
[2023-11-01 16:05:32,170 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057426584] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:05:32,170 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80991153]
[2023-11-01 16:05:32,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:32,171 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:05:32,171 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:05:32,172 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:05:32,174 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-01 16:05:32,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:32,281 INFO  L263         TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-01 16:05:32,283 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:05:32,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:32,320 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:05:32,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:32,351 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [80991153] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:05:32,351 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:05:32,351 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2023-11-01 16:05:32,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438783461]
[2023-11-01 16:05:32,352 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:05:32,352 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-01 16:05:32,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:32,352 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-01 16:05:32,352 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2023-11-01 16:05:32,438 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2023-11-01 16:05:32,439 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 430 transitions, 4113 flow. Second operand  has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:32,439 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:32,439 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2023-11-01 16:05:32,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:33,992 INFO  L130       PetriNetUnfolder]: 5754/12879 cut-off events.
[2023-11-01 16:05:33,992 INFO  L131       PetriNetUnfolder]: For 42930/44884 co-relation queries the response was YES.
[2023-11-01 16:05:34,046 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55285 conditions, 12879 events. 5754/12879 cut-off events. For 42930/44884 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 112065 event pairs, 470 based on Foata normal form. 202/12746 useless extension candidates. Maximal degree in co-relation 55256. Up to 5114 conditions per place. 
[2023-11-01 16:05:34,095 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 152 selfloop transitions, 5 changer transitions 23/483 dead transitions.
[2023-11-01 16:05:34,096 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 483 transitions, 4821 flow
[2023-11-01 16:05:34,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-01 16:05:34,096 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-01 16:05:34,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions.
[2023-11-01 16:05:34,098 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5766951942067149
[2023-11-01 16:05:34,098 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 876 transitions.
[2023-11-01 16:05:34,098 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions.
[2023-11-01 16:05:34,099 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:34,099 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions.
[2023-11-01 16:05:34,100 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:34,102 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:34,102 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:34,102 INFO  L175             Difference]: Start difference. First operand has 111 places, 430 transitions, 4113 flow. Second operand 7 states and 876 transitions.
[2023-11-01 16:05:34,102 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 483 transitions, 4821 flow
[2023-11-01 16:05:34,309 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 483 transitions, 4807 flow, removed 7 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:34,314 INFO  L231             Difference]: Finished difference. Result has 120 places, 390 transitions, 3685 flow
[2023-11-01 16:05:34,315 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3757, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3685, PETRI_PLACES=120, PETRI_TRANSITIONS=390}
[2023-11-01 16:05:34,315 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 53 predicate places.
[2023-11-01 16:05:34,315 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 390 transitions, 3685 flow
[2023-11-01 16:05:34,316 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:34,316 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:34,316 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]
[2023-11-01 16:05:34,324 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-01 16:05:34,516 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:05:34,517 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 16:05:34,517 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:34,517 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108254852, now seen corresponding path program 1 times
[2023-11-01 16:05:34,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:34,518 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443786572]
[2023-11-01 16:05:34,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:34,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:34,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:34,752 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 16:05:34,753 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:34,753 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443786572]
[2023-11-01 16:05:34,753 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443786572] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:34,753 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:34,753 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-01 16:05:34,753 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319176802]
[2023-11-01 16:05:34,753 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:34,754 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-01 16:05:34,754 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:34,754 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-01 16:05:34,754 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-01 16:05:35,050 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-11-01 16:05:35,051 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 390 transitions, 3685 flow. Second operand  has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:35,051 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:35,051 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-11-01 16:05:35,051 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:37,055 INFO  L130       PetriNetUnfolder]: 8771/16346 cut-off events.
[2023-11-01 16:05:37,055 INFO  L131       PetriNetUnfolder]: For 65828/66223 co-relation queries the response was YES.
[2023-11-01 16:05:37,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77526 conditions, 16346 events. 8771/16346 cut-off events. For 65828/66223 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 123686 event pairs, 2787 based on Foata normal form. 240/16416 useless extension candidates. Maximal degree in co-relation 77493. Up to 13560 conditions per place. 
[2023-11-01 16:05:37,183 INFO  L137   encePairwiseOnDemand]: 209/217 looper letters, 343 selfloop transitions, 13 changer transitions 7/402 dead transitions.
[2023-11-01 16:05:37,184 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 402 transitions, 4497 flow
[2023-11-01 16:05:37,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-01 16:05:37,184 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-01 16:05:37,185 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions.
[2023-11-01 16:05:37,186 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48847926267281105
[2023-11-01 16:05:37,186 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 742 transitions.
[2023-11-01 16:05:37,186 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 742 transitions.
[2023-11-01 16:05:37,186 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:37,186 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 742 transitions.
[2023-11-01 16:05:37,187 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:37,189 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:37,189 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:37,190 INFO  L175             Difference]: Start difference. First operand has 120 places, 390 transitions, 3685 flow. Second operand 7 states and 742 transitions.
[2023-11-01 16:05:37,190 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 402 transitions, 4497 flow
[2023-11-01 16:05:37,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 402 transitions, 4408 flow, removed 6 selfloop flow, removed 3 redundant places.
[2023-11-01 16:05:37,424 INFO  L231             Difference]: Finished difference. Result has 122 places, 388 transitions, 3635 flow
[2023-11-01 16:05:37,424 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3635, PETRI_PLACES=122, PETRI_TRANSITIONS=388}
[2023-11-01 16:05:37,425 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 55 predicate places.
[2023-11-01 16:05:37,425 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 388 transitions, 3635 flow
[2023-11-01 16:05:37,425 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:37,426 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:37,426 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]
[2023-11-01 16:05:37,426 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-01 16:05:37,426 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 16:05:37,426 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:37,426 INFO  L85        PathProgramCache]: Analyzing trace with hash 860099489, now seen corresponding path program 1 times
[2023-11-01 16:05:37,426 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:37,426 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139113310]
[2023-11-01 16:05:37,426 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:37,427 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:37,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:37,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-01 16:05:37,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:37,611 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139113310]
[2023-11-01 16:05:37,611 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139113310] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:37,611 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:05:37,611 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:05:37,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371351896]
[2023-11-01 16:05:37,611 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:37,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:05:37,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:37,612 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:05:37,612 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:05:37,758 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-11-01 16:05:37,759 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 388 transitions, 3635 flow. Second operand  has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:37,759 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:37,759 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-11-01 16:05:37,759 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:41,457 INFO  L130       PetriNetUnfolder]: 12785/22892 cut-off events.
[2023-11-01 16:05:41,457 INFO  L131       PetriNetUnfolder]: For 82261/82659 co-relation queries the response was YES.
[2023-11-01 16:05:41,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105773 conditions, 22892 events. 12785/22892 cut-off events. For 82261/82659 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 175825 event pairs, 2816 based on Foata normal form. 45/21734 useless extension candidates. Maximal degree in co-relation 105739. Up to 17260 conditions per place. 
[2023-11-01 16:05:41,669 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 405 selfloop transitions, 156 changer transitions 18/594 dead transitions.
[2023-11-01 16:05:41,669 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 594 transitions, 6405 flow
[2023-11-01 16:05:41,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:05:41,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:05:41,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2023-11-01 16:05:41,671 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2023-11-01 16:05:41,671 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2023-11-01 16:05:41,671 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2023-11-01 16:05:41,672 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:41,672 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2023-11-01 16:05:41,673 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:41,675 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:41,675 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:41,675 INFO  L175             Difference]: Start difference. First operand has 122 places, 388 transitions, 3635 flow. Second operand 6 states and 778 transitions.
[2023-11-01 16:05:41,675 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 594 transitions, 6405 flow
[2023-11-01 16:05:42,079 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 594 transitions, 6347 flow, removed 1 selfloop flow, removed 3 redundant places.
[2023-11-01 16:05:42,085 INFO  L231             Difference]: Finished difference. Result has 128 places, 501 transitions, 5166 flow
[2023-11-01 16:05:42,086 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3601, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5166, PETRI_PLACES=128, PETRI_TRANSITIONS=501}
[2023-11-01 16:05:42,086 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 61 predicate places.
[2023-11-01 16:05:42,086 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 501 transitions, 5166 flow
[2023-11-01 16:05:42,087 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:42,087 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:42,087 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]
[2023-11-01 16:05:42,087 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-01 16:05:42,087 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 16:05:42,087 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:42,087 INFO  L85        PathProgramCache]: Analyzing trace with hash -907237555, now seen corresponding path program 1 times
[2023-11-01 16:05:42,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:42,088 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629661681]
[2023-11-01 16:05:42,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:42,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:42,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:43,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:43,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:43,188 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629661681]
[2023-11-01 16:05:43,188 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629661681] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:05:43,188 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259033070]
[2023-11-01 16:05:43,188 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:43,188 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:05:43,188 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:05:43,190 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:05:43,192 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-01 16:05:43,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:43,308 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-11-01 16:05:43,315 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:05:43,323 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
[2023-11-01 16:05:43,458 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-01 16:05:43,459 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
[2023-11-01 16:05:43,510 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
[2023-11-01 16:05:43,523 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
[2023-11-01 16:05:43,553 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
[2023-11-01 16:05:43,583 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
[2023-11-01 16:05:43,621 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:05:43,621 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
[2023-11-01 16:05:43,676 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:05:43,677 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
[2023-11-01 16:05:43,744 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
[2023-11-01 16:05:43,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 16:05:43,756 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-01 16:05:43,756 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259033070] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:43,756 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-01 16:05:43,756 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21
[2023-11-01 16:05:43,756 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238300107]
[2023-11-01 16:05:43,756 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:43,756 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-01 16:05:43,756 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:43,757 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-01 16:05:43,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506
[2023-11-01 16:05:44,206 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217
[2023-11-01 16:05:44,207 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 501 transitions, 5166 flow. Second operand  has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:44,207 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:44,207 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217
[2023-11-01 16:05:44,207 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:05:49,183 INFO  L130       PetriNetUnfolder]: 16066/28224 cut-off events.
[2023-11-01 16:05:49,183 INFO  L131       PetriNetUnfolder]: For 138124/138543 co-relation queries the response was YES.
[2023-11-01 16:05:49,311 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 145503 conditions, 28224 events. 16066/28224 cut-off events. For 138124/138543 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 221081 event pairs, 2413 based on Foata normal form. 232/28257 useless extension candidates. Maximal degree in co-relation 145465. Up to 10206 conditions per place. 
[2023-11-01 16:05:49,425 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 933 selfloop transitions, 283 changer transitions 35/1263 dead transitions.
[2023-11-01 16:05:49,425 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1263 transitions, 15728 flow
[2023-11-01 16:05:49,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-11-01 16:05:49,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-01 16:05:49,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1167 transitions.
[2023-11-01 16:05:49,429 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48889819857561795
[2023-11-01 16:05:49,429 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1167 transitions.
[2023-11-01 16:05:49,429 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1167 transitions.
[2023-11-01 16:05:49,429 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:05:49,429 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1167 transitions.
[2023-11-01 16:05:49,432 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 106.0909090909091) internal successors, (1167), 11 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:49,434 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:49,435 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:49,435 INFO  L175             Difference]: Start difference. First operand has 128 places, 501 transitions, 5166 flow. Second operand 11 states and 1167 transitions.
[2023-11-01 16:05:49,435 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 1263 transitions, 15728 flow
[2023-11-01 16:05:50,279 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1263 transitions, 15478 flow, removed 125 selfloop flow, removed 0 redundant places.
[2023-11-01 16:05:50,293 INFO  L231             Difference]: Finished difference. Result has 145 places, 755 transitions, 9363 flow
[2023-11-01 16:05:50,294 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=5000, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9363, PETRI_PLACES=145, PETRI_TRANSITIONS=755}
[2023-11-01 16:05:50,294 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 78 predicate places.
[2023-11-01 16:05:50,295 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 755 transitions, 9363 flow
[2023-11-01 16:05:50,295 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:50,295 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:05:50,295 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]
[2023-11-01 16:05:50,301 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-01 16:05:50,496 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,SelfDestructingSolverStorable16
[2023-11-01 16:05:50,496 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 16:05:50,497 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:05:50,497 INFO  L85        PathProgramCache]: Analyzing trace with hash -103982335, now seen corresponding path program 2 times
[2023-11-01 16:05:50,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:05:50,497 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709514042]
[2023-11-01 16:05:50,498 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:05:50,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:05:50,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:05:50,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:50,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:05:50,964 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709514042]
[2023-11-01 16:05:50,964 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709514042] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:05:50,964 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694237189]
[2023-11-01 16:05:50,964 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 16:05:50,964 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:05:50,965 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:05:50,966 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:05:50,968 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-01 16:05:51,104 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 16:05:51,105 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:05:51,106 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-11-01 16:05:51,110 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:05:51,120 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:51,125 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
[2023-11-01 16:05:51,254 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-01 16:05:51,255 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
[2023-11-01 16:05:51,288 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:51,289 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
[2023-11-01 16:05:51,304 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
[2023-11-01 16:05:51,347 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-11-01 16:05:51,401 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:05:51,401 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
[2023-11-01 16:05:51,519 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-01 16:05:51,562 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:51,563 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
[2023-11-01 16:05:51,590 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:05:51,590 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
[2023-11-01 16:05:51,649 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:51,650 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
[2023-11-01 16:05:51,681 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:51,683 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
[2023-11-01 16:05:51,713 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:05:51,713 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
[2023-11-01 16:05:51,764 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
[2023-11-01 16:05:51,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:05:51,776 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-01 16:05:51,776 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [694237189] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:05:51,776 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-01 16:05:51,776 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-11-01 16:05:51,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036554868]
[2023-11-01 16:05:51,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:05:51,777 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-01 16:05:51,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:05:51,778 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-01 16:05:51,778 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2023-11-01 16:05:52,587 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217
[2023-11-01 16:05:52,588 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 755 transitions, 9363 flow. Second operand  has 11 states, 11 states have (on average 91.18181818181819) internal successors, (1003), 11 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:05:52,588 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:05:52,588 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217
[2023-11-01 16:05:52,588 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:06:00,134 INFO  L130       PetriNetUnfolder]: 17180/30220 cut-off events.
[2023-11-01 16:06:00,134 INFO  L131       PetriNetUnfolder]: For 206398/206888 co-relation queries the response was YES.
[2023-11-01 16:06:00,313 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172995 conditions, 30220 events. 17180/30220 cut-off events. For 206398/206888 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 238311 event pairs, 2207 based on Foata normal form. 290/30331 useless extension candidates. Maximal degree in co-relation 172949. Up to 12901 conditions per place. 
[2023-11-01 16:06:00,443 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 838 selfloop transitions, 526 changer transitions 51/1427 dead transitions.
[2023-11-01 16:06:00,443 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 1427 transitions, 19203 flow
[2023-11-01 16:06:00,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-11-01 16:06:00,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2023-11-01 16:06:00,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1651 transitions.
[2023-11-01 16:06:00,447 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5072196620583718
[2023-11-01 16:06:00,447 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1651 transitions.
[2023-11-01 16:06:00,447 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1651 transitions.
[2023-11-01 16:06:00,448 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:06:00,448 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1651 transitions.
[2023-11-01 16:06:00,450 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 110.06666666666666) internal successors, (1651), 15 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:00,453 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:00,454 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:00,454 INFO  L175             Difference]: Start difference. First operand has 145 places, 755 transitions, 9363 flow. Second operand 15 states and 1651 transitions.
[2023-11-01 16:06:00,454 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 1427 transitions, 19203 flow
[2023-11-01 16:06:02,173 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 1427 transitions, 19137 flow, removed 25 selfloop flow, removed 2 redundant places.
[2023-11-01 16:06:02,188 INFO  L231             Difference]: Finished difference. Result has 163 places, 999 transitions, 14370 flow
[2023-11-01 16:06:02,188 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=9322, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14370, PETRI_PLACES=163, PETRI_TRANSITIONS=999}
[2023-11-01 16:06:02,189 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 96 predicate places.
[2023-11-01 16:06:02,189 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 999 transitions, 14370 flow
[2023-11-01 16:06:02,190 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 91.18181818181819) internal successors, (1003), 11 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:02,190 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:06:02,190 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]
[2023-11-01 16:06:02,198 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-01 16:06:02,390 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-11-01 16:06:02,392 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 16:06:02,392 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:06:02,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -1403000896, now seen corresponding path program 1 times
[2023-11-01 16:06:02,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:06:02,393 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579440507]
[2023-11-01 16:06:02,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:06:02,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:06:02,412 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:06:02,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:06:02,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:06:02,740 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579440507]
[2023-11-01 16:06:02,740 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579440507] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:06:02,740 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287051129]
[2023-11-01 16:06:02,740 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:06:02,741 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:06:02,741 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:06:02,742 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:06:02,745 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-11-01 16:06:02,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:06:02,863 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-11-01 16:06:02,867 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:06:02,879 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:02,883 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
[2023-11-01 16:06:02,989 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-01 16:06:02,989 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-11-01 16:06:03,012 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:03,013 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
[2023-11-01 16:06:03,041 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-01 16:06:03,056 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
[2023-11-01 16:06:03,065 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
[2023-11-01 16:06:03,078 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:06:03,079 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
[2023-11-01 16:06:03,097 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:06:03,097 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
[2023-11-01 16:06:03,118 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
[2023-11-01 16:06:03,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 16:06:03,131 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-01 16:06:03,131 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [287051129] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:06:03,131 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-01 16:06:03,131 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12
[2023-11-01 16:06:03,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812434196]
[2023-11-01 16:06:03,132 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:06:03,132 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-01 16:06:03,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:06:03,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-01 16:06:03,133 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2023-11-01 16:06:03,871 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217
[2023-11-01 16:06:03,872 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 999 transitions, 14370 flow. Second operand  has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:03,872 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:06:03,872 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217
[2023-11-01 16:06:03,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:06:10,649 INFO  L130       PetriNetUnfolder]: 14478/26890 cut-off events.
[2023-11-01 16:06:10,649 INFO  L131       PetriNetUnfolder]: For 258288/259655 co-relation queries the response was YES.
[2023-11-01 16:06:10,813 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 169027 conditions, 26890 events. 14478/26890 cut-off events. For 258288/259655 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 223662 event pairs, 1217 based on Foata normal form. 518/26956 useless extension candidates. Maximal degree in co-relation 168975. Up to 10035 conditions per place. 
[2023-11-01 16:06:10,928 INFO  L137   encePairwiseOnDemand]: 206/217 looper letters, 1230 selfloop transitions, 93 changer transitions 15/1486 dead transitions.
[2023-11-01 16:06:10,928 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1486 transitions, 23687 flow
[2023-11-01 16:06:10,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-01 16:06:10,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-01 16:06:10,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions.
[2023-11-01 16:06:10,931 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5412186379928315
[2023-11-01 16:06:10,931 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions.
[2023-11-01 16:06:10,931 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions.
[2023-11-01 16:06:10,931 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:06:10,931 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions.
[2023-11-01 16:06:10,933 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:10,934 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:10,935 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:10,935 INFO  L175             Difference]: Start difference. First operand has 163 places, 999 transitions, 14370 flow. Second operand 9 states and 1057 transitions.
[2023-11-01 16:06:10,935 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1486 transitions, 23687 flow
[2023-11-01 16:06:13,056 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 1486 transitions, 23017 flow, removed 328 selfloop flow, removed 3 redundant places.
[2023-11-01 16:06:13,073 INFO  L231             Difference]: Finished difference. Result has 165 places, 998 transitions, 13986 flow
[2023-11-01 16:06:13,073 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=13800, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13986, PETRI_PLACES=165, PETRI_TRANSITIONS=998}
[2023-11-01 16:06:13,073 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 98 predicate places.
[2023-11-01 16:06:13,074 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 998 transitions, 13986 flow
[2023-11-01 16:06:13,074 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:13,074 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:06:13,074 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]
[2023-11-01 16:06:13,082 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-11-01 16:06:13,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:06:13,275 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 16:06:13,276 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:06:13,276 INFO  L85        PathProgramCache]: Analyzing trace with hash 1127119439, now seen corresponding path program 3 times
[2023-11-01 16:06:13,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:06:13,276 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138368662]
[2023-11-01 16:06:13,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:06:13,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:06:13,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:06:13,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:06:13,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:06:13,677 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138368662]
[2023-11-01 16:06:13,677 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138368662] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:06:13,678 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571895762]
[2023-11-01 16:06:13,678 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-01 16:06:13,678 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:06:13,678 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:06:13,679 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:06:13,681 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-11-01 16:06:13,807 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-01 16:06:13,807 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:06:13,815 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 58 conjunts are in the unsatisfiable core
[2023-11-01 16:06:13,821 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:06:13,839 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
[2023-11-01 16:06:14,024 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-01 16:06:14,024 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
[2023-11-01 16:06:14,029 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:14,030 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
[2023-11-01 16:06:14,145 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
[2023-11-01 16:06:14,162 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
[2023-11-01 16:06:14,245 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
[2023-11-01 16:06:14,289 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
[2023-11-01 16:06:14,356 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
[2023-11-01 16:06:14,363 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
[2023-11-01 16:06:14,422 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
[2023-11-01 16:06:14,488 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
[2023-11-01 16:06:14,525 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
[2023-11-01 16:06:14,587 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
[2023-11-01 16:06:14,617 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
[2023-11-01 16:06:14,641 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
[2023-11-01 16:06:14,726 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
[2023-11-01 16:06:14,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:06:14,769 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:06:14,797 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_964 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-11-01 16:06:27,468 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_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))))))) is different from false
[2023-11-01 16:06:27,498 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse2))) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse0 c_~datas~0.base (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse3 c_~datas~0.base (store (select .cse3 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (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_958))) (store .cse4 c_~datas~0.base (store (select .cse4 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse5 c_~datas~0.base (store (select .cse5 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:06:27,754 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse7 (+ c_~datas~0.offset 2 .cse4))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse4)) (.cse2 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse0 c_~datas~0.base (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) .cse3 v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse4 1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse5 c_~datas~0.base (store (select .cse5 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) .cse3 v_ArrVal_964) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse6 c_~datas~0.base (store (select .cse6 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) .cse3 v_ArrVal_964) c_~datas~0.base) .cse7))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse8 c_~datas~0.base (store (select .cse8 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) .cse3 v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))))))) is different from false
[2023-11-01 16:06:28,002 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:06:28,002 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 80
[2023-11-01 16:06:28,012 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:06:28,013 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 277 treesize of output 179
[2023-11-01 16:06:28,020 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 163 treesize of output 135
[2023-11-01 16:06:28,028 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 76 treesize of output 69
[2023-11-01 16:06:28,032 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 128 treesize of output 114
[2023-11-01 16:06:28,083 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:06:28,083 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 1
[2023-11-01 16:06:28,090 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:06:28,090 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 1
[2023-11-01 16:06:28,098 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:06:28,099 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 1
[2023-11-01 16:06:28,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:06:28,307 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571895762] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:06:28,308 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:06:28,308 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2023-11-01 16:06:28,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284604498]
[2023-11-01 16:06:28,308 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:06:28,309 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-11-01 16:06:28,309 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:06:28,310 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-11-01 16:06:28,310 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=581, Unknown=59, NotChecked=220, Total=992
[2023-11-01 16:06:28,313 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2023-11-01 16:06:28,315 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 998 transitions, 13986 flow. Second operand  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:28,315 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:06:28,315 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2023-11-01 16:06:28,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:06:43,147 INFO  L130       PetriNetUnfolder]: 25390/41997 cut-off events.
[2023-11-01 16:06:43,147 INFO  L131       PetriNetUnfolder]: For 365076/365076 co-relation queries the response was YES.
[2023-11-01 16:06:43,414 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 261786 conditions, 41997 events. 25390/41997 cut-off events. For 365076/365076 co-relation queries the response was YES. Maximal size of possible extension queue 1168. Compared 316891 event pairs, 4210 based on Foata normal form. 201/42198 useless extension candidates. Maximal degree in co-relation 261736. Up to 17367 conditions per place. 
[2023-11-01 16:06:43,591 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 1213 selfloop transitions, 584 changer transitions 59/1859 dead transitions.
[2023-11-01 16:06:43,591 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1859 transitions, 27522 flow
[2023-11-01 16:06:43,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-11-01 16:06:43,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-11-01 16:06:43,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1827 transitions.
[2023-11-01 16:06:43,594 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38269794721407624
[2023-11-01 16:06:43,594 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1827 transitions.
[2023-11-01 16:06:43,594 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1827 transitions.
[2023-11-01 16:06:43,594 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:06:43,594 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1827 transitions.
[2023-11-01 16:06:43,596 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 83.04545454545455) internal successors, (1827), 22 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:43,600 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:43,600 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:43,600 INFO  L175             Difference]: Start difference. First operand has 165 places, 998 transitions, 13986 flow. Second operand 22 states and 1827 transitions.
[2023-11-01 16:06:43,600 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1859 transitions, 27522 flow
[2023-11-01 16:06:46,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 1859 transitions, 27148 flow, removed 0 selfloop flow, removed 8 redundant places.
[2023-11-01 16:06:46,119 INFO  L231             Difference]: Finished difference. Result has 186 places, 1230 transitions, 19430 flow
[2023-11-01 16:06:46,120 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=13800, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=19430, PETRI_PLACES=186, PETRI_TRANSITIONS=1230}
[2023-11-01 16:06:46,120 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 119 predicate places.
[2023-11-01 16:06:46,121 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 1230 transitions, 19430 flow
[2023-11-01 16:06:46,121 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:46,121 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:06:46,121 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]
[2023-11-01 16:06:46,129 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2023-11-01 16:06:46,322 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:06:46,322 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-11-01 16:06:46,323 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:06:46,324 INFO  L85        PathProgramCache]: Analyzing trace with hash -1195414565, now seen corresponding path program 4 times
[2023-11-01 16:06:46,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:06:46,324 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902775842]
[2023-11-01 16:06:46,324 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:06:46,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:06:46,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:06:46,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:06:46,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:06:46,859 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902775842]
[2023-11-01 16:06:46,859 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902775842] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:06:46,860 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248304006]
[2023-11-01 16:06:46,860 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-01 16:06:46,860 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:06:46,862 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:06:46,864 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:06:46,865 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-11-01 16:06:47,055 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-01 16:06:47,056 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:06:47,058 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-11-01 16:06:47,063 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:06:47,082 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:47,088 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
[2023-11-01 16:06:47,348 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-01 16:06:47,348 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
[2023-11-01 16:06:47,356 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:47,357 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
[2023-11-01 16:06:47,533 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:47,534 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
[2023-11-01 16:06:47,558 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:47,559 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
[2023-11-01 16:06:47,664 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
[2023-11-01 16:06:47,734 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-11-01 16:06:47,746 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 7 treesize of output 3
[2023-11-01 16:06:47,809 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
[2023-11-01 16:06:47,963 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
[2023-11-01 16:06:48,046 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
[2023-11-01 16:06:48,132 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:48,133 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
[2023-11-01 16:06:48,174 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:48,175 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
[2023-11-01 16:06:48,218 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:48,219 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
[2023-11-01 16:06:48,262 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:48,263 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
[2023-11-01 16:06:48,432 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:48,434 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:06:48,434 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 61 treesize of output 60
[2023-11-01 16:06:48,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:06:48,505 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:06:48,754 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))) is different from false
[2023-11-01 16:06:48,896 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_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2023-11-01 16:06:48,942 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse2)) (.cse1 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse1))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse3))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2023-11-01 16:06:48,990 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset .cse4 1)) (.cse3 (+ c_~datas~0.offset 2 .cse4)) (.cse1 (+ c_~datas~0.offset 3 .cse4))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse1))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse2))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2023-11-01 16:06:49,039 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse5 (+ c_~datas~0.offset .cse4 1)) (.cse3 (+ c_~datas~0.offset 2 .cse4)) (.cse2 (+ c_~datas~0.offset 3 .cse4))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse2))))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|)))))))) is different from false
[2023-11-01 16:06:49,069 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:06:49,069 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 58 treesize of output 74
[2023-11-01 16:06:49,079 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:06:49,079 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 189 treesize of output 91
[2023-11-01 16:06:49,086 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 67 treesize of output 53
[2023-11-01 16:06:49,098 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:06:49,099 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 42 treesize of output 46
[2023-11-01 16:06:49,165 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-11-01 16:06:49,166 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2023-11-01 16:06:49,178 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-11-01 16:06:49,178 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 1
[2023-11-01 16:06:49,189 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-11-01 16:06:49,189 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2023-11-01 16:06:49,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:06:49,387 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [248304006] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:06:49,387 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:06:49,387 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2023-11-01 16:06:49,388 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556097255]
[2023-11-01 16:06:49,388 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:06:49,388 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-11-01 16:06:49,388 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:06:49,389 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-11-01 16:06:49,389 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=580, Unknown=15, NotChecked=270, Total=992
[2023-11-01 16:06:49,448 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2023-11-01 16:06:49,449 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 1230 transitions, 19430 flow. Second operand  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:06:49,450 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:06:49,450 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2023-11-01 16:06:49,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:07:10,333 INFO  L130       PetriNetUnfolder]: 27429/45476 cut-off events.
[2023-11-01 16:07:10,334 INFO  L131       PetriNetUnfolder]: For 575170/575172 co-relation queries the response was YES.
[2023-11-01 16:07:10,687 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 323306 conditions, 45476 events. 27429/45476 cut-off events. For 575170/575172 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 346675 event pairs, 4325 based on Foata normal form. 205/45680 useless extension candidates. Maximal degree in co-relation 323248. Up to 16941 conditions per place. 
[2023-11-01 16:07:10,902 INFO  L137   encePairwiseOnDemand]: 180/217 looper letters, 1451 selfloop transitions, 656 changer transitions 92/2202 dead transitions.
[2023-11-01 16:07:10,902 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 2202 transitions, 36627 flow
[2023-11-01 16:07:10,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2023-11-01 16:07:10,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2023-11-01 16:07:10,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2260 transitions.
[2023-11-01 16:07:10,905 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3719552337063858
[2023-11-01 16:07:10,905 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 2260 transitions.
[2023-11-01 16:07:10,905 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 2260 transitions.
[2023-11-01 16:07:10,906 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:07:10,906 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2260 transitions.
[2023-11-01 16:07:10,908 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 29 states, 28 states have (on average 80.71428571428571) internal successors, (2260), 28 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:10,913 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 29 states, 29 states have (on average 217.0) internal successors, (6293), 29 states have internal predecessors, (6293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:10,913 INFO  L81            ComplementDD]: Finished complementDD. Result  has 29 states, 29 states have (on average 217.0) internal successors, (6293), 29 states have internal predecessors, (6293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:10,913 INFO  L175             Difference]: Start difference. First operand has 186 places, 1230 transitions, 19430 flow. Second operand 28 states and 2260 transitions.
[2023-11-01 16:07:10,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 2202 transitions, 36627 flow
[2023-11-01 16:07:16,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 2202 transitions, 35801 flow, removed 338 selfloop flow, removed 9 redundant places.
[2023-11-01 16:07:16,323 INFO  L231             Difference]: Finished difference. Result has 217 places, 1537 transitions, 26474 flow
[2023-11-01 16:07:16,323 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=18681, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=388, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=26474, PETRI_PLACES=217, PETRI_TRANSITIONS=1537}
[2023-11-01 16:07:16,324 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 150 predicate places.
[2023-11-01 16:07:16,324 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 1537 transitions, 26474 flow
[2023-11-01 16:07:16,324 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:16,324 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:07:16,324 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-11-01 16:07:16,332 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-11-01 16:07:16,525 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-11-01 16:07:16,525 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)] ===
[2023-11-01 16:07:16,526 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:07:16,526 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108278345, now seen corresponding path program 1 times
[2023-11-01 16:07:16,526 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:07:16,527 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749622930]
[2023-11-01 16:07:16,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:07:16,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:07:16,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 16:07:16,552 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 16:07:16,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 16:07:16,566 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 16:07:16,566 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 16:07:16,566 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-11-01 16:07:16,566 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-11-01 16:07:16,566 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-11-01 16:07:16,566 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-11-01 16:07:16,567 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-11-01 16:07:16,567 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-11-01 16:07:16,567 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-11-01 16:07:16,567 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2023-11-01 16:07:16,567 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-11-01 16:07:16,567 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-11-01 16:07:16,567 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-11-01 16:07:16,567 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-11-01 16:07:16,567 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-11-01 16:07:16,567 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-01 16:07:16,567 INFO  L445         BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:07:16,568 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 16:07:16,568 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-01 16:07:16,585 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-11-01 16:07:16,586 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 155 transitions, 340 flow
[2023-11-01 16:07:16,617 INFO  L130       PetriNetUnfolder]: 21/500 cut-off events.
[2023-11-01 16:07:16,617 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-01 16:07:16,618 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 500 events. 21/500 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1504 event pairs, 1 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 297. Up to 16 conditions per place. 
[2023-11-01 16:07:16,618 INFO  L82        GeneralOperation]: Start removeDead. Operand has 156 places, 155 transitions, 340 flow
[2023-11-01 16:07:16,619 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 156 places, 155 transitions, 340 flow
[2023-11-01 16:07:16,619 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 16:07:16,620 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 155 transitions, 340 flow
[2023-11-01 16:07:16,620 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 155 transitions, 340 flow
[2023-11-01 16:07:16,620 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 155 transitions, 340 flow
[2023-11-01 16:07:16,649 INFO  L130       PetriNetUnfolder]: 21/500 cut-off events.
[2023-11-01 16:07:16,649 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-01 16:07:16,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 500 events. 21/500 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1504 event pairs, 1 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 297. Up to 16 conditions per place. 
[2023-11-01 16:07:16,658 INFO  L119        LiptonReduction]: Number of co-enabled transitions 8964
[2023-11-01 16:07:19,857 INFO  L134        LiptonReduction]: Checked pairs total: 51687
[2023-11-01 16:07:19,858 INFO  L136        LiptonReduction]: Total number of compositions: 90
[2023-11-01 16:07:19,859 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 16:07:19,860 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;@1f2b8c68, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 16:07:19,860 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-11-01 16:07:19,860 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-11-01 16:07:19,861 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 16:07:19,861 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:07:19,861 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-01 16:07:19,861 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)] ===
[2023-11-01 16:07:19,862 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:07:19,862 INFO  L85        PathProgramCache]: Analyzing trace with hash 881, now seen corresponding path program 1 times
[2023-11-01 16:07:19,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:07:19,862 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727215632]
[2023-11-01 16:07:19,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:07:19,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:07:19,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:07:19,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:07:19,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:07:19,866 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727215632]
[2023-11-01 16:07:19,866 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727215632] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:07:19,866 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:07:19,866 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-01 16:07:19,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452663546]
[2023-11-01 16:07:19,867 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:07:19,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-01 16:07:19,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:07:19,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-01 16:07:19,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-01 16:07:19,868 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 245
[2023-11-01 16:07:19,868 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 182 flow. Second operand  has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:19,868 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:07:19,868 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 245
[2023-11-01 16:07:19,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:07:20,433 INFO  L130       PetriNetUnfolder]: 3680/8504 cut-off events.
[2023-11-01 16:07:20,433 INFO  L131       PetriNetUnfolder]: For 651/1631 co-relation queries the response was YES.
[2023-11-01 16:07:20,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14271 conditions, 8504 events. 3680/8504 cut-off events. For 651/1631 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 72254 event pairs, 3637 based on Foata normal form. 0/7834 useless extension candidates. Maximal degree in co-relation 11836. Up to 5535 conditions per place. 
[2023-11-01 16:07:20,465 INFO  L137   encePairwiseOnDemand]: 244/245 looper letters, 28 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2023-11-01 16:07:20,466 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 236 flow
[2023-11-01 16:07:20,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-01 16:07:20,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-01 16:07:20,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions.
[2023-11-01 16:07:20,467 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6551020408163265
[2023-11-01 16:07:20,467 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 321 transitions.
[2023-11-01 16:07:20,467 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 321 transitions.
[2023-11-01 16:07:20,468 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:07:20,468 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 321 transitions.
[2023-11-01 16:07:20,468 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:20,469 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:20,469 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:20,469 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 321 transitions.
[2023-11-01 16:07:20,469 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 236 flow
[2023-11-01 16:07:20,470 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:07:20,470 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2023-11-01 16:07:20,470 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, 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}
[2023-11-01 16:07:20,471 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2023-11-01 16:07:20,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2023-11-01 16:07:20,471 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:20,471 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:07:20,471 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:07:20,471 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-11-01 16:07:20,471 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)] ===
[2023-11-01 16:07:20,472 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:07:20,472 INFO  L85        PathProgramCache]: Analyzing trace with hash 847683071, now seen corresponding path program 1 times
[2023-11-01 16:07:20,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:07:20,472 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275774899]
[2023-11-01 16:07:20,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:07:20,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:07:20,479 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:07:20,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:07:20,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:07:20,577 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275774899]
[2023-11-01 16:07:20,577 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275774899] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:07:20,578 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:07:20,578 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:07:20,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224988496]
[2023-11-01 16:07:20,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:07:20,578 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:07:20,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:07:20,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:07:20,579 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:07:20,771 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245
[2023-11-01 16:07:20,772 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 180 flow. Second operand  has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:20,772 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:07:20,772 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245
[2023-11-01 16:07:20,772 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:07:27,894 INFO  L130       PetriNetUnfolder]: 75663/120904 cut-off events.
[2023-11-01 16:07:27,894 INFO  L131       PetriNetUnfolder]: For 3763/4244 co-relation queries the response was YES.
[2023-11-01 16:07:28,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 231350 conditions, 120904 events. 75663/120904 cut-off events. For 3763/4244 co-relation queries the response was YES. Maximal size of possible extension queue 2764. Compared 1003932 event pairs, 19231 based on Foata normal form. 157/116594 useless extension candidates. Maximal degree in co-relation 231344. Up to 73144 conditions per place. 
[2023-11-01 16:07:28,479 INFO  L137   encePairwiseOnDemand]: 214/245 looper letters, 111 selfloop transitions, 64 changer transitions 0/196 dead transitions.
[2023-11-01 16:07:28,479 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 196 transitions, 793 flow
[2023-11-01 16:07:28,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:07:28,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:07:28,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions.
[2023-11-01 16:07:28,481 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.582312925170068
[2023-11-01 16:07:28,481 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 856 transitions.
[2023-11-01 16:07:28,481 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 856 transitions.
[2023-11-01 16:07:28,482 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:07:28,482 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 856 transitions.
[2023-11-01 16:07:28,483 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.66666666666666) internal successors, (856), 6 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:28,484 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:28,484 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:28,484 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 856 transitions.
[2023-11-01 16:07:28,484 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 196 transitions, 793 flow
[2023-11-01 16:07:28,487 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 196 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:07:28,488 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2023-11-01 16:07:28,489 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, 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}
[2023-11-01 16:07:28,489 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2023-11-01 16:07:28,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2023-11-01 16:07:28,489 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:28,489 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:07:28,489 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:07:28,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-11-01 16:07:28,490 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)] ===
[2023-11-01 16:07:28,490 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:07:28,490 INFO  L85        PathProgramCache]: Analyzing trace with hash -309025520, now seen corresponding path program 1 times
[2023-11-01 16:07:28,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:07:28,490 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913194323]
[2023-11-01 16:07:28,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:07:28,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:07:28,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:07:28,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:07:28,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:07:28,508 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913194323]
[2023-11-01 16:07:28,508 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913194323] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:07:28,508 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:07:28,508 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-01 16:07:28,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462479688]
[2023-11-01 16:07:28,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:07:28,508 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-01 16:07:28,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:07:28,509 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-01 16:07:28,509 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-01 16:07:28,532 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 245
[2023-11-01 16:07:28,532 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 139 transitions, 626 flow. Second operand  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:28,532 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:07:28,533 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 245
[2023-11-01 16:07:28,533 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:07:31,286 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [120#L1016-3true, 83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 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: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), 126#L1016-1true, threadThread3of3ForFork0InUse])
[2023-11-01 16:07:31,286 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-11-01 16:07:31,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-01 16:07:31,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-01 16:07:31,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-01 16:07:31,287 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, 79#L1016-3true, 47#L1016-1true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 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: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-01 16:07:31,287 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-11-01 16:07:31,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-01 16:07:31,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-01 16:07:31,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-11-01 16:07:31,524 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [120#L1016-3true, 83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, 79#L1016-3true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 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: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-01 16:07:31,524 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,524 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,524 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,524 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,525 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1016-4-->L1016-6: Formula: (= (store |v_#race_176| v_~datas~0.base_115 (store (select |v_#race_176| v_~datas~0.base_115) (+ (* v_threadThread2of3ForFork0_~i~0_21 4) v_~datas~0.offset_103) |v_threadThread2of3ForFork0_#t~nondet4_21|)) |v_#race_175|)  InVars {#race=|v_#race_176|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  OutVars{#race=|v_#race_175|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 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)), 95#L1016-6true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), 126#L1016-1true, threadThread3of3ForFork0InUse])
[2023-11-01 16:07:31,525 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,525 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,525 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,525 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,525 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([763] L1016-4-->L1016-6: Formula: (= |v_#race_161| (store |v_#race_162| v_~datas~0.base_105 (store (select |v_#race_162| v_~datas~0.base_105) (+ v_~datas~0.offset_93 (* v_threadThread3of3ForFork0_~i~0_19 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_162|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  OutVars{#race=|v_#race_161|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, 47#L1016-1true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 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: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 51#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-01 16:07:31,525 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,525 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,526 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,526 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-11-01 16:07:31,781 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1016-4-->L1016-6: Formula: (= (store |v_#race_176| v_~datas~0.base_115 (store (select |v_#race_176| v_~datas~0.base_115) (+ (* v_threadThread2of3ForFork0_~i~0_21 4) v_~datas~0.offset_103) |v_threadThread2of3ForFork0_#t~nondet4_21|)) |v_#race_175|)  InVars {#race=|v_#race_176|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  OutVars{#race=|v_#race_175|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, 79#L1016-3true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 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)), 95#L1016-6true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-01 16:07:31,781 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-11-01 16:07:31,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 16:07:31,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 16:07:31,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 16:07:31,782 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([763] L1016-4-->L1016-6: Formula: (= |v_#race_161| (store |v_#race_162| v_~datas~0.base_105 (store (select |v_#race_162| v_~datas~0.base_105) (+ v_~datas~0.offset_93 (* v_threadThread3of3ForFork0_~i~0_19 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_162|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  OutVars{#race=|v_#race_161|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [120#L1016-3true, 37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 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: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 51#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-01 16:07:31,782 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-11-01 16:07:31,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 16:07:31,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 16:07:31,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-11-01 16:07:33,350 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_183| v_~datas~0.base_131)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_27 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)))))  InVars {#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, 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_27}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [83#threadEXITtrue, 162#true, 80#L1028-1true, 6#threadEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 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: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-11-01 16:07:33,351 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-11-01 16:07:33,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-01 16:07:33,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-01 16:07:33,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-01 16:07:33,351 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_183| v_~datas~0.base_131)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_27 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)))))  InVars {#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, 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_27}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [83#threadEXITtrue, 162#true, 6#threadEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 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: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse, 92#L1030true])
[2023-11-01 16:07:33,351 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-11-01 16:07:33,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-01 16:07:33,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-01 16:07:33,351 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-11-01 16:07:33,560 INFO  L130       PetriNetUnfolder]: 36197/69251 cut-off events.
[2023-11-01 16:07:33,560 INFO  L131       PetriNetUnfolder]: For 38254/44798 co-relation queries the response was YES.
[2023-11-01 16:07:33,742 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 166379 conditions, 69251 events. 36197/69251 cut-off events. For 38254/44798 co-relation queries the response was YES. Maximal size of possible extension queue 2423. Compared 691296 event pairs, 15592 based on Foata normal form. 967/64854 useless extension candidates. Maximal degree in co-relation 166368. Up to 32701 conditions per place. 
[2023-11-01 16:07:33,974 INFO  L137   encePairwiseOnDemand]: 237/245 looper letters, 50 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2023-11-01 16:07:33,975 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 764 flow
[2023-11-01 16:07:33,975 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-01 16:07:33,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-01 16:07:33,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions.
[2023-11-01 16:07:33,976 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6027210884353742
[2023-11-01 16:07:33,976 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 443 transitions.
[2023-11-01 16:07:33,976 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions.
[2023-11-01 16:07:33,976 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:07:33,976 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions.
[2023-11-01 16:07:33,977 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:33,978 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:33,978 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:33,978 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 443 transitions.
[2023-11-01 16:07:33,978 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 764 flow
[2023-11-01 16:07:34,569 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 764 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:07:34,571 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2023-11-01 16:07:34,572 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, 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}
[2023-11-01 16:07:34,572 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2023-11-01 16:07:34,572 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2023-11-01 16:07:34,572 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:34,572 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:07:34,572 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:07:34,572 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-11-01 16:07:34,573 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)] ===
[2023-11-01 16:07:34,573 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:07:34,573 INFO  L85        PathProgramCache]: Analyzing trace with hash 871548223, now seen corresponding path program 1 times
[2023-11-01 16:07:34,573 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:07:34,573 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176462772]
[2023-11-01 16:07:34,573 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:07:34,573 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:07:34,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:07:34,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:07:34,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:07:34,725 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176462772]
[2023-11-01 16:07:34,726 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176462772] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:07:34,726 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:07:34,726 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:07:34,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825097398]
[2023-11-01 16:07:34,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:07:34,727 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:07:34,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:07:34,727 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:07:34,727 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:07:35,058 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 245
[2023-11-01 16:07:35,059 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 139 transitions, 646 flow. Second operand  has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:35,060 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:07:35,060 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 245
[2023-11-01 16:07:35,060 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:07:45,291 INFO  L130       PetriNetUnfolder]: 78201/123586 cut-off events.
[2023-11-01 16:07:45,292 INFO  L131       PetriNetUnfolder]: For 93941/95137 co-relation queries the response was YES.
[2023-11-01 16:07:45,589 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 340505 conditions, 123586 events. 78201/123586 cut-off events. For 93941/95137 co-relation queries the response was YES. Maximal size of possible extension queue 2848. Compared 1012760 event pairs, 27187 based on Foata normal form. 0/117879 useless extension candidates. Maximal degree in co-relation 340493. Up to 88234 conditions per place. 
[2023-11-01 16:07:46,030 INFO  L137   encePairwiseOnDemand]: 226/245 looper letters, 148 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2023-11-01 16:07:46,030 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1807 flow
[2023-11-01 16:07:46,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:07:46,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:07:46,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 875 transitions.
[2023-11-01 16:07:46,032 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5952380952380952
[2023-11-01 16:07:46,032 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 875 transitions.
[2023-11-01 16:07:46,032 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 875 transitions.
[2023-11-01 16:07:46,033 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:07:46,033 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 875 transitions.
[2023-11-01 16:07:46,033 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:46,035 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:46,035 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:46,035 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 875 transitions.
[2023-11-01 16:07:46,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1807 flow
[2023-11-01 16:07:46,143 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1807 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:07:46,146 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2023-11-01 16:07:46,146 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, 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}
[2023-11-01 16:07:46,146 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2023-11-01 16:07:46,146 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2023-11-01 16:07:46,146 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:46,147 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:07:46,147 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:07:46,147 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-11-01 16:07:46,147 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-01 16:07:46,147 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:07:46,147 INFO  L85        PathProgramCache]: Analyzing trace with hash 1259099398, now seen corresponding path program 1 times
[2023-11-01 16:07:46,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:07:46,147 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764260053]
[2023-11-01 16:07:46,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:07:46,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:07:46,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:07:46,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:07:46,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:07:46,309 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764260053]
[2023-11-01 16:07:46,309 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764260053] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:07:46,309 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:07:46,309 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:07:46,309 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406973714]
[2023-11-01 16:07:46,309 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:07:46,310 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:07:46,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:07:46,310 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:07:46,310 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:07:46,526 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245
[2023-11-01 16:07:46,526 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 240 transitions, 1604 flow. Second operand  has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:07:46,527 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:07:46,527 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245
[2023-11-01 16:07:46,527 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:08:09,225 INFO  L130       PetriNetUnfolder]: 165587/252270 cut-off events.
[2023-11-01 16:08:09,225 INFO  L131       PetriNetUnfolder]: For 287960/290697 co-relation queries the response was YES.
[2023-11-01 16:08:09,972 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 817394 conditions, 252270 events. 165587/252270 cut-off events. For 287960/290697 co-relation queries the response was YES. Maximal size of possible extension queue 5144. Compared 2087933 event pairs, 47460 based on Foata normal form. 0/237885 useless extension candidates. Maximal degree in co-relation 817377. Up to 165386 conditions per place. 
[2023-11-01 16:08:10,970 INFO  L137   encePairwiseOnDemand]: 215/245 looper letters, 334 selfloop transitions, 162 changer transitions 0/517 dead transitions.
[2023-11-01 16:08:10,970 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 517 transitions, 4078 flow
[2023-11-01 16:08:10,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:08:10,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:08:10,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions.
[2023-11-01 16:08:10,972 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6163265306122448
[2023-11-01 16:08:10,972 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 906 transitions.
[2023-11-01 16:08:10,972 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 906 transitions.
[2023-11-01 16:08:10,972 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:08:10,973 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 906 transitions.
[2023-11-01 16:08:10,974 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 151.0) internal successors, (906), 6 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:08:10,975 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:08:10,975 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:08:10,975 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 906 transitions.
[2023-11-01 16:08:10,975 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 517 transitions, 4078 flow
[2023-11-01 16:08:12,278 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 517 transitions, 4078 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:08:12,283 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2023-11-01 16:08:12,284 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, 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}
[2023-11-01 16:08:12,284 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2023-11-01 16:08:12,285 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2023-11-01 16:08:12,285 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:08:12,285 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:08:12,285 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:08:12,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2023-11-01 16:08:12,285 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)] ===
[2023-11-01 16:08:12,286 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:08:12,286 INFO  L85        PathProgramCache]: Analyzing trace with hash -610559931, now seen corresponding path program 1 times
[2023-11-01 16:08:12,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:08:12,286 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841682822]
[2023-11-01 16:08:12,286 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:08:12,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:08:12,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:08:12,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-01 16:08:12,517 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:08:12,517 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841682822]
[2023-11-01 16:08:12,517 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841682822] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:08:12,517 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13573279]
[2023-11-01 16:08:12,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:08:12,518 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:08:12,518 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:08:12,520 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:08:12,522 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-11-01 16:08:12,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:08:12,661 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-11-01 16:08:12,664 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:08:12,748 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:08:12,782 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:08:12,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
[2023-11-01 16:08:12,831 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:08:12,832 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:08:12,833 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:08:12,880 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:08:12,883 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:08:12,884 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:08:12,886 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:08:12,956 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:08:12,956 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:08:12,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-01 16:08:12,991 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:08:13,016 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2023-11-01 16:08:13,169 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_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))) is different from false
[2023-11-01 16:08:13,187 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_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2023-11-01 16:08:13,205 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:08:13,206 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-11-01 16:08:13,211 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:08:13,211 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2023-11-01 16:08:13,218 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2023-11-01 16:08:13,224 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:08:13,224 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-11-01 16:08:13,230 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:08:13,230 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-11-01 16:08:13,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2023-11-01 16:08:13,253 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [13573279] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:08:13,253 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:08:13,253 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2023-11-01 16:08:13,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99538284]
[2023-11-01 16:08:13,253 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:08:13,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-11-01 16:08:13,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:08:13,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-11-01 16:08:13,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=131, Unknown=14, NotChecked=84, Total=306
[2023-11-01 16:08:13,492 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 245
[2023-11-01 16:08:13,494 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 395 transitions, 3161 flow. Second operand  has 18 states, 18 states have (on average 92.33333333333333) internal successors, (1662), 18 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:08:13,494 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:08:13,495 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 245
[2023-11-01 16:08:13,495 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:08:57,669 INFO  L130       PetriNetUnfolder]: 291944/413543 cut-off events.
[2023-11-01 16:08:57,669 INFO  L131       PetriNetUnfolder]: For 908623/908623 co-relation queries the response was YES.
[2023-11-01 16:08:59,199 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1581123 conditions, 413543 events. 291944/413543 cut-off events. For 908623/908623 co-relation queries the response was YES. Maximal size of possible extension queue 6781. Compared 3087256 event pairs, 146441 based on Foata normal form. 6822/389908 useless extension candidates. Maximal degree in co-relation 1581101. Up to 397760 conditions per place. 
[2023-11-01 16:09:00,964 INFO  L137   encePairwiseOnDemand]: 228/245 looper letters, 440 selfloop transitions, 7 changer transitions 11/464 dead transitions.
[2023-11-01 16:09:00,965 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 464 transitions, 4550 flow
[2023-11-01 16:09:00,966 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-01 16:09:00,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-01 16:09:00,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 739 transitions.
[2023-11-01 16:09:00,967 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.43090379008746355
[2023-11-01 16:09:00,967 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 739 transitions.
[2023-11-01 16:09:00,967 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 739 transitions.
[2023-11-01 16:09:00,967 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:09:00,967 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 739 transitions.
[2023-11-01 16:09:00,968 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:09:00,969 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:09:00,970 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:09:00,970 INFO  L175             Difference]: Start difference. First operand has 108 places, 395 transitions, 3161 flow. Second operand 7 states and 739 transitions.
[2023-11-01 16:09:00,970 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 464 transitions, 4550 flow
[2023-11-01 16:09:45,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 464 transitions, 4454 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-11-01 16:09:45,400 INFO  L231             Difference]: Finished difference. Result has 115 places, 396 transitions, 3125 flow
[2023-11-01 16:09:45,400 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, 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}
[2023-11-01 16:09:45,401 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 35 predicate places.
[2023-11-01 16:09:45,401 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 396 transitions, 3125 flow
[2023-11-01 16:09:45,401 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 92.33333333333333) internal successors, (1662), 18 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:09:45,401 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:09:45,401 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:09:45,409 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2023-11-01 16:09:45,602 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,SelfDestructingSolverStorable27
[2023-11-01 16:09:45,603 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-01 16:09:45,604 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:09:45,604 INFO  L85        PathProgramCache]: Analyzing trace with hash 1345210140, now seen corresponding path program 1 times
[2023-11-01 16:09:45,604 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:09:45,605 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321011666]
[2023-11-01 16:09:45,605 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:09:45,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:09:45,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:09:45,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 16:09:45,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:09:45,822 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321011666]
[2023-11-01 16:09:45,822 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321011666] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:09:45,822 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:09:45,822 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-01 16:09:45,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538108689]
[2023-11-01 16:09:45,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:09:45,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-01 16:09:45,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:09:45,824 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-01 16:09:45,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-01 16:09:46,420 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245
[2023-11-01 16:09:46,421 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 396 transitions, 3125 flow. Second operand  has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 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)
[2023-11-01 16:09:46,421 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:09:46,421 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245
[2023-11-01 16:09:46,422 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:10:23,676 INFO  L130       PetriNetUnfolder]: 228393/343031 cut-off events.
[2023-11-01 16:10:23,676 INFO  L131       PetriNetUnfolder]: For 757384/758365 co-relation queries the response was YES.
[2023-11-01 16:10:25,200 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1360038 conditions, 343031 events. 228393/343031 cut-off events. For 757384/758365 co-relation queries the response was YES. Maximal size of possible extension queue 7498. Compared 2876047 event pairs, 59414 based on Foata normal form. 3134/339928 useless extension candidates. Maximal degree in co-relation 1360011. Up to 157988 conditions per place. 
[2023-11-01 16:10:26,695 INFO  L137   encePairwiseOnDemand]: 225/245 looper letters, 593 selfloop transitions, 254 changer transitions 0/865 dead transitions.
[2023-11-01 16:10:26,695 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 865 transitions, 8001 flow
[2023-11-01 16:10:26,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-01 16:10:26,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-01 16:10:26,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1142 transitions.
[2023-11-01 16:10:26,697 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5826530612244898
[2023-11-01 16:10:26,697 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1142 transitions.
[2023-11-01 16:10:26,697 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1142 transitions.
[2023-11-01 16:10:26,697 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:10:26,697 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1142 transitions.
[2023-11-01 16:10:26,699 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 142.75) internal successors, (1142), 8 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:10:26,700 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:10:26,700 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:10:26,700 INFO  L175             Difference]: Start difference. First operand has 115 places, 396 transitions, 3125 flow. Second operand 8 states and 1142 transitions.
[2023-11-01 16:10:26,700 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 865 transitions, 8001 flow
[2023-11-01 16:11:02,165 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 865 transitions, 7917 flow, removed 31 selfloop flow, removed 2 redundant places.
[2023-11-01 16:11:02,172 INFO  L231             Difference]: Finished difference. Result has 126 places, 588 transitions, 5772 flow
[2023-11-01 16:11:02,172 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=3105, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5772, PETRI_PLACES=126, PETRI_TRANSITIONS=588}
[2023-11-01 16:11:02,172 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 46 predicate places.
[2023-11-01 16:11:02,173 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 588 transitions, 5772 flow
[2023-11-01 16:11:02,173 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 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)
[2023-11-01 16:11:02,173 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:11:02,173 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]
[2023-11-01 16:11:02,173 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2023-11-01 16:11:02,173 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-01 16:11:02,173 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:11:02,173 INFO  L85        PathProgramCache]: Analyzing trace with hash 228363183, now seen corresponding path program 1 times
[2023-11-01 16:11:02,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:11:02,174 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660223290]
[2023-11-01 16:11:02,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:11:02,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:11:02,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:11:02,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-01 16:11:02,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:11:02,355 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660223290]
[2023-11-01 16:11:02,355 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660223290] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:11:02,355 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:11:02,355 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:11:02,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279938423]
[2023-11-01 16:11:02,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:11:02,356 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:11:02,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:11:02,357 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:11:02,357 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:11:02,592 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245
[2023-11-01 16:11:02,593 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 588 transitions, 5772 flow. Second operand  has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:11:02,593 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:11:02,593 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245
[2023-11-01 16:11:02,593 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:12:03,629 INFO  L130       PetriNetUnfolder]: 308170/464788 cut-off events.
[2023-11-01 16:12:03,629 INFO  L131       PetriNetUnfolder]: For 2088009/2099126 co-relation queries the response was YES.
[2023-11-01 16:12:06,362 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2167304 conditions, 464788 events. 308170/464788 cut-off events. For 2088009/2099126 co-relation queries the response was YES. Maximal size of possible extension queue 10022. Compared 4060598 event pairs, 85304 based on Foata normal form. 277/434042 useless extension candidates. Maximal degree in co-relation 2167271. Up to 352552 conditions per place. 
[2023-11-01 16:12:08,690 INFO  L137   encePairwiseOnDemand]: 215/245 looper letters, 647 selfloop transitions, 213 changer transitions 0/878 dead transitions.
[2023-11-01 16:12:08,690 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 878 transitions, 9838 flow
[2023-11-01 16:12:08,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:12:08,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:12:08,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 902 transitions.
[2023-11-01 16:12:08,692 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6136054421768707
[2023-11-01 16:12:08,692 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 902 transitions.
[2023-11-01 16:12:08,692 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 902 transitions.
[2023-11-01 16:12:08,692 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:12:08,693 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 902 transitions.
[2023-11-01 16:12:08,693 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 150.33333333333334) internal successors, (902), 6 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:12:08,695 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:12:08,695 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:12:08,695 INFO  L175             Difference]: Start difference. First operand has 126 places, 588 transitions, 5772 flow. Second operand 6 states and 902 transitions.
[2023-11-01 16:12:08,695 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 878 transitions, 9838 flow
[2023-11-01 16:12:58,826 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 878 transitions, 9762 flow, removed 38 selfloop flow, removed 0 redundant places.
[2023-11-01 16:12:58,835 INFO  L231             Difference]: Finished difference. Result has 135 places, 756 transitions, 8072 flow
[2023-11-01 16:12:58,835 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=5696, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8072, PETRI_PLACES=135, PETRI_TRANSITIONS=756}
[2023-11-01 16:12:58,835 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 55 predicate places.
[2023-11-01 16:12:58,835 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 756 transitions, 8072 flow
[2023-11-01 16:12:58,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:12:58,836 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:12:58,836 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]
[2023-11-01 16:12:58,836 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2023-11-01 16:12:58,836 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-11-01 16:12:58,836 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:12:58,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 1129922456, now seen corresponding path program 1 times
[2023-11-01 16:12:58,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:12:58,837 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498540762]
[2023-11-01 16:12:58,837 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:12:58,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:12:58,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:12:59,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:12:59,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:12:59,182 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498540762]
[2023-11-01 16:12:59,182 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498540762] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:12:59,183 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142852789]
[2023-11-01 16:12:59,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:12:59,183 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:12:59,183 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:12:59,185 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:12:59,187 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-01 16:12:59,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:12:59,344 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-11-01 16:12:59,351 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:12:59,364 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-11-01 16:12:59,364 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 78 treesize of output 70
[2023-11-01 16:12:59,474 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-11-01 16:12:59,475 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
[2023-11-01 16:12:59,509 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
[2023-11-01 16:12:59,536 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
[2023-11-01 16:12:59,551 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
[2023-11-01 16:12:59,573 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:12:59,574 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
[2023-11-01 16:12:59,607 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:12:59,607 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
[2023-11-01 16:12:59,649 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
[2023-11-01 16:12:59,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 16:12:59,669 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-01 16:12:59,669 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142852789] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:12:59,670 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-01 16:12:59,670 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 10
[2023-11-01 16:12:59,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416295]
[2023-11-01 16:12:59,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:12:59,670 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-01 16:12:59,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:12:59,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-01 16:12:59,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2023-11-01 16:13:00,336 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 245
[2023-11-01 16:13:00,337 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 756 transitions, 8072 flow. Second operand  has 10 states, 10 states have (on average 102.4) internal successors, (1024), 10 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:13:00,337 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:13:00,337 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 245
[2023-11-01 16:13:00,337 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:15:06,415 INFO  L130       PetriNetUnfolder]: 551125/813317 cut-off events.
[2023-11-01 16:15:06,415 INFO  L131       PetriNetUnfolder]: For 4588840/4595792 co-relation queries the response was YES.
[2023-11-01 16:15:11,235 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4173307 conditions, 813317 events. 551125/813317 cut-off events. For 4588840/4595792 co-relation queries the response was YES. Maximal size of possible extension queue 17004. Compared 7283370 event pairs, 94169 based on Foata normal form. 2166/798929 useless extension candidates. Maximal degree in co-relation 4173269. Up to 547049 conditions per place. 
[2023-11-01 16:15:15,429 INFO  L137   encePairwiseOnDemand]: 217/245 looper letters, 1444 selfloop transitions, 381 changer transitions 0/1837 dead transitions.
[2023-11-01 16:15:15,429 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 1837 transitions, 22866 flow
[2023-11-01 16:15:15,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-11-01 16:15:15,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-01 16:15:15,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1395 transitions.
[2023-11-01 16:15:15,432 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5176252319109462
[2023-11-01 16:15:15,432 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1395 transitions.
[2023-11-01 16:15:15,432 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1395 transitions.
[2023-11-01 16:15:15,432 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:15:15,432 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1395 transitions.
[2023-11-01 16:15:15,434 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 126.81818181818181) internal successors, (1395), 11 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:15:15,436 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 245.0) internal successors, (2940), 12 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:15:15,436 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 245.0) internal successors, (2940), 12 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:15:15,436 INFO  L175             Difference]: Start difference. First operand has 135 places, 756 transitions, 8072 flow. Second operand 11 states and 1395 transitions.
[2023-11-01 16:15:15,436 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 1837 transitions, 22866 flow
Killed by 15
