./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 88a08bc4e972dfc9a678d317920ca53726f26c10399ef49b28cbf95e4f2e3240
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 14:55:53,174 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 14:55:53,176 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 14:55:53,223 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 14:55:53,226 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 14:55:53,228 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 14:55:53,230 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 14:55:53,232 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 14:55:53,248 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 14:55:53,252 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 14:55:53,253 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 14:55:53,255 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 14:55:53,255 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 14:55:53,257 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 14:55:53,259 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 14:55:53,261 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 14:55:53,263 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 14:55:53,264 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 14:55:53,265 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 14:55:53,270 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 14:55:53,271 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 14:55:53,287 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 14:55:53,288 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 14:55:53,289 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 14:55:53,297 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 14:55:53,297 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 14:55:53,297 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 14:55:53,299 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 14:55:53,299 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 14:55:53,300 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 14:55:53,301 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 14:55:53,301 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 14:55:53,303 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 14:55:53,304 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 14:55:53,305 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 14:55:53,305 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 14:55:53,305 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 14:55:53,306 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 14:55:53,306 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 14:55:53,308 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 14:55:53,308 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 14:55:53,309 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 14:55:53,347 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 14:55:53,359 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 14:55:53,360 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 14:55:53,360 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 14:55:53,361 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 14:55:53,361 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 14:55:53,361 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 14:55:53,361 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 14:55:53,361 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 14:55:53,362 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 14:55:53,362 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 14:55:53,362 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 14:55:53,363 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 14:55:53,363 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 14:55:53,363 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 14:55:53,363 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 14:55:53,363 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 14:55:53,363 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 14:55:53,364 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 14:55:53,364 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 14:55:53,364 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 14:55:53,364 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 14:55:53,364 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 14:55:53,364 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 14:55:53,364 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 14:55:53,365 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 14:55:53,365 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 14:55:53,365 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 14:55:53,365 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 14:55:53,365 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 14:55:53,366 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 14:55:53,366 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 14:55:53,366 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 14:55:53,367 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 14:55:53,367 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 14:55:53,367 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 14:55:53,367 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 14:55:53,367 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 -> 88a08bc4e972dfc9a678d317920ca53726f26c10399ef49b28cbf95e4f2e3240
[2023-10-25 14:55:54,589 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 14:55:54,912 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 14:55:54,915 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 14:55:54,916 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 14:55:54,916 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 14:55:54,917 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-10-25 14:55:57,232 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 14:55:57,636 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 14:55:57,639 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i
[2023-10-25 14:55:57,667 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/655051618/9fe0c9750c7f4f0b9fbacf4c7ddcf12c/FLAG9600a0f73
[2023-10-25 14:55:57,697 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/655051618/9fe0c9750c7f4f0b9fbacf4c7ddcf12c
[2023-10-25 14:55:57,699 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 14:55:57,717 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 14:55:57,718 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 14:55:57,718 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 14:55:57,720 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 14:55:57,720 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:55:57" (1/1) ...
[2023-10-25 14:55:57,723 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64054e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:57, skipping insertion in model container
[2023-10-25 14:55:57,723 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:55:57" (1/1) ...
[2023-10-25 14:55:57,728 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 14:55:57,809 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 14:55:58,067 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 14:55:58,417 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 14:55:58,423 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 14:55:58,463 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 14:55:58,525 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 14:55:58,602 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 14:55:58,603 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58 WrapperNode
[2023-10-25 14:55:58,603 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 14:55:58,604 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 14:55:58,604 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 14:55:58,604 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 14:55:58,623 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,649 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,693 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2023-10-25 14:55:58,693 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 14:55:58,694 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 14:55:58,694 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 14:55:58,694 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 14:55:58,701 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,708 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,725 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,727 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,733 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,747 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,750 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,762 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,764 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 14:55:58,765 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 14:55:58,765 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 14:55:58,765 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 14:55:58,766 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,771 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 14:55:58,797 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:55:58,820 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-25 14:55:58,867 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-25 14:55:58,883 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 14:55:58,883 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-25 14:55:58,884 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 14:55:58,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-25 14:55:58,886 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 14:55:58,887 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 14:55:58,887 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-25 14:55:58,887 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 14:55:58,887 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 14:55:58,887 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 14:55:58,887 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 14:55:58,888 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 14:55:59,335 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 14:55:59,359 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 14:55:59,753 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 14:55:59,758 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 14:55:59,773 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 14:55:59,775 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:55:59 BoogieIcfgContainer
[2023-10-25 14:55:59,776 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 14:55:59,778 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 14:55:59,778 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 14:55:59,780 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 14:55:59,781 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:55:57" (1/3) ...
[2023-10-25 14:55:59,781 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aea0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:55:59, skipping insertion in model container
[2023-10-25 14:55:59,781 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (2/3) ...
[2023-10-25 14:55:59,782 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aea0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:55:59, skipping insertion in model container
[2023-10-25 14:55:59,782 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:55:59" (3/3) ...
[2023-10-25 14:55:59,784 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race-2.i
[2023-10-25 14:55:59,804 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 14:55:59,812 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 14:55:59,812 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-10-25 14:55:59,812 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 14:55:59,931 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 14:55:59,990 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,111 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2023-10-25 14:56:00,111 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 14:56:00,115 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-10-25 14:56:00,115 INFO  L82        GeneralOperation]: Start removeDead. Operand has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,121 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,124 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 14:56:00,146 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,150 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,150 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,227 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2023-10-25 14:56:00,227 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 14:56:00,229 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-10-25 14:56:00,230 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2052
[2023-10-25 14:56:03,448 INFO  L134        LiptonReduction]: Checked pairs total: 12265
[2023-10-25 14:56:03,448 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-10-25 14:56:03,472 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 14:56:03,482 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;@748721b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 14:56:03,482 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-10-25 14:56:03,484 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-25 14:56:03,485 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 14:56:03,485 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:03,486 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-25 14:56:03,486 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-10-25 14:56:03,492 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:03,492 INFO  L85        PathProgramCache]: Analyzing trace with hash 381, now seen corresponding path program 1 times
[2023-10-25 14:56:03,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:03,501 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134911828]
[2023-10-25 14:56:03,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:03,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:03,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:03,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:03,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:03,756 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134911828]
[2023-10-25 14:56:03,756 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134911828] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:03,756 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:03,756 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-25 14:56:03,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942200486]
[2023-10-25 14:56:03,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:03,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 14:56:03,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:03,795 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 14:56:03,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 14:56:03,812 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193
[2023-10-25 14:56:03,814 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-10-25 14:56:03,814 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:03,814 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193
[2023-10-25 14:56:03,815 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:03,929 INFO  L130       PetriNetUnfolder]: 33/213 cut-off events.
[2023-10-25 14:56:03,929 INFO  L131       PetriNetUnfolder]: For 4/7 co-relation queries the response was YES.
[2023-10-25 14:56:03,931 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-10-25 14:56:03,934 INFO  L137   encePairwiseOnDemand]: 192/193 looper letters, 16 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2023-10-25 14:56:03,934 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 138 flow
[2023-10-25 14:56:03,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 14:56:03,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 14:56:03,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions.
[2023-10-25 14:56:03,962 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6139896373056994
[2023-10-25 14:56:03,963 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 237 transitions.
[2023-10-25 14:56:03,964 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions.
[2023-10-25 14:56:03,965 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:03,968 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions.
[2023-10-25 14:56:03,973 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-10-25 14:56:03,978 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-10-25 14:56:03,978 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-10-25 14:56:03,984 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 237 transitions.
[2023-10-25 14:56:03,984 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 138 flow
[2023-10-25 14:56:03,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:03,992 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2023-10-25 14:56:03,994 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-10-25 14:56:04,012 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2023-10-25 14:56:04,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2023-10-25 14:56:04,013 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-10-25 14:56:04,013 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:04,013 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:04,014 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 14:56:04,015 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-10-25 14:56:04,015 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:04,016 INFO  L85        PathProgramCache]: Analyzing trace with hash -835068003, now seen corresponding path program 1 times
[2023-10-25 14:56:04,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:04,018 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177835304]
[2023-10-25 14:56:04,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:04,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:04,130 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:04,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:04,739 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:04,740 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177835304]
[2023-10-25 14:56:04,741 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177835304] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:04,741 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:04,745 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:04,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534132878]
[2023-10-25 14:56:04,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:04,746 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:04,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:04,747 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:04,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:05,007 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-10-25 14:56:05,008 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-10-25 14:56:05,008 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:05,008 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-10-25 14:56:05,008 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:05,278 INFO  L130       PetriNetUnfolder]: 245/703 cut-off events.
[2023-10-25 14:56:05,278 INFO  L131       PetriNetUnfolder]: For 7/9 co-relation queries the response was YES.
[2023-10-25 14:56:05,281 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-10-25 14:56:05,285 INFO  L137   encePairwiseOnDemand]: 170/193 looper letters, 61 selfloop transitions, 29 changer transitions 0/102 dead transitions.
[2023-10-25 14:56:05,285 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 395 flow
[2023-10-25 14:56:05,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:05,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:05,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions.
[2023-10-25 14:56:05,296 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5207253886010362
[2023-10-25 14:56:05,297 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 603 transitions.
[2023-10-25 14:56:05,297 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 603 transitions.
[2023-10-25 14:56:05,297 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:05,297 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 603 transitions.
[2023-10-25 14:56:05,299 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-10-25 14:56:05,303 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-10-25 14:56:05,303 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-10-25 14:56:05,303 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 603 transitions.
[2023-10-25 14:56:05,304 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 395 flow
[2023-10-25 14:56:05,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:05,320 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2023-10-25 14:56:05,321 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-10-25 14:56:05,321 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2023-10-25 14:56:05,322 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2023-10-25 14:56:05,322 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-10-25 14:56:05,322 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:05,322 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:05,322 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 14:56:05,323 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-10-25 14:56:05,323 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:05,323 INFO  L85        PathProgramCache]: Analyzing trace with hash 1573274442, now seen corresponding path program 1 times
[2023-10-25 14:56:05,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:05,324 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261211170]
[2023-10-25 14:56:05,324 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:05,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:05,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:05,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:05,382 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:05,382 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261211170]
[2023-10-25 14:56:05,383 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261211170] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:05,383 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:05,383 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 14:56:05,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481173647]
[2023-10-25 14:56:05,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:05,384 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 14:56:05,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:05,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 14:56:05,386 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 14:56:05,395 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 193
[2023-10-25 14:56:05,396 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-10-25 14:56:05,396 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:05,396 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 193
[2023-10-25 14:56:05,396 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:05,636 INFO  L130       PetriNetUnfolder]: 122/485 cut-off events.
[2023-10-25 14:56:05,637 INFO  L131       PetriNetUnfolder]: For 111/116 co-relation queries the response was YES.
[2023-10-25 14:56:05,637 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-10-25 14:56:05,639 INFO  L137   encePairwiseOnDemand]: 189/193 looper letters, 24 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2023-10-25 14:56:05,639 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 392 flow
[2023-10-25 14:56:05,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 14:56:05,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 14:56:05,640 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions.
[2023-10-25 14:56:05,640 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5785837651122625
[2023-10-25 14:56:05,640 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 335 transitions.
[2023-10-25 14:56:05,640 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions.
[2023-10-25 14:56:05,641 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:05,641 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions.
[2023-10-25 14:56:05,642 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-10-25 14:56:05,643 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-10-25 14:56:05,644 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-10-25 14:56:05,644 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 335 transitions.
[2023-10-25 14:56:05,644 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 392 flow
[2023-10-25 14:56:05,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:05,651 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2023-10-25 14:56:05,651 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-10-25 14:56:05,652 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2023-10-25 14:56:05,652 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2023-10-25 14:56:05,652 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-10-25 14:56:05,652 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:05,653 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:05,653 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 14:56:05,656 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-10-25 14:56:05,656 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:05,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 348753171, now seen corresponding path program 1 times
[2023-10-25 14:56:05,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:05,656 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419776102]
[2023-10-25 14:56:05,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:05,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:05,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:06,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:06,022 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:06,037 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419776102]
[2023-10-25 14:56:06,037 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419776102] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:06,038 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:06,038 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:06,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738329427]
[2023-10-25 14:56:06,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:06,039 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:06,039 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:06,040 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:06,040 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:06,287 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193
[2023-10-25 14:56:06,287 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-10-25 14:56:06,287 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:06,288 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193
[2023-10-25 14:56:06,288 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:06,497 INFO  L130       PetriNetUnfolder]: 228/682 cut-off events.
[2023-10-25 14:56:06,498 INFO  L131       PetriNetUnfolder]: For 296/304 co-relation queries the response was YES.
[2023-10-25 14:56:06,501 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-10-25 14:56:06,503 INFO  L137   encePairwiseOnDemand]: 182/193 looper letters, 52 selfloop transitions, 33 changer transitions 8/128 dead transitions.
[2023-10-25 14:56:06,503 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 725 flow
[2023-10-25 14:56:06,503 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:06,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:06,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2023-10-25 14:56:06,511 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5483592400690847
[2023-10-25 14:56:06,511 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2023-10-25 14:56:06,511 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2023-10-25 14:56:06,512 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:06,512 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2023-10-25 14:56:06,513 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-10-25 14:56:06,515 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-10-25 14:56:06,516 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-10-25 14:56:06,516 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2023-10-25 14:56:06,516 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 725 flow
[2023-10-25 14:56:06,535 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:06,537 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2023-10-25 14:56:06,537 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-10-25 14:56:06,538 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2023-10-25 14:56:06,538 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2023-10-25 14:56:06,539 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-10-25 14:56:06,539 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:06,539 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:06,539 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 14:56:06,539 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-10-25 14:56:06,540 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:06,540 INFO  L85        PathProgramCache]: Analyzing trace with hash -1543790880, now seen corresponding path program 1 times
[2023-10-25 14:56:06,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:06,540 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233579720]
[2023-10-25 14:56:06,540 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:06,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:06,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:06,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:06,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:06,959 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233579720]
[2023-10-25 14:56:06,960 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233579720] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:06,960 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:06,960 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:06,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318368132]
[2023-10-25 14:56:06,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:06,961 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:06,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:06,961 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:06,961 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:07,123 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193
[2023-10-25 14:56:07,123 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-10-25 14:56:07,123 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:07,123 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193
[2023-10-25 14:56:07,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:07,543 INFO  L130       PetriNetUnfolder]: 402/1014 cut-off events.
[2023-10-25 14:56:07,547 INFO  L131       PetriNetUnfolder]: For 761/769 co-relation queries the response was YES.
[2023-10-25 14:56:07,549 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-10-25 14:56:07,565 INFO  L137   encePairwiseOnDemand]: 171/193 looper letters, 105 selfloop transitions, 76 changer transitions 24/218 dead transitions.
[2023-10-25 14:56:07,565 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 218 transitions, 1523 flow
[2023-10-25 14:56:07,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:07,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:07,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions.
[2023-10-25 14:56:07,567 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5474956822107081
[2023-10-25 14:56:07,567 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 634 transitions.
[2023-10-25 14:56:07,567 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions.
[2023-10-25 14:56:07,568 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:07,568 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions.
[2023-10-25 14:56:07,569 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-10-25 14:56:07,571 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-10-25 14:56:07,573 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-10-25 14:56:07,573 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 634 transitions.
[2023-10-25 14:56:07,573 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 218 transitions, 1523 flow
[2023-10-25 14:56:07,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 218 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:07,594 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2023-10-25 14:56:07,595 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-10-25 14:56:07,597 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2023-10-25 14:56:07,597 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2023-10-25 14:56:07,597 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-10-25 14:56:07,597 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:07,598 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-25 14:56:07,598 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 14:56:07,598 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-10-25 14:56:07,599 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:07,599 INFO  L85        PathProgramCache]: Analyzing trace with hash -1557923308, now seen corresponding path program 1 times
[2023-10-25 14:56:07,599 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:07,599 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355491670]
[2023-10-25 14:56:07,599 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:07,599 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:07,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 14:56:07,653 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 14:56:07,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 14:56:07,727 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 14:56:07,728 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 14:56:07,728 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-10-25 14:56:07,730 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-10-25 14:56:07,730 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-10-25 14:56:07,730 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-10-25 14:56:07,731 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-10-25 14:56:07,731 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-10-25 14:56:07,734 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-10-25 14:56:07,734 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-10-25 14:56:07,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-10-25 14:56:07,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-10-25 14:56:07,735 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-10-25 14:56:07,735 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 14:56:07,735 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:07,738 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 14:56:07,739 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 14:56:07,789 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-25 14:56:07,793 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:07,835 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2023-10-25 14:56:07,841 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 14:56:07,842 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-10-25 14:56:07,842 INFO  L82        GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:07,843 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:07,843 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 14:56:07,843 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:07,844 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:07,844 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:07,881 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2023-10-25 14:56:07,897 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 14:56:07,898 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-10-25 14:56:07,901 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5220
[2023-10-25 14:56:10,676 INFO  L134        LiptonReduction]: Checked pairs total: 30411
[2023-10-25 14:56:10,676 INFO  L136        LiptonReduction]: Total number of compositions: 82
[2023-10-25 14:56:10,677 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 14:56:10,678 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;@748721b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 14:56:10,678 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-10-25 14:56:10,679 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-25 14:56:10,679 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 14:56:10,679 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:10,679 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-25 14:56:10,679 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-10-25 14:56:10,679 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:10,679 INFO  L85        PathProgramCache]: Analyzing trace with hash 617, now seen corresponding path program 1 times
[2023-10-25 14:56:10,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:10,680 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861988361]
[2023-10-25 14:56:10,680 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:10,680 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:10,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:10,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:10,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:10,687 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861988361]
[2023-10-25 14:56:10,687 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861988361] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:10,687 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:10,688 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-25 14:56:10,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048413484]
[2023-10-25 14:56:10,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:10,688 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 14:56:10,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:10,690 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 14:56:10,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 14:56:10,690 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 217
[2023-10-25 14:56:10,691 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-10-25 14:56:10,691 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:10,691 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 217
[2023-10-25 14:56:10,691 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:10,966 INFO  L130       PetriNetUnfolder]: 411/1257 cut-off events.
[2023-10-25 14:56:10,966 INFO  L131       PetriNetUnfolder]: For 71/158 co-relation queries the response was YES.
[2023-10-25 14:56:10,968 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-10-25 14:56:10,971 INFO  L137   encePairwiseOnDemand]: 216/217 looper letters, 22 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2023-10-25 14:56:10,971 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 188 flow
[2023-10-25 14:56:10,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 14:56:10,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 14:56:10,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions.
[2023-10-25 14:56:10,973 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6428571428571429
[2023-10-25 14:56:10,973 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 279 transitions.
[2023-10-25 14:56:10,973 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 279 transitions.
[2023-10-25 14:56:10,973 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:10,973 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 279 transitions.
[2023-10-25 14:56:10,974 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-10-25 14:56:10,986 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-10-25 14:56:10,986 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-10-25 14:56:10,987 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 279 transitions.
[2023-10-25 14:56:10,987 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 188 flow
[2023-10-25 14:56:10,988 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:10,991 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2023-10-25 14:56:10,991 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-10-25 14:56:10,992 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2023-10-25 14:56:10,992 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2023-10-25 14:56:10,994 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-10-25 14:56:10,995 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:10,995 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:10,995 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-25 14:56:10,995 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-10-25 14:56:10,995 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:10,996 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578260816, now seen corresponding path program 1 times
[2023-10-25 14:56:10,996 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:10,996 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176667640]
[2023-10-25 14:56:10,996 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:10,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:11,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:11,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:11,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:11,251 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176667640]
[2023-10-25 14:56:11,252 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176667640] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:11,252 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:11,252 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:11,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208924858]
[2023-10-25 14:56:11,252 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:11,252 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:11,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:11,255 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:11,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:11,501 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217
[2023-10-25 14:56:11,502 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-10-25 14:56:11,502 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:11,502 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217
[2023-10-25 14:56:11,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:13,213 INFO  L130       PetriNetUnfolder]: 5742/10965 cut-off events.
[2023-10-25 14:56:13,229 INFO  L131       PetriNetUnfolder]: For 239/274 co-relation queries the response was YES.
[2023-10-25 14:56:13,239 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-10-25 14:56:13,314 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 93 selfloop transitions, 48 changer transitions 0/158 dead transitions.
[2023-10-25 14:56:13,314 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 158 transitions, 627 flow
[2023-10-25 14:56:13,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:13,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:13,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions.
[2023-10-25 14:56:13,316 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5668202764976958
[2023-10-25 14:56:13,316 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 738 transitions.
[2023-10-25 14:56:13,317 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions.
[2023-10-25 14:56:13,317 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:13,317 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions.
[2023-10-25 14:56:13,318 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-10-25 14:56:13,334 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:13,335 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:13,335 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 738 transitions.
[2023-10-25 14:56:13,335 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 158 transitions, 627 flow
[2023-10-25 14:56:13,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:13,339 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2023-10-25 14:56:13,339 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-10-25 14:56:13,341 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-10-25 14:56:13,341 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2023-10-25 14:56:13,341 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-10-25 14:56:13,341 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:13,341 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:13,341 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 14:56:13,342 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-10-25 14:56:13,342 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:13,342 INFO  L85        PathProgramCache]: Analyzing trace with hash 933296301, now seen corresponding path program 1 times
[2023-10-25 14:56:13,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:13,342 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776266963]
[2023-10-25 14:56:13,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:13,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:13,350 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:13,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:13,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:13,369 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776266963]
[2023-10-25 14:56:13,369 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776266963] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:13,369 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:13,369 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 14:56:13,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986787301]
[2023-10-25 14:56:13,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:13,370 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 14:56:13,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:13,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 14:56:13,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 14:56:13,388 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2023-10-25 14:56:13,389 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-10-25 14:56:13,389 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:13,389 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2023-10-25 14:56:13,389 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:14,265 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-10-25 14:56:14,266 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,266 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,266 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,266 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,266 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-10-25 14:56:14,266 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,267 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,267 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,267 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,475 INFO  L130       PetriNetUnfolder]: 2751/6463 cut-off events.
[2023-10-25 14:56:14,489 INFO  L131       PetriNetUnfolder]: For 1904/2456 co-relation queries the response was YES.
[2023-10-25 14:56:14,511 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-10-25 14:56:14,562 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2023-10-25 14:56:14,563 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2023-10-25 14:56:14,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 14:56:14,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 14:56:14,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions.
[2023-10-25 14:56:14,564 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5990783410138248
[2023-10-25 14:56:14,564 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 390 transitions.
[2023-10-25 14:56:14,565 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions.
[2023-10-25 14:56:14,565 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:14,565 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions.
[2023-10-25 14:56:14,566 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-10-25 14:56:14,566 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-10-25 14:56:14,567 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-10-25 14:56:14,567 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 390 transitions.
[2023-10-25 14:56:14,567 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2023-10-25 14:56:14,595 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:14,609 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2023-10-25 14:56:14,610 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-10-25 14:56:14,611 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-10-25 14:56:14,611 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2023-10-25 14:56:14,611 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-10-25 14:56:14,611 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:14,612 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:14,612 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-25 14:56:14,612 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-10-25 14:56:14,612 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:14,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -2101318696, now seen corresponding path program 1 times
[2023-10-25 14:56:14,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:14,613 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125404443]
[2023-10-25 14:56:14,613 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:14,613 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:14,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:14,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:14,862 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:14,862 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125404443]
[2023-10-25 14:56:14,862 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125404443] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:14,862 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:14,863 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:14,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194565183]
[2023-10-25 14:56:14,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:14,864 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:14,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:14,865 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:14,865 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:15,141 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2023-10-25 14:56:15,141 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-10-25 14:56:15,141 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:15,141 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2023-10-25 14:56:15,141 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:17,003 INFO  L130       PetriNetUnfolder]: 5675/10752 cut-off events.
[2023-10-25 14:56:17,003 INFO  L131       PetriNetUnfolder]: For 6509/6607 co-relation queries the response was YES.
[2023-10-25 14:56:17,037 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-10-25 14:56:17,096 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 110 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2023-10-25 14:56:17,109 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1313 flow
[2023-10-25 14:56:17,110 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:17,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:17,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions.
[2023-10-25 14:56:17,116 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821812596006144
[2023-10-25 14:56:17,116 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 758 transitions.
[2023-10-25 14:56:17,116 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions.
[2023-10-25 14:56:17,117 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:17,117 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions.
[2023-10-25 14:56:17,127 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-10-25 14:56:17,128 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:17,129 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:17,129 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 758 transitions.
[2023-10-25 14:56:17,129 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1313 flow
[2023-10-25 14:56:17,145 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:17,167 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2023-10-25 14:56:17,168 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-10-25 14:56:17,168 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2023-10-25 14:56:17,169 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2023-10-25 14:56:17,169 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-10-25 14:56:17,169 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:17,169 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:17,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-25 14:56:17,169 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-10-25 14:56:17,170 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:17,170 INFO  L85        PathProgramCache]: Analyzing trace with hash 1490734773, now seen corresponding path program 1 times
[2023-10-25 14:56:17,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:17,171 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073573974]
[2023-10-25 14:56:17,171 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:17,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:17,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:17,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:17,515 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:17,515 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073573974]
[2023-10-25 14:56:17,515 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073573974] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:17,515 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:17,516 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:17,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92672010]
[2023-10-25 14:56:17,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:17,516 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:17,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:17,517 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:17,517 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:17,723 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-10-25 14:56:17,724 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-10-25 14:56:17,724 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:17,724 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-10-25 14:56:17,724 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:20,376 INFO  L130       PetriNetUnfolder]: 11355/20109 cut-off events.
[2023-10-25 14:56:20,377 INFO  L131       PetriNetUnfolder]: For 18604/18765 co-relation queries the response was YES.
[2023-10-25 14:56:20,406 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-10-25 14:56:20,837 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 239 selfloop transitions, 132 changer transitions 0/389 dead transitions.
[2023-10-25 14:56:20,838 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 389 transitions, 2939 flow
[2023-10-25 14:56:20,838 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:20,838 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:20,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2023-10-25 14:56:20,840 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2023-10-25 14:56:20,841 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2023-10-25 14:56:20,841 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2023-10-25 14:56:20,841 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:20,841 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2023-10-25 14:56:20,843 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-10-25 14:56:20,859 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:20,860 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:20,860 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 778 transitions.
[2023-10-25 14:56:20,860 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 389 transitions, 2939 flow
[2023-10-25 14:56:20,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 389 transitions, 2939 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:20,938 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2023-10-25 14:56:20,939 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-10-25 14:56:20,939 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2023-10-25 14:56:20,940 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2023-10-25 14:56:20,940 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-10-25 14:56:20,940 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:20,940 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:20,940 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 14:56:20,940 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-10-25 14:56:20,941 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:20,941 INFO  L85        PathProgramCache]: Analyzing trace with hash -686777030, now seen corresponding path program 1 times
[2023-10-25 14:56:20,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:20,941 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698277051]
[2023-10-25 14:56:20,941 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:20,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:20,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:21,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 14:56:21,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:21,445 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698277051]
[2023-10-25 14:56:21,446 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698277051] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:21,448 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685664514]
[2023-10-25 14:56:21,448 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:21,448 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:21,448 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:21,473 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:56:21,513 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-25 14:56:21,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:21,636 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-10-25 14:56:21,657 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:21,872 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:56:21,913 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:21,915 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:56:21,962 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:21,963 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:21,965 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:56:22,020 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:22,021 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:22,022 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:22,023 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:56:22,096 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:22,097 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:56:22,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 14:56:22,122 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:56:22,179 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-10-25 14:56:22,218 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-10-25 14:56:22,254 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-10-25 14:56:22,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2023-10-25 14:56:22,321 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685664514] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:56:22,321 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:56:22,321 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15
[2023-10-25 14:56:22,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719356702]
[2023-10-25 14:56:22,322 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:56:22,322 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2023-10-25 14:56:22,322 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:22,323 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2023-10-25 14:56:22,323 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=121, Unknown=3, NotChecked=78, Total=272
[2023-10-25 14:56:22,334 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 217
[2023-10-25 14:56:22,335 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-10-25 14:56:22,335 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:22,335 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 217
[2023-10-25 14:56:22,335 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:26,344 INFO  L130       PetriNetUnfolder]: 14603/24245 cut-off events.
[2023-10-25 14:56:26,344 INFO  L131       PetriNetUnfolder]: For 41050/41050 co-relation queries the response was YES.
[2023-10-25 14:56:26,423 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-10-25 14:56:26,670 INFO  L137   encePairwiseOnDemand]: 207/217 looper letters, 500 selfloop transitions, 54 changer transitions 1/562 dead transitions.
[2023-10-25 14:56:26,685 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 562 transitions, 5374 flow
[2023-10-25 14:56:26,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 14:56:26,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 14:56:26,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions.
[2023-10-25 14:56:26,688 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46017116524028967
[2023-10-25 14:56:26,688 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 699 transitions.
[2023-10-25 14:56:26,688 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions.
[2023-10-25 14:56:26,688 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:26,689 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions.
[2023-10-25 14:56:26,690 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-10-25 14:56:26,691 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-10-25 14:56:26,692 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-10-25 14:56:26,692 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 699 transitions.
[2023-10-25 14:56:26,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 562 transitions, 5374 flow
[2023-10-25 14:56:27,208 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 562 transitions, 5278 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:27,215 INFO  L231             Difference]: Finished difference. Result has 102 places, 314 transitions, 2506 flow
[2023-10-25 14:56:27,215 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-10-25 14:56:27,216 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 35 predicate places.
[2023-10-25 14:56:27,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 314 transitions, 2506 flow
[2023-10-25 14:56:27,217 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-10-25 14:56:27,217 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:27,217 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-10-25 14:56:27,240 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-10-25 14:56:27,422 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-10-25 14:56:27,422 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-10-25 14:56:27,422 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:27,423 INFO  L85        PathProgramCache]: Analyzing trace with hash -1154275821, now seen corresponding path program 1 times
[2023-10-25 14:56:27,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:27,423 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314715695]
[2023-10-25 14:56:27,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:27,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:27,444 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:27,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 14:56:27,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:27,866 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314715695]
[2023-10-25 14:56:27,866 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314715695] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:27,866 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:27,866 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-25 14:56:27,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231463634]
[2023-10-25 14:56:27,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:27,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-25 14:56:27,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:27,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-25 14:56:27,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-25 14:56:28,443 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217
[2023-10-25 14:56:28,444 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-10-25 14:56:28,444 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:28,444 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217
[2023-10-25 14:56:28,444 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:31,653 INFO  L130       PetriNetUnfolder]: 13820/24388 cut-off events.
[2023-10-25 14:56:31,653 INFO  L131       PetriNetUnfolder]: For 46821/46988 co-relation queries the response was YES.
[2023-10-25 14:56:31,731 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-10-25 14:56:31,879 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 462 selfloop transitions, 166 changer transitions 2/647 dead transitions.
[2023-10-25 14:56:31,879 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 647 transitions, 6020 flow
[2023-10-25 14:56:31,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-25 14:56:31,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-25 14:56:31,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 973 transitions.
[2023-10-25 14:56:31,884 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5604838709677419
[2023-10-25 14:56:31,884 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 973 transitions.
[2023-10-25 14:56:31,885 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 973 transitions.
[2023-10-25 14:56:31,885 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:31,901 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 973 transitions.
[2023-10-25 14:56:31,905 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-10-25 14:56:31,909 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-10-25 14:56:31,909 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-10-25 14:56:31,910 INFO  L175             Difference]: Start difference. First operand has 102 places, 314 transitions, 2506 flow. Second operand 8 states and 973 transitions.
[2023-10-25 14:56:31,910 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 647 transitions, 6020 flow
[2023-10-25 14:56:32,188 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 647 transitions, 5921 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-25 14:56:32,195 INFO  L231             Difference]: Finished difference. Result has 111 places, 430 transitions, 4113 flow
[2023-10-25 14:56:32,196 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-10-25 14:56:32,196 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 44 predicate places.
[2023-10-25 14:56:32,197 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 430 transitions, 4113 flow
[2023-10-25 14:56:32,197 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-10-25 14:56:32,197 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:32,198 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-10-25 14:56:32,198 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-25 14:56:32,198 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-10-25 14:56:32,199 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:32,200 INFO  L85        PathProgramCache]: Analyzing trace with hash 340394548, now seen corresponding path program 1 times
[2023-10-25 14:56:32,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:32,200 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069072141]
[2023-10-25 14:56:32,200 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:32,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:32,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:32,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:32,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:32,326 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069072141]
[2023-10-25 14:56:32,326 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069072141] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:32,326 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903255201]
[2023-10-25 14:56:32,326 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:32,326 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:32,327 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:32,341 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:56:32,397 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-25 14:56:32,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:32,483 INFO  L263         TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 14:56:32,484 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:32,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:32,522 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:56:32,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:32,546 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [903255201] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:56:32,546 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:56:32,546 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2023-10-25 14:56:32,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688208862]
[2023-10-25 14:56:32,548 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:56:32,548 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-10-25 14:56:32,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:32,549 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-10-25 14:56:32,549 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2023-10-25 14:56:32,665 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2023-10-25 14:56:32,666 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-10-25 14:56:32,666 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:32,666 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2023-10-25 14:56:32,666 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:34,544 INFO  L130       PetriNetUnfolder]: 5754/12879 cut-off events.
[2023-10-25 14:56:34,544 INFO  L131       PetriNetUnfolder]: For 42930/44884 co-relation queries the response was YES.
[2023-10-25 14:56:34,576 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-10-25 14:56:34,610 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 152 selfloop transitions, 5 changer transitions 23/483 dead transitions.
[2023-10-25 14:56:34,611 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 483 transitions, 4821 flow
[2023-10-25 14:56:34,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 14:56:34,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 14:56:34,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions.
[2023-10-25 14:56:34,614 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5766951942067149
[2023-10-25 14:56:34,614 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 876 transitions.
[2023-10-25 14:56:34,614 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions.
[2023-10-25 14:56:34,614 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:34,614 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions.
[2023-10-25 14:56:34,616 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-10-25 14:56:34,620 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-10-25 14:56:34,621 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-10-25 14:56:34,621 INFO  L175             Difference]: Start difference. First operand has 111 places, 430 transitions, 4113 flow. Second operand 7 states and 876 transitions.
[2023-10-25 14:56:34,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 483 transitions, 4821 flow
[2023-10-25 14:56:34,819 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 483 transitions, 4807 flow, removed 7 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:34,823 INFO  L231             Difference]: Finished difference. Result has 120 places, 390 transitions, 3685 flow
[2023-10-25 14:56:34,823 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-10-25 14:56:34,825 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 53 predicate places.
[2023-10-25 14:56:34,826 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 390 transitions, 3685 flow
[2023-10-25 14:56:34,826 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-10-25 14:56:34,826 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:34,826 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-10-25 14:56:34,837 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-25 14:56:35,034 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-10-25 14:56:35,035 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-10-25 14:56:35,035 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:35,035 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108254852, now seen corresponding path program 1 times
[2023-10-25 14:56:35,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:35,036 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399960784]
[2023-10-25 14:56:35,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:35,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:35,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:35,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 14:56:35,454 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:35,454 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399960784]
[2023-10-25 14:56:35,454 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399960784] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:35,454 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:35,454 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-25 14:56:35,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419136215]
[2023-10-25 14:56:35,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:35,455 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-25 14:56:35,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:35,469 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-25 14:56:35,469 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-25 14:56:35,891 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-10-25 14:56:35,891 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-10-25 14:56:35,891 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:35,891 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-10-25 14:56:35,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:38,287 INFO  L130       PetriNetUnfolder]: 8771/16346 cut-off events.
[2023-10-25 14:56:38,288 INFO  L131       PetriNetUnfolder]: For 65828/66223 co-relation queries the response was YES.
[2023-10-25 14:56:38,322 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-10-25 14:56:38,402 INFO  L137   encePairwiseOnDemand]: 209/217 looper letters, 343 selfloop transitions, 13 changer transitions 7/402 dead transitions.
[2023-10-25 14:56:38,403 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 402 transitions, 4497 flow
[2023-10-25 14:56:38,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 14:56:38,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 14:56:38,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions.
[2023-10-25 14:56:38,407 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48847926267281105
[2023-10-25 14:56:38,407 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 742 transitions.
[2023-10-25 14:56:38,407 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 742 transitions.
[2023-10-25 14:56:38,408 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:38,408 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 742 transitions.
[2023-10-25 14:56:38,409 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-10-25 14:56:38,411 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-10-25 14:56:38,411 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-10-25 14:56:38,412 INFO  L175             Difference]: Start difference. First operand has 120 places, 390 transitions, 3685 flow. Second operand 7 states and 742 transitions.
[2023-10-25 14:56:38,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 402 transitions, 4497 flow
[2023-10-25 14:56:38,607 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 402 transitions, 4408 flow, removed 6 selfloop flow, removed 3 redundant places.
[2023-10-25 14:56:38,613 INFO  L231             Difference]: Finished difference. Result has 122 places, 388 transitions, 3635 flow
[2023-10-25 14:56:38,614 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-10-25 14:56:38,615 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 55 predicate places.
[2023-10-25 14:56:38,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 388 transitions, 3635 flow
[2023-10-25 14:56:38,615 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-10-25 14:56:38,615 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:38,616 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-10-25 14:56:38,616 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-25 14:56:38,616 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-10-25 14:56:38,617 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:38,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 860099489, now seen corresponding path program 1 times
[2023-10-25 14:56:38,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:38,619 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718495406]
[2023-10-25 14:56:38,619 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:38,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:38,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:38,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-25 14:56:38,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:38,997 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718495406]
[2023-10-25 14:56:38,997 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718495406] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:38,998 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:38,998 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:38,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760810941]
[2023-10-25 14:56:38,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:39,000 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:39,000 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:39,001 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:39,001 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:39,172 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-10-25 14:56:39,173 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-10-25 14:56:39,173 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:39,173 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-10-25 14:56:39,173 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:42,676 INFO  L130       PetriNetUnfolder]: 12785/22892 cut-off events.
[2023-10-25 14:56:42,676 INFO  L131       PetriNetUnfolder]: For 82261/82659 co-relation queries the response was YES.
[2023-10-25 14:56:42,740 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-10-25 14:56:42,808 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 405 selfloop transitions, 156 changer transitions 18/594 dead transitions.
[2023-10-25 14:56:42,809 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 594 transitions, 6405 flow
[2023-10-25 14:56:42,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:42,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:42,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2023-10-25 14:56:42,828 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2023-10-25 14:56:42,828 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2023-10-25 14:56:42,828 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2023-10-25 14:56:42,829 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:42,829 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2023-10-25 14:56:42,830 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-10-25 14:56:42,831 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:42,832 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:42,839 INFO  L175             Difference]: Start difference. First operand has 122 places, 388 transitions, 3635 flow. Second operand 6 states and 778 transitions.
[2023-10-25 14:56:42,839 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 594 transitions, 6405 flow
[2023-10-25 14:56:43,206 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 594 transitions, 6347 flow, removed 1 selfloop flow, removed 3 redundant places.
[2023-10-25 14:56:43,216 INFO  L231             Difference]: Finished difference. Result has 128 places, 501 transitions, 5166 flow
[2023-10-25 14:56:43,217 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-10-25 14:56:43,217 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 61 predicate places.
[2023-10-25 14:56:43,217 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 501 transitions, 5166 flow
[2023-10-25 14:56:43,217 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-10-25 14:56:43,218 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:43,218 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-10-25 14:56:43,218 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-25 14:56:43,218 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-10-25 14:56:43,218 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:43,218 INFO  L85        PathProgramCache]: Analyzing trace with hash -907237555, now seen corresponding path program 1 times
[2023-10-25 14:56:43,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:43,219 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387191278]
[2023-10-25 14:56:43,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:43,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:43,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:44,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:44,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:44,746 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387191278]
[2023-10-25 14:56:44,746 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387191278] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:44,746 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323961333]
[2023-10-25 14:56:44,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:44,747 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:44,747 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:44,748 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:56:44,784 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-25 14:56:44,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:44,909 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-10-25 14:56:44,912 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:44,936 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-10-25 14:56:45,088 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 14:56:45,089 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-10-25 14:56:45,151 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-10-25 14:56:45,178 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-10-25 14:56:45,204 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-10-25 14:56:45,240 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-10-25 14:56:45,291 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:45,291 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-10-25 14:56:45,345 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:45,346 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-10-25 14:56:45,416 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-10-25 14:56:45,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 14:56:45,441 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 14:56:45,441 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323961333] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:45,441 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-25 14:56:45,442 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21
[2023-10-25 14:56:45,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645828417]
[2023-10-25 14:56:45,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:45,443 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-25 14:56:45,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:45,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-25 14:56:45,444 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506
[2023-10-25 14:56:45,945 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217
[2023-10-25 14:56:45,946 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-10-25 14:56:45,946 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:45,946 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217
[2023-10-25 14:56:45,946 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:51,629 INFO  L130       PetriNetUnfolder]: 16066/28224 cut-off events.
[2023-10-25 14:56:51,630 INFO  L131       PetriNetUnfolder]: For 138124/138543 co-relation queries the response was YES.
[2023-10-25 14:56:51,709 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-10-25 14:56:51,802 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 933 selfloop transitions, 283 changer transitions 35/1263 dead transitions.
[2023-10-25 14:56:51,803 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1263 transitions, 15728 flow
[2023-10-25 14:56:51,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-25 14:56:51,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-25 14:56:51,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1167 transitions.
[2023-10-25 14:56:51,824 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48889819857561795
[2023-10-25 14:56:51,824 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1167 transitions.
[2023-10-25 14:56:51,825 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1167 transitions.
[2023-10-25 14:56:51,825 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:51,825 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1167 transitions.
[2023-10-25 14:56:51,827 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-10-25 14:56:51,829 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-10-25 14:56:51,837 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-10-25 14:56:51,837 INFO  L175             Difference]: Start difference. First operand has 128 places, 501 transitions, 5166 flow. Second operand 11 states and 1167 transitions.
[2023-10-25 14:56:51,837 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 1263 transitions, 15728 flow
[2023-10-25 14:56:52,952 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1263 transitions, 15478 flow, removed 125 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:52,964 INFO  L231             Difference]: Finished difference. Result has 145 places, 755 transitions, 9363 flow
[2023-10-25 14:56:52,964 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-10-25 14:56:52,969 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 78 predicate places.
[2023-10-25 14:56:52,969 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 755 transitions, 9363 flow
[2023-10-25 14:56:52,970 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-10-25 14:56:52,970 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:52,970 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-10-25 14:56:52,976 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 14:56:53,174 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-10-25 14:56:53,174 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-10-25 14:56:53,175 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:53,175 INFO  L85        PathProgramCache]: Analyzing trace with hash -103982335, now seen corresponding path program 2 times
[2023-10-25 14:56:53,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:53,177 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913188669]
[2023-10-25 14:56:53,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:53,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:53,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:54,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:54,035 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:54,035 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913188669]
[2023-10-25 14:56:54,035 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913188669] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:54,035 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705358225]
[2023-10-25 14:56:54,035 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 14:56:54,035 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:54,035 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:54,036 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:56:54,072 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-25 14:56:54,217 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 14:56:54,217 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:56:54,218 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-10-25 14:56:54,221 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:54,239 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:54,242 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-10-25 14:56:54,407 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 14:56:54,408 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-10-25 14:56:54,459 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:54,460 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-10-25 14:56:54,478 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-10-25 14:56:54,531 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-10-25 14:56:54,604 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:54,605 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-10-25 14:56:54,720 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-25 14:56:54,771 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:54,772 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-10-25 14:56:54,810 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:54,811 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-10-25 14:56:54,892 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:54,893 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-10-25 14:56:54,918 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:54,920 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-10-25 14:56:54,960 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:54,960 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-10-25 14:56:55,011 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 14:56:55,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:55,023 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 14:56:55,023 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [705358225] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:55,026 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-25 14:56:55,026 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-10-25 14:56:55,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951095622]
[2023-10-25 14:56:55,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:55,026 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-25 14:56:55,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:55,027 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-25 14:56:55,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2023-10-25 14:56:55,746 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217
[2023-10-25 14:56:55,747 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-10-25 14:56:55,747 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:55,747 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217
[2023-10-25 14:56:55,747 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:03,090 INFO  L130       PetriNetUnfolder]: 17180/30220 cut-off events.
[2023-10-25 14:57:03,090 INFO  L131       PetriNetUnfolder]: For 206398/206888 co-relation queries the response was YES.
[2023-10-25 14:57:03,276 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-10-25 14:57:03,383 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 838 selfloop transitions, 526 changer transitions 51/1427 dead transitions.
[2023-10-25 14:57:03,383 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 1427 transitions, 19203 flow
[2023-10-25 14:57:03,384 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-10-25 14:57:03,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2023-10-25 14:57:03,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1651 transitions.
[2023-10-25 14:57:03,413 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5072196620583718
[2023-10-25 14:57:03,414 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1651 transitions.
[2023-10-25 14:57:03,414 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1651 transitions.
[2023-10-25 14:57:03,415 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:03,415 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1651 transitions.
[2023-10-25 14:57:03,419 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-10-25 14:57:03,431 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-10-25 14:57:03,432 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-10-25 14:57:03,433 INFO  L175             Difference]: Start difference. First operand has 145 places, 755 transitions, 9363 flow. Second operand 15 states and 1651 transitions.
[2023-10-25 14:57:03,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 1427 transitions, 19203 flow
[2023-10-25 14:57:05,757 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 1427 transitions, 19137 flow, removed 25 selfloop flow, removed 2 redundant places.
[2023-10-25 14:57:05,771 INFO  L231             Difference]: Finished difference. Result has 163 places, 999 transitions, 14370 flow
[2023-10-25 14:57:05,772 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-10-25 14:57:05,772 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 96 predicate places.
[2023-10-25 14:57:05,772 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 999 transitions, 14370 flow
[2023-10-25 14:57:05,772 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-10-25 14:57:05,773 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:05,773 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-10-25 14:57:05,779 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-25 14:57:05,977 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-10-25 14:57:05,978 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-10-25 14:57:05,978 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:05,993 INFO  L85        PathProgramCache]: Analyzing trace with hash -1403000896, now seen corresponding path program 1 times
[2023-10-25 14:57:05,993 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:05,994 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903257720]
[2023-10-25 14:57:05,994 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:05,994 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:06,058 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:06,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:06,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:06,671 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903257720]
[2023-10-25 14:57:06,671 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903257720] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:06,671 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030286533]
[2023-10-25 14:57:06,671 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:06,671 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:06,672 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:06,686 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:57:06,717 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-10-25 14:57:06,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:06,850 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-10-25 14:57:06,853 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:06,860 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:06,862 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-10-25 14:57:06,980 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 14:57:06,981 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-10-25 14:57:07,017 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:07,018 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-10-25 14:57:07,060 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-25 14:57:07,073 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-10-25 14:57:07,099 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-10-25 14:57:07,110 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:07,110 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-10-25 14:57:07,122 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:07,122 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-10-25 14:57:07,151 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-10-25 14:57:07,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 14:57:07,159 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 14:57:07,159 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030286533] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:57:07,159 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-25 14:57:07,159 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12
[2023-10-25 14:57:07,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469576449]
[2023-10-25 14:57:07,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:57:07,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-25 14:57:07,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:07,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-25 14:57:07,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2023-10-25 14:57:07,834 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217
[2023-10-25 14:57:07,835 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-10-25 14:57:07,835 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:07,835 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217
[2023-10-25 14:57:07,835 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:14,472 INFO  L130       PetriNetUnfolder]: 14478/26890 cut-off events.
[2023-10-25 14:57:14,473 INFO  L131       PetriNetUnfolder]: For 258288/259655 co-relation queries the response was YES.
[2023-10-25 14:57:14,646 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-10-25 14:57:14,748 INFO  L137   encePairwiseOnDemand]: 206/217 looper letters, 1230 selfloop transitions, 93 changer transitions 15/1486 dead transitions.
[2023-10-25 14:57:14,749 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1486 transitions, 23687 flow
[2023-10-25 14:57:14,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-10-25 14:57:14,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-10-25 14:57:14,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions.
[2023-10-25 14:57:14,751 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5412186379928315
[2023-10-25 14:57:14,751 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions.
[2023-10-25 14:57:14,751 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions.
[2023-10-25 14:57:14,761 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:14,761 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions.
[2023-10-25 14:57:14,772 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-10-25 14:57:14,774 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-10-25 14:57:14,774 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-10-25 14:57:14,774 INFO  L175             Difference]: Start difference. First operand has 163 places, 999 transitions, 14370 flow. Second operand 9 states and 1057 transitions.
[2023-10-25 14:57:14,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1486 transitions, 23687 flow
[2023-10-25 14:57:17,623 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 1486 transitions, 23017 flow, removed 328 selfloop flow, removed 3 redundant places.
[2023-10-25 14:57:17,651 INFO  L231             Difference]: Finished difference. Result has 165 places, 998 transitions, 13986 flow
[2023-10-25 14:57:17,652 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-10-25 14:57:17,652 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 98 predicate places.
[2023-10-25 14:57:17,653 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 998 transitions, 13986 flow
[2023-10-25 14:57:17,653 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-10-25 14:57:17,653 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:17,653 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-10-25 14:57:17,659 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-25 14:57:17,858 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-10-25 14:57:17,858 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-10-25 14:57:17,859 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:17,859 INFO  L85        PathProgramCache]: Analyzing trace with hash 1127119439, now seen corresponding path program 3 times
[2023-10-25 14:57:17,859 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:17,862 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160663181]
[2023-10-25 14:57:17,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:17,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:17,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:18,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:18,627 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:18,627 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160663181]
[2023-10-25 14:57:18,627 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160663181] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:18,627 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904117866]
[2023-10-25 14:57:18,627 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-25 14:57:18,627 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:18,627 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:18,645 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:57:18,690 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-10-25 14:57:18,858 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-25 14:57:18,859 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:57:18,872 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 58 conjunts are in the unsatisfiable core
[2023-10-25 14:57:18,876 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:18,887 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-10-25 14:57:19,090 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 14:57:19,090 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-10-25 14:57:19,094 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:19,098 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-10-25 14:57:19,241 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-25 14:57:19,268 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-10-25 14:57:19,341 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-10-25 14:57:19,394 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-10-25 14:57:19,470 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-10-25 14:57:19,490 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-10-25 14:57:19,547 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-10-25 14:57:19,601 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-10-25 14:57:19,639 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-10-25 14:57:19,722 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-10-25 14:57:19,744 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-10-25 14:57:19,776 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-10-25 14:57:19,871 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-10-25 14:57:19,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:19,921 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:19,941 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-10-25 14:57:34,303 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-10-25 14:57:34,369 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-10-25 14:57:35,074 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:35,075 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-10-25 14:57:35,084 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:35,084 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-10-25 14:57:35,105 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-10-25 14:57:35,112 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-10-25 14:57:35,120 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-10-25 14:57:35,171 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:57:35,171 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-10-25 14:57:35,181 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:57:35,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 1
[2023-10-25 14:57:35,188 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:57:35,188 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-10-25 14:57:35,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:35,402 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [904117866] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:35,402 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:35,402 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2023-10-25 14:57:35,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60898940]
[2023-10-25 14:57:35,403 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:35,403 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-10-25 14:57:35,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:35,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-10-25 14:57:35,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=620, Unknown=70, NotChecked=168, Total=992
[2023-10-25 14:57:35,405 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2023-10-25 14:57:35,406 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-10-25 14:57:35,406 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:35,406 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2023-10-25 14:57:35,406 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:50,097 INFO  L130       PetriNetUnfolder]: 25390/41997 cut-off events.
[2023-10-25 14:57:50,098 INFO  L131       PetriNetUnfolder]: For 365076/365076 co-relation queries the response was YES.
[2023-10-25 14:57:50,284 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-10-25 14:57:50,443 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 1213 selfloop transitions, 584 changer transitions 59/1859 dead transitions.
[2023-10-25 14:57:50,443 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1859 transitions, 27522 flow
[2023-10-25 14:57:50,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-10-25 14:57:50,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-10-25 14:57:50,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1827 transitions.
[2023-10-25 14:57:50,446 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38269794721407624
[2023-10-25 14:57:50,446 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1827 transitions.
[2023-10-25 14:57:50,446 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1827 transitions.
[2023-10-25 14:57:50,447 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:50,447 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1827 transitions.
[2023-10-25 14:57:50,451 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-10-25 14:57:50,466 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-10-25 14:57:50,467 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-10-25 14:57:50,467 INFO  L175             Difference]: Start difference. First operand has 165 places, 998 transitions, 13986 flow. Second operand 22 states and 1827 transitions.
[2023-10-25 14:57:50,467 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1859 transitions, 27522 flow
[2023-10-25 14:57:53,785 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 1859 transitions, 27148 flow, removed 0 selfloop flow, removed 8 redundant places.
[2023-10-25 14:57:53,810 INFO  L231             Difference]: Finished difference. Result has 186 places, 1230 transitions, 19430 flow
[2023-10-25 14:57:53,811 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-10-25 14:57:53,811 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 119 predicate places.
[2023-10-25 14:57:53,812 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 1230 transitions, 19430 flow
[2023-10-25 14:57:53,812 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-10-25 14:57:53,812 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:53,812 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-10-25 14:57:53,819 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-25 14:57:54,017 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-10-25 14:57:54,018 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-10-25 14:57:54,033 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:54,033 INFO  L85        PathProgramCache]: Analyzing trace with hash -1195414565, now seen corresponding path program 4 times
[2023-10-25 14:57:54,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:54,034 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042809217]
[2023-10-25 14:57:54,034 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:54,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:54,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:54,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:54,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:54,905 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042809217]
[2023-10-25 14:57:54,905 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042809217] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:54,905 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28275219]
[2023-10-25 14:57:54,905 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-25 14:57:54,905 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:54,906 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:54,910 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:57:54,953 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-10-25 14:57:55,245 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-25 14:57:55,246 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:57:55,256 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-10-25 14:57:55,261 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:55,281 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:55,289 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-10-25 14:57:55,651 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 14:57:55,651 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-10-25 14:57:55,657 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:55,658 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-10-25 14:57:55,850 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:55,851 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-10-25 14:57:55,872 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:55,873 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-10-25 14:57:55,962 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-10-25 14:57:56,044 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-25 14:57:56,052 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-10-25 14:57:56,109 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-10-25 14:57:56,202 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-10-25 14:57:56,310 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-10-25 14:57:56,410 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:56,411 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-10-25 14:57:56,462 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:56,463 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-10-25 14:57:56,513 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:56,514 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-10-25 14:57:56,577 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:56,594 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-10-25 14:57:56,811 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:56,812 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:56,813 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-10-25 14:57:56,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:56,902 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:57,211 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-10-25 14:57:57,362 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-10-25 14:57:57,409 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-10-25 14:57:57,485 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-10-25 14:57:57,534 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-10-25 14:57:57,568 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:57,568 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-10-25 14:57:57,575 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:57,575 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-10-25 14:57:57,595 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-10-25 14:57:57,604 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:57,604 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-10-25 14:57:57,670 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 14:57:57,670 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-10-25 14:57:57,676 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 14:57:57,676 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-10-25 14:57:57,683 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 14:57:57,683 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-10-25 14:57:57,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:57,896 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [28275219] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:57,896 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:57,896 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2023-10-25 14:57:57,896 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302134713]
[2023-10-25 14:57:57,896 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:57,896 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-10-25 14:57:57,896 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:57,897 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-10-25 14:57:57,897 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=580, Unknown=14, NotChecked=270, Total=992
[2023-10-25 14:57:58,285 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2023-10-25 14:57:58,286 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-10-25 14:57:58,286 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:58,286 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2023-10-25 14:57:58,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:58:17,761 INFO  L130       PetriNetUnfolder]: 28066/46473 cut-off events.
[2023-10-25 14:58:17,762 INFO  L131       PetriNetUnfolder]: For 588886/588896 co-relation queries the response was YES.
[2023-10-25 14:58:17,983 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 330586 conditions, 46473 events. 28066/46473 cut-off events. For 588886/588896 co-relation queries the response was YES. Maximal size of possible extension queue 1224. Compared 355438 event pairs, 4369 based on Foata normal form. 206/46674 useless extension candidates. Maximal degree in co-relation 330528. Up to 17243 conditions per place. 
[2023-10-25 14:58:18,251 INFO  L137   encePairwiseOnDemand]: 180/217 looper letters, 1436 selfloop transitions, 721 changer transitions 95/2255 dead transitions.
[2023-10-25 14:58:18,251 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 2255 transitions, 37624 flow
[2023-10-25 14:58:18,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2023-10-25 14:58:18,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2023-10-25 14:58:18,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2344 transitions.
[2023-10-25 14:58:18,254 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37247735579215
[2023-10-25 14:58:18,254 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 2344 transitions.
[2023-10-25 14:58:18,254 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 2344 transitions.
[2023-10-25 14:58:18,254 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:58:18,269 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2344 transitions.
[2023-10-25 14:58:18,271 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 80.82758620689656) internal successors, (2344), 29 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:18,275 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 217.0) internal successors, (6510), 30 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:18,276 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 217.0) internal successors, (6510), 30 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:18,276 INFO  L175             Difference]: Start difference. First operand has 186 places, 1230 transitions, 19430 flow. Second operand 29 states and 2344 transitions.
[2023-10-25 14:58:18,276 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 2255 transitions, 37624 flow
[2023-10-25 14:58:24,990 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 2255 transitions, 36798 flow, removed 338 selfloop flow, removed 9 redundant places.
[2023-10-25 14:58:25,024 INFO  L231             Difference]: Finished difference. Result has 219 places, 1621 transitions, 27878 flow
[2023-10-25 14:58:25,025 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=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=27878, PETRI_PLACES=219, PETRI_TRANSITIONS=1621}
[2023-10-25 14:58:25,026 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 152 predicate places.
[2023-10-25 14:58:25,026 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 1621 transitions, 27878 flow
[2023-10-25 14:58:25,027 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-10-25 14:58:25,027 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:25,028 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-10-25 14:58:25,034 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-25 14:58:25,232 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-10-25 14:58:25,233 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-10-25 14:58:25,236 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:25,236 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108278345, now seen corresponding path program 1 times
[2023-10-25 14:58:25,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:25,236 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748065485]
[2023-10-25 14:58:25,237 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:25,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:25,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 14:58:25,302 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 14:58:25,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 14:58:25,332 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 14:58:25,332 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 14:58:25,332 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-10-25 14:58:25,332 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-10-25 14:58:25,333 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-10-25 14:58:25,333 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-10-25 14:58:25,333 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-10-25 14:58:25,333 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-10-25 14:58:25,333 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-10-25 14:58:25,333 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2023-10-25 14:58:25,333 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-10-25 14:58:25,333 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-10-25 14:58:25,334 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-10-25 14:58:25,334 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-10-25 14:58:25,334 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-10-25 14:58:25,334 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-25 14:58:25,334 INFO  L445         BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:58:25,335 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 14:58:25,335 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-25 14:58:25,365 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-25 14:58:25,367 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 155 transitions, 340 flow
[2023-10-25 14:58:25,425 INFO  L130       PetriNetUnfolder]: 21/500 cut-off events.
[2023-10-25 14:58:25,428 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-25 14:58:25,429 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-10-25 14:58:25,429 INFO  L82        GeneralOperation]: Start removeDead. Operand has 156 places, 155 transitions, 340 flow
[2023-10-25 14:58:25,433 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 156 places, 155 transitions, 340 flow
[2023-10-25 14:58:25,434 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 14:58:25,449 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 155 transitions, 340 flow
[2023-10-25 14:58:25,449 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 155 transitions, 340 flow
[2023-10-25 14:58:25,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 155 transitions, 340 flow
[2023-10-25 14:58:25,504 INFO  L130       PetriNetUnfolder]: 21/500 cut-off events.
[2023-10-25 14:58:25,504 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-25 14:58:25,505 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-10-25 14:58:25,512 INFO  L119        LiptonReduction]: Number of co-enabled transitions 8964
[2023-10-25 14:58:28,750 INFO  L134        LiptonReduction]: Checked pairs total: 51687
[2023-10-25 14:58:28,750 INFO  L136        LiptonReduction]: Total number of compositions: 90
[2023-10-25 14:58:28,751 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 14:58:28,751 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;@748721b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 14:58:28,751 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-10-25 14:58:28,751 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-25 14:58:28,752 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 14:58:28,752 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:28,752 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-25 14:58:28,752 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-10-25 14:58:28,752 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:28,752 INFO  L85        PathProgramCache]: Analyzing trace with hash 881, now seen corresponding path program 1 times
[2023-10-25 14:58:28,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:28,752 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650669612]
[2023-10-25 14:58:28,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:28,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:28,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:28,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:58:28,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:58:28,755 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650669612]
[2023-10-25 14:58:28,755 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650669612] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:58:28,755 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:58:28,755 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-25 14:58:28,755 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807003446]
[2023-10-25 14:58:28,755 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:58:28,755 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 14:58:28,755 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:58:28,756 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 14:58:28,756 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 14:58:28,756 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 245
[2023-10-25 14:58:28,756 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-10-25 14:58:28,756 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:58:28,756 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 245
[2023-10-25 14:58:28,756 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:58:29,688 INFO  L130       PetriNetUnfolder]: 3680/8504 cut-off events.
[2023-10-25 14:58:29,689 INFO  L131       PetriNetUnfolder]: For 651/1631 co-relation queries the response was YES.
[2023-10-25 14:58:29,696 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-10-25 14:58:29,721 INFO  L137   encePairwiseOnDemand]: 244/245 looper letters, 28 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2023-10-25 14:58:29,721 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 236 flow
[2023-10-25 14:58:29,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 14:58:29,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 14:58:29,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions.
[2023-10-25 14:58:29,722 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6551020408163265
[2023-10-25 14:58:29,722 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 321 transitions.
[2023-10-25 14:58:29,722 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 321 transitions.
[2023-10-25 14:58:29,723 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:58:29,723 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 321 transitions.
[2023-10-25 14:58:29,723 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-10-25 14:58:29,724 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-10-25 14:58:29,724 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-10-25 14:58:29,724 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 321 transitions.
[2023-10-25 14:58:29,724 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 236 flow
[2023-10-25 14:58:29,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:58:29,741 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2023-10-25 14:58:29,741 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-10-25 14:58:29,742 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2023-10-25 14:58:29,742 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2023-10-25 14:58:29,742 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-10-25 14:58:29,742 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:29,742 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:58:29,742 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-10-25 14:58:29,743 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-10-25 14:58:29,743 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:29,744 INFO  L85        PathProgramCache]: Analyzing trace with hash 847683071, now seen corresponding path program 1 times
[2023-10-25 14:58:29,744 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:29,744 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600747710]
[2023-10-25 14:58:29,744 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:29,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:29,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:29,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:58:29,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:58:29,918 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600747710]
[2023-10-25 14:58:29,918 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600747710] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:58:29,918 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:58:29,918 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:58:29,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668189859]
[2023-10-25 14:58:29,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:58:29,919 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:58:29,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:58:29,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:58:29,919 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:58:30,183 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245
[2023-10-25 14:58:30,183 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-10-25 14:58:30,183 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:58:30,183 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245
[2023-10-25 14:58:30,184 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:58:38,751 INFO  L130       PetriNetUnfolder]: 75663/120904 cut-off events.
[2023-10-25 14:58:38,752 INFO  L131       PetriNetUnfolder]: For 3763/4244 co-relation queries the response was YES.
[2023-10-25 14:58:38,916 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-10-25 14:58:39,398 INFO  L137   encePairwiseOnDemand]: 214/245 looper letters, 111 selfloop transitions, 64 changer transitions 0/196 dead transitions.
[2023-10-25 14:58:39,398 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 196 transitions, 793 flow
[2023-10-25 14:58:39,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:58:39,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:58:39,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions.
[2023-10-25 14:58:39,399 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.582312925170068
[2023-10-25 14:58:39,400 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 856 transitions.
[2023-10-25 14:58:39,400 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 856 transitions.
[2023-10-25 14:58:39,400 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:58:39,400 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 856 transitions.
[2023-10-25 14:58:39,401 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-10-25 14:58:39,402 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-10-25 14:58:39,402 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-10-25 14:58:39,402 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 856 transitions.
[2023-10-25 14:58:39,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 196 transitions, 793 flow
[2023-10-25 14:58:39,407 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 196 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:58:39,408 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2023-10-25 14:58:39,408 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-10-25 14:58:39,409 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2023-10-25 14:58:39,409 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2023-10-25 14:58:39,409 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-10-25 14:58:39,409 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:39,409 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:58:39,409 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-10-25 14:58:39,410 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-10-25 14:58:39,410 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:39,410 INFO  L85        PathProgramCache]: Analyzing trace with hash -309025520, now seen corresponding path program 1 times
[2023-10-25 14:58:39,410 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:39,410 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399601022]
[2023-10-25 14:58:39,410 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:39,410 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:39,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:39,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:58:39,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:58:39,453 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399601022]
[2023-10-25 14:58:39,457 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399601022] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:58:39,457 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:58:39,458 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 14:58:39,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140962102]
[2023-10-25 14:58:39,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:58:39,458 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 14:58:39,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:58:39,458 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 14:58:39,459 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 14:58:39,482 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 245
[2023-10-25 14:58:39,482 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-10-25 14:58:39,482 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:58:39,482 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 245
[2023-10-25 14:58:39,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:58:43,074 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-10-25 14:58:43,075 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-25 14:58:43,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-25 14:58:43,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-25 14:58:43,075 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-25 14:58:43,075 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-10-25 14:58:43,076 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-25 14:58:43,076 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-25 14:58:43,076 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-25 14:58:43,076 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-25 14:58:43,415 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-10-25 14:58:43,415 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,415 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,415 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,415 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,416 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-10-25 14:58:43,416 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,416 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,416 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,416 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,417 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-10-25 14:58:43,417 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,417 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,417 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,417 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 14:58:43,829 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-10-25 14:58:43,830 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-10-25 14:58:43,830 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-25 14:58:43,830 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-25 14:58:43,830 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-25 14:58:43,830 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-10-25 14:58:43,830 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-10-25 14:58:43,831 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-25 14:58:43,831 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-25 14:58:43,831 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-25 14:58:45,868 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-10-25 14:58:45,868 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-10-25 14:58:45,868 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-25 14:58:45,868 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-25 14:58:45,868 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-25 14:58:45,869 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-10-25 14:58:45,869 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-10-25 14:58:45,869 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-25 14:58:45,869 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-25 14:58:45,869 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-25 14:58:46,034 INFO  L130       PetriNetUnfolder]: 36197/69251 cut-off events.
[2023-10-25 14:58:46,034 INFO  L131       PetriNetUnfolder]: For 38254/44798 co-relation queries the response was YES.
[2023-10-25 14:58:46,228 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-10-25 14:58:46,469 INFO  L137   encePairwiseOnDemand]: 237/245 looper letters, 50 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2023-10-25 14:58:46,469 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 764 flow
[2023-10-25 14:58:46,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 14:58:46,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 14:58:46,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions.
[2023-10-25 14:58:46,470 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6027210884353742
[2023-10-25 14:58:46,470 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 443 transitions.
[2023-10-25 14:58:46,470 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions.
[2023-10-25 14:58:46,470 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:58:46,471 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions.
[2023-10-25 14:58:46,471 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-10-25 14:58:46,472 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-10-25 14:58:46,472 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-10-25 14:58:46,472 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 443 transitions.
[2023-10-25 14:58:46,472 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 764 flow
[2023-10-25 14:58:47,159 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 764 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:58:47,161 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2023-10-25 14:58:47,161 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-10-25 14:58:47,163 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2023-10-25 14:58:47,163 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2023-10-25 14:58:47,177 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-10-25 14:58:47,177 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:47,177 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:58:47,178 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-10-25 14:58:47,178 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-10-25 14:58:47,178 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:47,178 INFO  L85        PathProgramCache]: Analyzing trace with hash 871548223, now seen corresponding path program 1 times
[2023-10-25 14:58:47,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:47,179 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216740085]
[2023-10-25 14:58:47,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:47,179 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:47,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:47,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:58:47,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:58:47,409 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216740085]
[2023-10-25 14:58:47,409 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216740085] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:58:47,410 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:58:47,410 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:58:47,410 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364611981]
[2023-10-25 14:58:47,410 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:58:47,411 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:58:47,411 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:58:47,411 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:58:47,411 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:58:47,796 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 245
[2023-10-25 14:58:47,797 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-10-25 14:58:47,797 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:58:47,797 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 245
[2023-10-25 14:58:47,797 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:59:01,694 INFO  L130       PetriNetUnfolder]: 78201/123586 cut-off events.
[2023-10-25 14:59:01,694 INFO  L131       PetriNetUnfolder]: For 93941/95137 co-relation queries the response was YES.
[2023-10-25 14:59:02,027 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-10-25 14:59:02,470 INFO  L137   encePairwiseOnDemand]: 226/245 looper letters, 148 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2023-10-25 14:59:02,470 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1807 flow
[2023-10-25 14:59:02,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:59:02,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:59:02,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 875 transitions.
[2023-10-25 14:59:02,472 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5952380952380952
[2023-10-25 14:59:02,472 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 875 transitions.
[2023-10-25 14:59:02,472 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 875 transitions.
[2023-10-25 14:59:02,472 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:59:02,472 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 875 transitions.
[2023-10-25 14:59:02,473 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-10-25 14:59:02,474 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-10-25 14:59:02,474 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-10-25 14:59:02,474 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 875 transitions.
[2023-10-25 14:59:02,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1807 flow
[2023-10-25 14:59:02,632 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1807 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:59:02,635 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2023-10-25 14:59:02,635 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-10-25 14:59:02,635 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2023-10-25 14:59:02,636 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2023-10-25 14:59:02,636 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-10-25 14:59:02,636 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:59:02,636 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:59:02,636 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-10-25 14:59:02,636 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-10-25 14:59:02,636 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:59:02,637 INFO  L85        PathProgramCache]: Analyzing trace with hash 1259099398, now seen corresponding path program 1 times
[2023-10-25 14:59:02,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:59:02,637 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78711738]
[2023-10-25 14:59:02,637 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:59:02,637 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:59:02,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:59:02,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:59:02,898 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:59:02,898 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78711738]
[2023-10-25 14:59:02,899 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78711738] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:59:02,899 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:59:02,899 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:59:02,899 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470940891]
[2023-10-25 14:59:02,899 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:59:02,899 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:59:02,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:59:02,900 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:59:02,900 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:59:03,070 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245
[2023-10-25 14:59:03,071 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-10-25 14:59:03,071 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:59:03,071 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245
[2023-10-25 14:59:03,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:59:34,191 INFO  L130       PetriNetUnfolder]: 165587/252270 cut-off events.
[2023-10-25 14:59:34,191 INFO  L131       PetriNetUnfolder]: For 287960/290697 co-relation queries the response was YES.
[2023-10-25 14:59:35,090 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-10-25 14:59:36,556 INFO  L137   encePairwiseOnDemand]: 215/245 looper letters, 334 selfloop transitions, 162 changer transitions 0/517 dead transitions.
[2023-10-25 14:59:36,556 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 517 transitions, 4078 flow
[2023-10-25 14:59:36,556 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:59:36,557 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:59:36,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions.
[2023-10-25 14:59:36,558 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6163265306122448
[2023-10-25 14:59:36,558 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 906 transitions.
[2023-10-25 14:59:36,558 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 906 transitions.
[2023-10-25 14:59:36,558 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:59:36,558 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 906 transitions.
[2023-10-25 14:59:36,566 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-10-25 14:59:36,567 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-10-25 14:59:36,589 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-10-25 14:59:36,589 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 906 transitions.
[2023-10-25 14:59:36,589 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 517 transitions, 4078 flow
[2023-10-25 14:59:38,595 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 517 transitions, 4078 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:59:38,600 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2023-10-25 14:59:38,600 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-10-25 14:59:38,600 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2023-10-25 14:59:38,600 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2023-10-25 14:59:38,601 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-10-25 14:59:38,601 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:59:38,604 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:59:38,604 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2023-10-25 14:59:38,604 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-10-25 14:59:38,604 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:59:38,604 INFO  L85        PathProgramCache]: Analyzing trace with hash -610559931, now seen corresponding path program 1 times
[2023-10-25 14:59:38,605 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:59:38,605 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330895561]
[2023-10-25 14:59:38,605 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:59:38,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:59:38,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:59:38,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 14:59:38,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:59:38,965 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330895561]
[2023-10-25 14:59:38,966 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330895561] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:59:38,966 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422121076]
[2023-10-25 14:59:38,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:59:38,966 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:59:38,966 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:59:38,975 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:59:39,027 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-25 14:59:39,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:59:39,198 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-10-25 14:59:39,202 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:59:39,277 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:59:39,313 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:59:39,314 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:59:39,357 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:59:39,358 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:59:39,359 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:59:39,404 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:59:39,405 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:59:39,406 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:59:39,407 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:59:39,486 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:59:39,487 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:59:39,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 14:59:39,531 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:59:39,566 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-10-25 14:59:39,702 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-10-25 14:59:39,749 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-10-25 14:59:39,765 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:59:39,766 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-10-25 14:59:39,772 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:59:39,772 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2023-10-25 14:59:39,777 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2023-10-25 14:59:39,781 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:59:39,781 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-10-25 14:59:39,786 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:59:39,787 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-25 14:59:39,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2023-10-25 14:59:39,819 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [422121076] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:59:39,819 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:59:39,819 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2023-10-25 14:59:39,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056871277]
[2023-10-25 14:59:39,820 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:59:39,820 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-10-25 14:59:39,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:59:39,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-10-25 14:59:39,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=131, Unknown=14, NotChecked=84, Total=306
[2023-10-25 14:59:40,057 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 245
[2023-10-25 14:59:40,058 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-10-25 14:59:40,058 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:59:40,058 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 245
[2023-10-25 14:59:40,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
