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


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f4d1033cc80461b2e37f8849427907937a08432fe41ab4a97273e1b98e1dc1f
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-26 08:51:16,461 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-26 08:51:16,467 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-26 08:51:16,526 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-26 08:51:16,537 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-26 08:51:16,539 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-26 08:51:16,540 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-26 08:51:16,556 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-26 08:51:16,558 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-26 08:51:16,563 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-26 08:51:16,565 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-26 08:51:16,566 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-26 08:51:16,566 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-26 08:51:16,568 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-26 08:51:16,570 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-26 08:51:16,571 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-26 08:51:16,573 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-26 08:51:16,574 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-26 08:51:16,575 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-26 08:51:16,596 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-26 08:51:16,598 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-26 08:51:16,600 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-26 08:51:16,602 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-26 08:51:16,603 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-26 08:51:16,608 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-26 08:51:16,608 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-26 08:51:16,608 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-26 08:51:16,610 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-26 08:51:16,611 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-26 08:51:16,612 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-26 08:51:16,612 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-26 08:51:16,613 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-26 08:51:16,615 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-26 08:51:16,615 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-26 08:51:16,616 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-26 08:51:16,616 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-26 08:51:16,617 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-26 08:51:16,633 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-26 08:51:16,634 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-26 08:51:16,635 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-26 08:51:16,636 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-26 08:51:16,637 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-26 08:51:16,679 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-26 08:51:16,679 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-26 08:51:16,680 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-26 08:51:16,680 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-26 08:51:16,681 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-26 08:51:16,681 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-26 08:51:16,681 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-26 08:51:16,682 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-26 08:51:16,682 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-26 08:51:16,682 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-26 08:51:16,683 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-26 08:51:16,683 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-26 08:51:16,683 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-26 08:51:16,683 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-26 08:51:16,684 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-26 08:51:16,684 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-26 08:51:16,684 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-26 08:51:16,684 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-26 08:51:16,684 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-26 08:51:16,684 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-26 08:51:16,684 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-26 08:51:16,685 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-26 08:51:16,685 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-26 08:51:16,685 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-26 08:51:16,685 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-26 08:51:16,685 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-26 08:51:16,685 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:51:16,686 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-26 08:51:16,686 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-26 08:51:16,686 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-26 08:51:16,686 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-26 08:51:16,686 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-26 08:51:16,687 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-26 08:51:16,688 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-26 08:51:16,688 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-26 08:51:16,688 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-26 08:51:16,688 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-26 08:51:16,688 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 -> 3f4d1033cc80461b2e37f8849427907937a08432fe41ab4a97273e1b98e1dc1f
[2023-10-26 08:51:17,093 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 08:51:17,117 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 08:51:17,119 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 08:51:17,120 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 08:51:17,120 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 08:51:17,121 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2023-10-26 08:51:19,023 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 08:51:19,566 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 08:51:19,581 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2023-10-26 08:51:19,599 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/85c2b1845/59fd5e654e2b453abbffa0753eab1fa6/FLAGc71da2e92
[2023-10-26 08:51:19,628 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/85c2b1845/59fd5e654e2b453abbffa0753eab1fa6
[2023-10-26 08:51:19,645 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 08:51:19,646 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 08:51:19,647 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 08:51:19,647 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 08:51:19,650 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 08:51:19,651 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:51:19" (1/1) ...
[2023-10-26 08:51:19,652 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7988d2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:19, skipping insertion in model container
[2023-10-26 08:51:19,652 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:51:19" (1/1) ...
[2023-10-26 08:51:19,658 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 08:51:19,735 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 08:51:20,031 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:51:20,344 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:51:20,361 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 08:51:20,392 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:51:20,431 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:51:20,514 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 08:51:20,515 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20 WrapperNode
[2023-10-26 08:51:20,515 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 08:51:20,516 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 08:51:20,521 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 08:51:20,522 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 08:51:20,533 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,548 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,604 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78
[2023-10-26 08:51:20,605 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 08:51:20,605 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 08:51:20,606 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 08:51:20,606 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 08:51:20,616 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,616 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,635 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,636 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,643 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,660 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,662 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,664 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,666 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 08:51:20,679 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 08:51:20,679 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 08:51:20,679 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 08:51:20,680 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (1/1) ...
[2023-10-26 08:51:20,686 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:51:20,719 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:20,738 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-26 08:51:20,765 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-26 08:51:20,776 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-26 08:51:20,776 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-26 08:51:20,776 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 08:51:20,778 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-26 08:51:20,778 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-26 08:51:20,793 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-26 08:51:20,793 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-26 08:51:20,793 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 08:51:20,794 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 08:51:20,794 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 08:51:20,794 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 08:51:20,795 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-26 08:51:21,036 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 08:51:21,051 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 08:51:21,505 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 08:51:21,510 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 08:51:21,523 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 08:51:21,526 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:51:21 BoogieIcfgContainer
[2023-10-26 08:51:21,526 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 08:51:21,529 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 08:51:21,529 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 08:51:21,532 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 08:51:21,532 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:51:19" (1/3) ...
[2023-10-26 08:51:21,533 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7257eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:51:21, skipping insertion in model container
[2023-10-26 08:51:21,534 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:51:20" (2/3) ...
[2023-10-26 08:51:21,535 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7257eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:51:21, skipping insertion in model container
[2023-10-26 08:51:21,542 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:51:21" (3/3) ...
[2023-10-26 08:51:21,543 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i
[2023-10-26 08:51:21,550 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 08:51:21,564 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 08:51:21,564 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2023-10-26 08:51:21,564 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 08:51:21,686 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-26 08:51:21,757 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2023-10-26 08:51:21,882 INFO  L130       PetriNetUnfolder]: 6/150 cut-off events.
[2023-10-26 08:51:21,897 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:51:21,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156 conditions, 150 events. 6/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 288 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2023-10-26 08:51:21,903 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 214 flow
[2023-10-26 08:51:21,931 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 214 flow
[2023-10-26 08:51:21,935 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:51:21,952 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 103 transitions, 214 flow
[2023-10-26 08:51:21,954 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 103 transitions, 214 flow
[2023-10-26 08:51:21,960 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2023-10-26 08:51:22,041 INFO  L130       PetriNetUnfolder]: 6/150 cut-off events.
[2023-10-26 08:51:22,057 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:51:22,058 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156 conditions, 150 events. 6/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 288 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2023-10-26 08:51:22,060 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1620
[2023-10-26 08:51:25,425 INFO  L134        LiptonReduction]: Checked pairs total: 7490
[2023-10-26 08:51:25,426 INFO  L136        LiptonReduction]: Total number of compositions: 68
[2023-10-26 08:51:25,447 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:51:25,454 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;@28e037c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:51:25,454 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-10-26 08:51:25,475 INFO  L130       PetriNetUnfolder]: 0/17 cut-off events.
[2023-10-26 08:51:25,476 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:51:25,477 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:25,477 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:25,478 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:51:25,482 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:25,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 201821214, now seen corresponding path program 1 times
[2023-10-26 08:51:25,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:25,506 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645046368]
[2023-10-26 08:51:25,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:25,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:25,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:26,492 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-26 08:51:26,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:26,493 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645046368]
[2023-10-26 08:51:26,494 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645046368] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:26,494 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:26,494 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:26,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831841090]
[2023-10-26 08:51:26,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:26,518 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:26,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:26,548 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:26,562 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:26,887 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 171
[2023-10-26 08:51:26,891 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 flow. Second operand  has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 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-26 08:51:26,892 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:26,892 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 171
[2023-10-26 08:51:26,892 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:27,168 INFO  L130       PetriNetUnfolder]: 181/536 cut-off events.
[2023-10-26 08:51:27,168 INFO  L131       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2023-10-26 08:51:27,172 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 994 conditions, 536 events. 181/536 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2880 event pairs, 42 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 895. Up to 266 conditions per place. 
[2023-10-26 08:51:27,177 INFO  L137   encePairwiseOnDemand]: 149/171 looper letters, 54 selfloop transitions, 28 changer transitions 0/92 dead transitions.
[2023-10-26 08:51:27,178 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 92 transitions, 359 flow
[2023-10-26 08:51:27,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:27,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:27,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions.
[2023-10-26 08:51:27,215 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5097465886939572
[2023-10-26 08:51:27,216 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 523 transitions.
[2023-10-26 08:51:27,217 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 523 transitions.
[2023-10-26 08:51:27,233 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:27,235 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 523 transitions.
[2023-10-26 08:51:27,241 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:27,250 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 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-26 08:51:27,266 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 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-26 08:51:27,268 INFO  L175             Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 6 states and 523 transitions.
[2023-10-26 08:51:27,269 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 92 transitions, 359 flow
[2023-10-26 08:51:27,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 359 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:27,277 INFO  L231             Difference]: Finished difference. Result has 55 places, 71 transitions, 306 flow
[2023-10-26 08:51:27,278 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=55, PETRI_TRANSITIONS=71}
[2023-10-26 08:51:27,285 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places.
[2023-10-26 08:51:27,285 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 71 transitions, 306 flow
[2023-10-26 08:51:27,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 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-26 08:51:27,292 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:27,293 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:27,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-26 08:51:27,294 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:51:27,295 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:27,295 INFO  L85        PathProgramCache]: Analyzing trace with hash 1161189494, now seen corresponding path program 1 times
[2023-10-26 08:51:27,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:27,298 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669595519]
[2023-10-26 08:51:27,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:27,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:27,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:27,753 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-26 08:51:27,753 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:27,754 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669595519]
[2023-10-26 08:51:27,754 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669595519] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:27,754 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:27,758 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:27,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571888511]
[2023-10-26 08:51:27,759 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:27,760 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:27,760 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:27,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:27,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:28,102 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 171
[2023-10-26 08:51:28,103 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 71 transitions, 306 flow. Second operand  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 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-26 08:51:28,104 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:28,104 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 171
[2023-10-26 08:51:28,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:28,421 INFO  L130       PetriNetUnfolder]: 182/544 cut-off events.
[2023-10-26 08:51:28,421 INFO  L131       PetriNetUnfolder]: For 242/250 co-relation queries the response was YES.
[2023-10-26 08:51:28,423 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 544 events. 182/544 cut-off events. For 242/250 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2871 event pairs, 36 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 1263. Up to 276 conditions per place. 
[2023-10-26 08:51:28,425 INFO  L137   encePairwiseOnDemand]: 160/171 looper letters, 37 selfloop transitions, 33 changer transitions 8/113 dead transitions.
[2023-10-26 08:51:28,425 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 113 transitions, 637 flow
[2023-10-26 08:51:28,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:28,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:28,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 551 transitions.
[2023-10-26 08:51:28,427 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5370370370370371
[2023-10-26 08:51:28,427 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 551 transitions.
[2023-10-26 08:51:28,428 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 551 transitions.
[2023-10-26 08:51:28,428 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:28,428 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 551 transitions.
[2023-10-26 08:51:28,430 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 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-26 08:51:28,431 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 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-26 08:51:28,446 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 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-26 08:51:28,446 INFO  L175             Difference]: Start difference. First operand has 55 places, 71 transitions, 306 flow. Second operand 6 states and 551 transitions.
[2023-10-26 08:51:28,446 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 113 transitions, 637 flow
[2023-10-26 08:51:28,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 637 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:28,455 INFO  L231             Difference]: Finished difference. Result has 65 places, 101 transitions, 607 flow
[2023-10-26 08:51:28,455 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=607, PETRI_PLACES=65, PETRI_TRANSITIONS=101}
[2023-10-26 08:51:28,456 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places.
[2023-10-26 08:51:28,456 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 101 transitions, 607 flow
[2023-10-26 08:51:28,457 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 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-26 08:51:28,457 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:28,457 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:28,457 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-26 08:51:28,457 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:51:28,458 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:28,458 INFO  L85        PathProgramCache]: Analyzing trace with hash 930028087, now seen corresponding path program 1 times
[2023-10-26 08:51:28,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:28,459 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945673195]
[2023-10-26 08:51:28,459 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:28,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:28,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:28,899 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-26 08:51:28,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:28,900 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945673195]
[2023-10-26 08:51:28,900 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945673195] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:28,901 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:28,901 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:28,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759395955]
[2023-10-26 08:51:28,901 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:28,902 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:28,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:28,902 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:28,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:29,039 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 171
[2023-10-26 08:51:29,040 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 101 transitions, 607 flow. Second operand  has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:29,040 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:29,040 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 171
[2023-10-26 08:51:29,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:29,500 INFO  L130       PetriNetUnfolder]: 316/822 cut-off events.
[2023-10-26 08:51:29,500 INFO  L131       PetriNetUnfolder]: For 635/643 co-relation queries the response was YES.
[2023-10-26 08:51:29,502 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 822 events. 316/822 cut-off events. For 635/643 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4777 event pairs, 49 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 2572. Up to 579 conditions per place. 
[2023-10-26 08:51:29,520 INFO  L137   encePairwiseOnDemand]: 149/171 looper letters, 100 selfloop transitions, 76 changer transitions 10/199 dead transitions.
[2023-10-26 08:51:29,521 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 199 transitions, 1391 flow
[2023-10-26 08:51:29,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:29,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:29,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions.
[2023-10-26 08:51:29,523 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5477582846003899
[2023-10-26 08:51:29,523 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 562 transitions.
[2023-10-26 08:51:29,523 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions.
[2023-10-26 08:51:29,523 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:29,523 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions.
[2023-10-26 08:51:29,525 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 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-26 08:51:29,526 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 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-26 08:51:29,527 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 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-26 08:51:29,527 INFO  L175             Difference]: Start difference. First operand has 65 places, 101 transitions, 607 flow. Second operand 6 states and 562 transitions.
[2023-10-26 08:51:29,527 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 199 transitions, 1391 flow
[2023-10-26 08:51:29,533 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 199 transitions, 1391 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:29,550 INFO  L231             Difference]: Finished difference. Result has 73 places, 169 transitions, 1207 flow
[2023-10-26 08:51:29,551 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1207, PETRI_PLACES=73, PETRI_TRANSITIONS=169}
[2023-10-26 08:51:29,552 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places.
[2023-10-26 08:51:29,553 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 169 transitions, 1207 flow
[2023-10-26 08:51:29,553 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:29,553 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:29,553 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-26 08:51:29,554 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-26 08:51:29,557 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:51:29,557 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:29,557 INFO  L85        PathProgramCache]: Analyzing trace with hash -1797388716, now seen corresponding path program 1 times
[2023-10-26 08:51:29,557 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:29,558 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255558773]
[2023-10-26 08:51:29,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:29,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:29,614 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:51:29,615 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:51:29,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:51:29,682 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:51:29,683 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:51:29,684 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-10-26 08:51:29,686 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-10-26 08:51:29,700 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-10-26 08:51:29,700 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-10-26 08:51:29,701 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-10-26 08:51:29,701 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-10-26 08:51:29,701 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-10-26 08:51:29,701 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-26 08:51:29,702 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-10-26 08:51:29,706 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:51:29,706 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-26 08:51:29,736 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-26 08:51:29,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 120 transitions, 258 flow
[2023-10-26 08:51:29,800 INFO  L130       PetriNetUnfolder]: 11/265 cut-off events.
[2023-10-26 08:51:29,802 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:51:29,805 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 279 conditions, 265 events. 11/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 612 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. 
[2023-10-26 08:51:29,805 INFO  L82        GeneralOperation]: Start removeDead. Operand has 120 places, 120 transitions, 258 flow
[2023-10-26 08:51:29,806 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 120 places, 120 transitions, 258 flow
[2023-10-26 08:51:29,806 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:51:29,806 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 120 transitions, 258 flow
[2023-10-26 08:51:29,807 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 120 transitions, 258 flow
[2023-10-26 08:51:29,807 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 120 transitions, 258 flow
[2023-10-26 08:51:29,855 INFO  L130       PetriNetUnfolder]: 11/265 cut-off events.
[2023-10-26 08:51:29,856 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:51:29,857 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 279 conditions, 265 events. 11/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 612 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. 
[2023-10-26 08:51:29,860 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4080
[2023-10-26 08:51:32,725 INFO  L134        LiptonReduction]: Checked pairs total: 17583
[2023-10-26 08:51:32,725 INFO  L136        LiptonReduction]: Total number of compositions: 71
[2023-10-26 08:51:32,727 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:51:32,728 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;@28e037c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:51:32,728 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-26 08:51:32,731 INFO  L130       PetriNetUnfolder]: 0/17 cut-off events.
[2023-10-26 08:51:32,732 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:51:32,732 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:32,732 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:32,732 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:32,732 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:32,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 2072815190, now seen corresponding path program 1 times
[2023-10-26 08:51:32,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:32,733 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176154713]
[2023-10-26 08:51:32,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:32,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:32,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:32,977 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-26 08:51:32,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:32,978 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176154713]
[2023-10-26 08:51:32,978 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176154713] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:32,978 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:32,978 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:32,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281844634]
[2023-10-26 08:51:32,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:32,979 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:32,979 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:32,979 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:32,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:33,276 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191
[2023-10-26 08:51:33,276 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 126 flow. Second operand  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-26 08:51:33,277 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:33,277 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191
[2023-10-26 08:51:33,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:34,501 INFO  L130       PetriNetUnfolder]: 3686/6983 cut-off events.
[2023-10-26 08:51:34,517 INFO  L131       PetriNetUnfolder]: For 206/241 co-relation queries the response was YES.
[2023-10-26 08:51:34,524 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13338 conditions, 6983 events. 3686/6983 cut-off events. For 206/241 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 47182 event pairs, 884 based on Foata normal form. 12/6617 useless extension candidates. Maximal degree in co-relation 6457. Up to 4233 conditions per place. 
[2023-10-26 08:51:34,581 INFO  L137   encePairwiseOnDemand]: 165/191 looper letters, 75 selfloop transitions, 47 changer transitions 0/135 dead transitions.
[2023-10-26 08:51:34,581 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 135 transitions, 543 flow
[2023-10-26 08:51:34,581 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:34,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:34,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions.
[2023-10-26 08:51:34,592 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5488656195462478
[2023-10-26 08:51:34,592 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 629 transitions.
[2023-10-26 08:51:34,592 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions.
[2023-10-26 08:51:34,593 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:34,593 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions.
[2023-10-26 08:51:34,594 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 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-26 08:51:34,596 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:34,597 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:34,597 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 629 transitions.
[2023-10-26 08:51:34,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 135 transitions, 543 flow
[2023-10-26 08:51:34,598 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 135 transitions, 543 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:34,600 INFO  L231             Difference]: Finished difference. Result has 67 places, 101 transitions, 460 flow
[2023-10-26 08:51:34,605 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=67, PETRI_TRANSITIONS=101}
[2023-10-26 08:51:34,607 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places.
[2023-10-26 08:51:34,607 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 460 flow
[2023-10-26 08:51:34,608 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 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-26 08:51:34,608 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:34,608 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:34,621 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-26 08:51:34,621 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:34,621 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:34,622 INFO  L85        PathProgramCache]: Analyzing trace with hash -1179066042, now seen corresponding path program 1 times
[2023-10-26 08:51:34,622 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:34,622 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111073442]
[2023-10-26 08:51:34,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:34,622 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:34,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:34,941 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-26 08:51:34,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:34,941 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111073442]
[2023-10-26 08:51:34,942 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111073442] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:34,942 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:34,942 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:34,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59906668]
[2023-10-26 08:51:34,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:34,945 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:34,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:34,961 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:34,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:35,273 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 191
[2023-10-26 08:51:35,274 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 460 flow. Second operand  has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 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-26 08:51:35,275 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:35,275 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 191
[2023-10-26 08:51:35,275 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:36,684 INFO  L130       PetriNetUnfolder]: 3875/7372 cut-off events.
[2023-10-26 08:51:36,684 INFO  L131       PetriNetUnfolder]: For 4552/4677 co-relation queries the response was YES.
[2023-10-26 08:51:36,694 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19732 conditions, 7372 events. 3875/7372 cut-off events. For 4552/4677 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 50211 event pairs, 1160 based on Foata normal form. 0/6970 useless extension candidates. Maximal degree in co-relation 10705. Up to 4740 conditions per place. 
[2023-10-26 08:51:36,768 INFO  L137   encePairwiseOnDemand]: 176/191 looper letters, 81 selfloop transitions, 70 changer transitions 0/188 dead transitions.
[2023-10-26 08:51:36,768 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 188 transitions, 1134 flow
[2023-10-26 08:51:36,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:36,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:36,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2023-10-26 08:51:36,770 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5680628272251309
[2023-10-26 08:51:36,770 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2023-10-26 08:51:36,770 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2023-10-26 08:51:36,771 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:36,771 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2023-10-26 08:51:36,772 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:36,774 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:36,774 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:36,774 INFO  L175             Difference]: Start difference. First operand has 67 places, 101 transitions, 460 flow. Second operand 6 states and 651 transitions.
[2023-10-26 08:51:36,775 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 188 transitions, 1134 flow
[2023-10-26 08:51:36,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 188 transitions, 1134 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:36,816 INFO  L231             Difference]: Finished difference. Result has 77 places, 170 transitions, 1114 flow
[2023-10-26 08:51:36,816 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1114, PETRI_PLACES=77, PETRI_TRANSITIONS=170}
[2023-10-26 08:51:36,819 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2023-10-26 08:51:36,820 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 170 transitions, 1114 flow
[2023-10-26 08:51:36,820 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 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-26 08:51:36,820 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:36,820 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:36,820 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-26 08:51:36,820 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:36,821 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:36,821 INFO  L85        PathProgramCache]: Analyzing trace with hash 1166645746, now seen corresponding path program 1 times
[2023-10-26 08:51:36,821 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:36,821 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369892190]
[2023-10-26 08:51:36,821 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:36,822 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:36,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:37,163 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-26 08:51:37,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:37,164 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369892190]
[2023-10-26 08:51:37,166 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369892190] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:37,166 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:37,166 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:37,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998378328]
[2023-10-26 08:51:37,167 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:37,167 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:37,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:37,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:37,168 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:37,328 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191
[2023-10-26 08:51:37,329 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 170 transitions, 1114 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-26 08:51:37,329 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:37,329 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191
[2023-10-26 08:51:37,329 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:39,783 INFO  L130       PetriNetUnfolder]: 6828/12078 cut-off events.
[2023-10-26 08:51:39,784 INFO  L131       PetriNetUnfolder]: For 11482/11566 co-relation queries the response was YES.
[2023-10-26 08:51:39,818 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40089 conditions, 12078 events. 6828/12078 cut-off events. For 11482/11566 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 82831 event pairs, 1685 based on Foata normal form. 0/11341 useless extension candidates. Maximal degree in co-relation 33299. Up to 9361 conditions per place. 
[2023-10-26 08:51:39,925 INFO  L137   encePairwiseOnDemand]: 165/191 looper letters, 184 selfloop transitions, 147 changer transitions 0/348 dead transitions.
[2023-10-26 08:51:39,925 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 348 transitions, 2660 flow
[2023-10-26 08:51:39,926 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:39,926 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:39,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions.
[2023-10-26 08:51:39,928 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5881326352530541
[2023-10-26 08:51:39,928 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 674 transitions.
[2023-10-26 08:51:39,928 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions.
[2023-10-26 08:51:39,928 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:39,929 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions.
[2023-10-26 08:51:39,930 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:39,931 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:39,932 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:39,932 INFO  L175             Difference]: Start difference. First operand has 77 places, 170 transitions, 1114 flow. Second operand 6 states and 674 transitions.
[2023-10-26 08:51:39,932 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 348 transitions, 2660 flow
[2023-10-26 08:51:39,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 348 transitions, 2660 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:39,997 INFO  L231             Difference]: Finished difference. Result has 86 places, 304 transitions, 2404 flow
[2023-10-26 08:51:39,998 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2404, PETRI_PLACES=86, PETRI_TRANSITIONS=304}
[2023-10-26 08:51:39,999 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places.
[2023-10-26 08:51:39,999 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 304 transitions, 2404 flow
[2023-10-26 08:51:39,999 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-26 08:51:39,999 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:40,000 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:40,000 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-26 08:51:40,001 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:40,001 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:40,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 1453756839, now seen corresponding path program 1 times
[2023-10-26 08:51:40,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:40,004 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506636683]
[2023-10-26 08:51:40,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:40,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:40,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:40,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:40,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:40,491 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506636683]
[2023-10-26 08:51:40,491 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506636683] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:40,492 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727324781]
[2023-10-26 08:51:40,492 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:40,492 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:40,505 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:40,521 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-26 08:51:40,559 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-26 08:51:40,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:40,706 INFO  L263         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core
[2023-10-26 08:51:40,718 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:40,889 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-26 08:51:40,948 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:51:40,985 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:40,985 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:51:41,058 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:41,059 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:51:41,120 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:41,121 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-26 08:51:41,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:41,135 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:41,195 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-10-26 08:51:41,222 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-26 08:51:41,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:51:41,360 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727324781] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:41,373 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:41,373 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20
[2023-10-26 08:51:41,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270191325]
[2023-10-26 08:51:41,374 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:41,374 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2023-10-26 08:51:41,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:41,375 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2023-10-26 08:51:41,375 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=301, Unknown=2, NotChecked=74, Total=462
[2023-10-26 08:51:41,407 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 191
[2023-10-26 08:51:41,409 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 304 transitions, 2404 flow. Second operand  has 22 states, 22 states have (on average 62.27272727272727) internal successors, (1370), 22 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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-26 08:51:41,425 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:41,425 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 191
[2023-10-26 08:51:41,425 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:46,549 INFO  L130       PetriNetUnfolder]: 11359/18832 cut-off events.
[2023-10-26 08:51:46,550 INFO  L131       PetriNetUnfolder]: For 32133/32135 co-relation queries the response was YES.
[2023-10-26 08:51:46,593 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75968 conditions, 18832 events. 11359/18832 cut-off events. For 32133/32135 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 128390 event pairs, 1116 based on Foata normal form. 2/17121 useless extension candidates. Maximal degree in co-relation 66241. Up to 10934 conditions per place. 
[2023-10-26 08:51:46,730 INFO  L137   encePairwiseOnDemand]: 142/191 looper letters, 523 selfloop transitions, 331 changer transitions 19/878 dead transitions.
[2023-10-26 08:51:46,730 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 878 transitions, 7634 flow
[2023-10-26 08:51:46,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-10-26 08:51:46,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-10-26 08:51:46,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1166 transitions.
[2023-10-26 08:51:46,752 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4695932339911397
[2023-10-26 08:51:46,752 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1166 transitions.
[2023-10-26 08:51:46,752 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1166 transitions.
[2023-10-26 08:51:46,753 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:46,753 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1166 transitions.
[2023-10-26 08:51:46,755 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 89.6923076923077) internal successors, (1166), 13 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:46,758 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 191.0) internal successors, (2674), 14 states have internal predecessors, (2674), 0 states have call successors, (0), 0 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-26 08:51:46,765 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 191.0) internal successors, (2674), 14 states have internal predecessors, (2674), 0 states have call successors, (0), 0 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-26 08:51:46,765 INFO  L175             Difference]: Start difference. First operand has 86 places, 304 transitions, 2404 flow. Second operand 13 states and 1166 transitions.
[2023-10-26 08:51:46,765 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 878 transitions, 7634 flow
[2023-10-26 08:51:47,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 878 transitions, 7490 flow, removed 72 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:47,496 INFO  L231             Difference]: Finished difference. Result has 108 places, 587 transitions, 5820 flow
[2023-10-26 08:51:47,496 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5820, PETRI_PLACES=108, PETRI_TRANSITIONS=587}
[2023-10-26 08:51:47,497 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 51 predicate places.
[2023-10-26 08:51:47,498 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 587 transitions, 5820 flow
[2023-10-26 08:51:47,498 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 62.27272727272727) internal successors, (1370), 22 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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-26 08:51:47,498 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:47,498 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:47,506 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-26 08:51:47,703 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:47,704 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:47,704 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:47,705 INFO  L85        PathProgramCache]: Analyzing trace with hash -968981031, now seen corresponding path program 1 times
[2023-10-26 08:51:47,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:47,707 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595809485]
[2023-10-26 08:51:47,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:47,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:47,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:48,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:48,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:48,229 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595809485]
[2023-10-26 08:51:48,229 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595809485] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:48,229 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104063084]
[2023-10-26 08:51:48,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:48,229 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:48,230 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:48,230 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-26 08:51:48,269 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-26 08:51:48,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:48,377 INFO  L263         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core
[2023-10-26 08:51:48,380 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:48,478 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-26 08:51:48,520 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:48,521 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-26 08:51:48,564 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:48,565 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:48,566 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-26 08:51:48,631 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:48,632 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:48,633 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:48,634 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-26 08:51:48,747 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:51:48,749 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-26 08:51:48,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:48,796 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:49,005 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= 0 (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35) (forall ((v_ArrVal_369 (Array Int Int))) (= 0 (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35)))) is different from false
[2023-10-26 08:51:49,091 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35)))))) is different from false
[2023-10-26 08:51:49,149 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_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_35 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_35) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_35 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))))) is different from false
[2023-10-26 08:51:49,468 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:49,468 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-10-26 08:51:49,477 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:49,477 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-10-26 08:51:49,481 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-10-26 08:51:49,542 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-26 08:51:49,542 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104063084] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:49,542 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:49,542 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23
[2023-10-26 08:51:49,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87170623]
[2023-10-26 08:51:49,543 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:49,543 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2023-10-26 08:51:49,543 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:49,544 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-10-26 08:51:49,544 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=334, Unknown=34, NotChecked=126, Total=600
[2023-10-26 08:51:49,925 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 191
[2023-10-26 08:51:49,926 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 587 transitions, 5820 flow. Second operand  has 25 states, 25 states have (on average 66.0) internal successors, (1650), 25 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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-26 08:51:49,926 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:49,926 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 191
[2023-10-26 08:51:49,926 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:57,609 INFO  L130       PetriNetUnfolder]: 11892/19961 cut-off events.
[2023-10-26 08:51:57,610 INFO  L131       PetriNetUnfolder]: For 79130/79169 co-relation queries the response was YES.
[2023-10-26 08:51:57,654 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110611 conditions, 19961 events. 11892/19961 cut-off events. For 79130/79169 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 138395 event pairs, 970 based on Foata normal form. 75/18790 useless extension candidates. Maximal degree in co-relation 103696. Up to 12372 conditions per place. 
[2023-10-26 08:51:57,846 INFO  L137   encePairwiseOnDemand]: 161/191 looper letters, 624 selfloop transitions, 378 changer transitions 12/1023 dead transitions.
[2023-10-26 08:51:57,846 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 1023 transitions, 11617 flow
[2023-10-26 08:51:57,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-26 08:51:57,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-26 08:51:57,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 979 transitions.
[2023-10-26 08:51:57,852 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46596858638743455
[2023-10-26 08:51:57,852 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 979 transitions.
[2023-10-26 08:51:57,853 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 979 transitions.
[2023-10-26 08:51:57,854 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:57,854 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 979 transitions.
[2023-10-26 08:51:57,857 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 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-26 08:51:57,866 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 191.0) internal successors, (2292), 12 states have internal predecessors, (2292), 0 states have call successors, (0), 0 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-26 08:51:57,867 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 191.0) internal successors, (2292), 12 states have internal predecessors, (2292), 0 states have call successors, (0), 0 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-26 08:51:57,867 INFO  L175             Difference]: Start difference. First operand has 108 places, 587 transitions, 5820 flow. Second operand 11 states and 979 transitions.
[2023-10-26 08:51:57,867 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 1023 transitions, 11617 flow
[2023-10-26 08:51:59,053 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 1023 transitions, 11458 flow, removed 78 selfloop flow, removed 1 redundant places.
[2023-10-26 08:51:59,083 INFO  L231             Difference]: Finished difference. Result has 125 places, 784 transitions, 9384 flow
[2023-10-26 08:51:59,084 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=5662, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9384, PETRI_PLACES=125, PETRI_TRANSITIONS=784}
[2023-10-26 08:51:59,084 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 68 predicate places.
[2023-10-26 08:51:59,084 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 784 transitions, 9384 flow
[2023-10-26 08:51:59,085 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 66.0) internal successors, (1650), 25 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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-26 08:51:59,085 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:59,085 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:59,096 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-26 08:51:59,289 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:59,290 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:59,290 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:59,291 INFO  L85        PathProgramCache]: Analyzing trace with hash 2096503118, now seen corresponding path program 1 times
[2023-10-26 08:51:59,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:59,291 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115352582]
[2023-10-26 08:51:59,292 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:59,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:59,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:59,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:51:59,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:59,793 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115352582]
[2023-10-26 08:51:59,802 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115352582] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:59,802 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488211670]
[2023-10-26 08:51:59,802 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:59,802 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:59,803 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:59,804 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-26 08:51:59,822 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-26 08:51:59,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:59,938 INFO  L263         TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-26 08:51:59,940 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:59,944 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-26 08:51:59,947 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 14 treesize of output 12
[2023-10-26 08:52:00,057 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:52:00,104 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:00,105 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:52:00,136 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:00,150 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:00,151 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:52:00,205 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2023-10-26 08:52:00,255 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:00,259 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:00,260 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:00,262 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:00,262 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:52:00,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:00,295 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:00,332 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2023-10-26 08:52:00,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:52:00,408 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488211670] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:00,409 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:00,409 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18
[2023-10-26 08:52:00,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530261077]
[2023-10-26 08:52:00,409 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:00,409 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2023-10-26 08:52:00,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:00,410 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2023-10-26 08:52:00,410 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=275, Unknown=1, NotChecked=34, Total=380
[2023-10-26 08:52:00,411 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 191
[2023-10-26 08:52:00,412 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 784 transitions, 9384 flow. Second operand  has 20 states, 20 states have (on average 64.5) internal successors, (1290), 20 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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-26 08:52:00,412 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:00,425 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 191
[2023-10-26 08:52:00,425 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:07,420 INFO  L130       PetriNetUnfolder]: 15686/26053 cut-off events.
[2023-10-26 08:52:07,420 INFO  L131       PetriNetUnfolder]: For 152073/152110 co-relation queries the response was YES.
[2023-10-26 08:52:07,509 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 163006 conditions, 26053 events. 15686/26053 cut-off events. For 152073/152110 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 185962 event pairs, 860 based on Foata normal form. 363/24869 useless extension candidates. Maximal degree in co-relation 152926. Up to 10197 conditions per place. 
[2023-10-26 08:52:07,654 INFO  L137   encePairwiseOnDemand]: 157/191 looper letters, 1004 selfloop transitions, 639 changer transitions 11/1659 dead transitions.
[2023-10-26 08:52:07,655 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1659 transitions, 21644 flow
[2023-10-26 08:52:07,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-10-26 08:52:07,655 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2023-10-26 08:52:07,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1182 transitions.
[2023-10-26 08:52:07,658 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.44203440538519073
[2023-10-26 08:52:07,658 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1182 transitions.
[2023-10-26 08:52:07,659 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1182 transitions.
[2023-10-26 08:52:07,659 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:07,659 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1182 transitions.
[2023-10-26 08:52:07,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 84.42857142857143) internal successors, (1182), 14 states have internal predecessors, (1182), 0 states have call successors, (0), 0 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-26 08:52:07,685 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 191.0) internal successors, (2865), 15 states have internal predecessors, (2865), 0 states have call successors, (0), 0 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-26 08:52:07,685 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 191.0) internal successors, (2865), 15 states have internal predecessors, (2865), 0 states have call successors, (0), 0 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-26 08:52:07,685 INFO  L175             Difference]: Start difference. First operand has 125 places, 784 transitions, 9384 flow. Second operand 14 states and 1182 transitions.
[2023-10-26 08:52:07,685 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 1659 transitions, 21644 flow
[2023-10-26 08:52:11,852 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 1659 transitions, 21612 flow, removed 15 selfloop flow, removed 1 redundant places.
[2023-10-26 08:52:11,870 INFO  L231             Difference]: Finished difference. Result has 145 places, 1191 transitions, 17011 flow
[2023-10-26 08:52:11,871 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=9370, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=17011, PETRI_PLACES=145, PETRI_TRANSITIONS=1191}
[2023-10-26 08:52:11,871 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 88 predicate places.
[2023-10-26 08:52:11,873 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 1191 transitions, 17011 flow
[2023-10-26 08:52:11,873 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 64.5) internal successors, (1290), 20 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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-26 08:52:11,873 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:11,873 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]
[2023-10-26 08:52:11,880 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-26 08:52:12,078 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,SelfDestructingSolverStorable9
[2023-10-26 08:52:12,078 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:12,079 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:12,079 INFO  L85        PathProgramCache]: Analyzing trace with hash -1997653206, now seen corresponding path program 1 times
[2023-10-26 08:52:12,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:12,080 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114063419]
[2023-10-26 08:52:12,080 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:12,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:12,140 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:12,204 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-26 08:52:12,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:12,205 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114063419]
[2023-10-26 08:52:12,205 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114063419] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:12,207 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096004776]
[2023-10-26 08:52:12,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:12,207 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:12,207 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:12,226 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-26 08:52:12,265 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-26 08:52:12,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:12,381 INFO  L263         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-26 08:52:12,382 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:12,425 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-26 08:52:12,425 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:12,466 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-26 08:52:12,466 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096004776] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:12,466 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:12,466 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-26 08:52:12,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691447183]
[2023-10-26 08:52:12,467 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:12,468 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-26 08:52:12,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:12,468 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-26 08:52:12,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-26 08:52:12,620 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 191
[2023-10-26 08:52:12,621 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 1191 transitions, 17011 flow. Second operand  has 9 states, 9 states have (on average 104.88888888888889) internal successors, (944), 9 states have internal predecessors, (944), 0 states have call successors, (0), 0 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-26 08:52:12,621 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:12,621 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 191
[2023-10-26 08:52:12,621 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:16,706 INFO  L130       PetriNetUnfolder]: 10331/18836 cut-off events.
[2023-10-26 08:52:16,706 INFO  L131       PetriNetUnfolder]: For 158424/160637 co-relation queries the response was YES.
[2023-10-26 08:52:16,770 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120162 conditions, 18836 events. 10331/18836 cut-off events. For 158424/160637 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 143801 event pairs, 1037 based on Foata normal form. 594/18963 useless extension candidates. Maximal degree in co-relation 120040. Up to 6725 conditions per place. 
[2023-10-26 08:52:16,851 INFO  L137   encePairwiseOnDemand]: 184/191 looper letters, 251 selfloop transitions, 14 changer transitions 37/1256 dead transitions.
[2023-10-26 08:52:16,852 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1256 transitions, 18740 flow
[2023-10-26 08:52:16,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-26 08:52:16,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-26 08:52:16,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 867 transitions.
[2023-10-26 08:52:16,865 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5674083769633508
[2023-10-26 08:52:16,866 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 867 transitions.
[2023-10-26 08:52:16,866 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 867 transitions.
[2023-10-26 08:52:16,866 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:16,866 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 867 transitions.
[2023-10-26 08:52:16,868 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 108.375) internal successors, (867), 8 states have internal predecessors, (867), 0 states have call successors, (0), 0 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-26 08:52:16,882 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 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-26 08:52:16,883 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 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-26 08:52:16,883 INFO  L175             Difference]: Start difference. First operand has 145 places, 1191 transitions, 17011 flow. Second operand 8 states and 867 transitions.
[2023-10-26 08:52:16,883 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 1256 transitions, 18740 flow
[2023-10-26 08:52:19,096 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 1256 transitions, 18568 flow, removed 73 selfloop flow, removed 4 redundant places.
[2023-10-26 08:52:19,112 INFO  L231             Difference]: Finished difference. Result has 152 places, 1124 transitions, 16122 flow
[2023-10-26 08:52:19,114 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=16409, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16122, PETRI_PLACES=152, PETRI_TRANSITIONS=1124}
[2023-10-26 08:52:19,114 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 95 predicate places.
[2023-10-26 08:52:19,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 1124 transitions, 16122 flow
[2023-10-26 08:52:19,115 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 104.88888888888889) internal successors, (944), 9 states have internal predecessors, (944), 0 states have call successors, (0), 0 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-26 08:52:19,115 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:19,115 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:19,122 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-26 08:52:19,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:19,321 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:19,321 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:19,337 INFO  L85        PathProgramCache]: Analyzing trace with hash 213974305, now seen corresponding path program 1 times
[2023-10-26 08:52:19,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:19,338 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831230350]
[2023-10-26 08:52:19,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:19,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:19,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:19,673 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-26 08:52:19,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:19,674 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831230350]
[2023-10-26 08:52:19,674 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831230350] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:52:19,674 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:52:19,674 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:52:19,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445811982]
[2023-10-26 08:52:19,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:52:19,676 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:52:19,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:19,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:52:19,677 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:52:19,825 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 191
[2023-10-26 08:52:19,825 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 1124 transitions, 16122 flow. Second operand  has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-26 08:52:19,825 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:19,825 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 191
[2023-10-26 08:52:19,825 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:26,324 INFO  L130       PetriNetUnfolder]: 13474/23272 cut-off events.
[2023-10-26 08:52:26,324 INFO  L131       PetriNetUnfolder]: For 200952/201655 co-relation queries the response was YES.
[2023-10-26 08:52:26,411 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 161199 conditions, 23272 events. 13474/23272 cut-off events. For 200952/201655 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 170618 event pairs, 1875 based on Foata normal form. 93/22220 useless extension candidates. Maximal degree in co-relation 161143. Up to 18552 conditions per place. 
[2023-10-26 08:52:26,548 INFO  L137   encePairwiseOnDemand]: 165/191 looper letters, 1016 selfloop transitions, 242 changer transitions 9/1339 dead transitions.
[2023-10-26 08:52:26,548 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 1339 transitions, 21430 flow
[2023-10-26 08:52:26,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:52:26,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:52:26,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 670 transitions.
[2023-10-26 08:52:26,550 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5846422338568935
[2023-10-26 08:52:26,550 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 670 transitions.
[2023-10-26 08:52:26,550 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 670 transitions.
[2023-10-26 08:52:26,557 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:26,557 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 670 transitions.
[2023-10-26 08:52:26,558 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 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-26 08:52:26,560 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:26,560 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:26,560 INFO  L175             Difference]: Start difference. First operand has 152 places, 1124 transitions, 16122 flow. Second operand 6 states and 670 transitions.
[2023-10-26 08:52:26,561 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 1339 transitions, 21430 flow
[2023-10-26 08:52:28,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 1339 transitions, 20971 flow, removed 10 selfloop flow, removed 5 redundant places.
[2023-10-26 08:52:28,890 INFO  L231             Difference]: Finished difference. Result has 154 places, 1286 transitions, 18848 flow
[2023-10-26 08:52:28,892 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=15715, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18848, PETRI_PLACES=154, PETRI_TRANSITIONS=1286}
[2023-10-26 08:52:28,892 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 97 predicate places.
[2023-10-26 08:52:28,893 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 1286 transitions, 18848 flow
[2023-10-26 08:52:28,893 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-26 08:52:28,893 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:28,893 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:28,893 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-26 08:52:28,893 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:28,894 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:28,894 INFO  L85        PathProgramCache]: Analyzing trace with hash -219037260, now seen corresponding path program 1 times
[2023-10-26 08:52:28,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:28,894 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362035285]
[2023-10-26 08:52:28,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:28,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:28,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:29,609 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-26 08:52:29,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:29,609 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362035285]
[2023-10-26 08:52:29,609 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362035285] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:29,610 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938794191]
[2023-10-26 08:52:29,610 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:29,610 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:29,610 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:29,611 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-26 08:52:29,648 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-26 08:52:29,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:29,799 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 41 conjunts are in the unsatisfiable core
[2023-10-26 08:52:29,802 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:29,807 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-26 08:52:29,807 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27
[2023-10-26 08:52:29,902 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:52:29,902 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-26 08:52:29,956 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-10-26 08:52:29,999 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-10-26 08:52:30,013 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:52:30,021 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-26 08:52:30,043 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:30,043 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:52:30,054 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:30,054 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:52:30,087 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-26 08:52:30,094 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-26 08:52:30,094 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:30,120 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2023-10-26 08:52:30,264 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-10-26 08:52:30,301 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:52:30,330 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:30,330 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-26 08:52:30,335 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:30,335 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 76 treesize of output 32
[2023-10-26 08:52:30,343 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:52:30,343 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-26 08:52:30,349 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:52:30,349 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-26 08:52:30,354 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:52:30,355 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-26 08:52:30,378 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-10-26 08:52:30,398 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-10-26 08:52:30,403 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_712 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_712) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2023-10-26 08:52:30,420 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_712 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_712) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2023-10-26 08:52:30,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:52:30,422 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [938794191] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:30,422 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:30,422 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 22
[2023-10-26 08:52:30,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030545292]
[2023-10-26 08:52:30,423 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:30,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2023-10-26 08:52:30,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:30,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2023-10-26 08:52:30,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=222, Unknown=12, NotChecked=252, Total=552
[2023-10-26 08:52:30,425 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-10-26 08:52:30,442 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 1286 transitions, 18848 flow. Second operand  has 24 states, 24 states have (on average 59.25) internal successors, (1422), 24 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:30,442 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:30,442 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-10-26 08:52:30,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:41,150 INFO  L130       PetriNetUnfolder]: 18971/31588 cut-off events.
[2023-10-26 08:52:41,150 INFO  L131       PetriNetUnfolder]: For 302050/302050 co-relation queries the response was YES.
[2023-10-26 08:52:41,289 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 230149 conditions, 31588 events. 18971/31588 cut-off events. For 302050/302050 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 229110 event pairs, 2613 based on Foata normal form. 77/30637 useless extension candidates. Maximal degree in co-relation 178999. Up to 25759 conditions per place. 
[2023-10-26 08:52:41,429 INFO  L137   encePairwiseOnDemand]: 159/191 looper letters, 2020 selfloop transitions, 564 changer transitions 1/2587 dead transitions.
[2023-10-26 08:52:41,430 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 2587 transitions, 41068 flow
[2023-10-26 08:52:41,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-10-26 08:52:41,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-10-26 08:52:41,447 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1588 transitions.
[2023-10-26 08:52:41,451 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37791527843883865
[2023-10-26 08:52:41,451 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1588 transitions.
[2023-10-26 08:52:41,451 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1588 transitions.
[2023-10-26 08:52:41,452 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:41,453 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1588 transitions.
[2023-10-26 08:52:41,455 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 72.18181818181819) internal successors, (1588), 22 states have internal predecessors, (1588), 0 states have call successors, (0), 0 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-26 08:52:41,473 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 191.0) internal successors, (4393), 23 states have internal predecessors, (4393), 0 states have call successors, (0), 0 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-26 08:52:41,474 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 191.0) internal successors, (4393), 23 states have internal predecessors, (4393), 0 states have call successors, (0), 0 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-26 08:52:41,474 INFO  L175             Difference]: Start difference. First operand has 154 places, 1286 transitions, 18848 flow. Second operand 22 states and 1588 transitions.
[2023-10-26 08:52:41,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 2587 transitions, 41068 flow
[2023-10-26 08:52:46,437 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 2587 transitions, 40480 flow, removed 294 selfloop flow, removed 0 redundant places.
[2023-10-26 08:52:46,467 INFO  L231             Difference]: Finished difference. Result has 193 places, 1854 transitions, 29524 flow
[2023-10-26 08:52:46,467 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=18338, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=912, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=29524, PETRI_PLACES=193, PETRI_TRANSITIONS=1854}
[2023-10-26 08:52:46,468 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 136 predicate places.
[2023-10-26 08:52:46,468 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 1854 transitions, 29524 flow
[2023-10-26 08:52:46,468 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 59.25) internal successors, (1422), 24 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:52:46,469 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:46,469 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:46,474 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-26 08:52:46,673 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2023-10-26 08:52:46,673 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:46,674 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:46,674 INFO  L85        PathProgramCache]: Analyzing trace with hash -468814104, now seen corresponding path program 2 times
[2023-10-26 08:52:46,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:46,678 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440965358]
[2023-10-26 08:52:46,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:46,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:46,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:47,500 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-26 08:52:47,501 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:47,501 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440965358]
[2023-10-26 08:52:47,501 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440965358] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:47,501 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384096075]
[2023-10-26 08:52:47,501 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:52:47,501 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:47,501 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:47,502 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-26 08:52:47,539 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-26 08:52:47,707 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:52:47,707 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:52:47,709 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 58 conjunts are in the unsatisfiable core
[2023-10-26 08:52:47,712 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:47,718 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:47,721 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-26 08:52:47,916 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:52:47,916 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 38 treesize of output 37
[2023-10-26 08:52:47,936 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:47,941 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-10-26 08:52:48,027 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,028 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-26 08:52:48,043 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,044 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-26 08:52:48,111 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:52:48,180 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:52:48,348 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,349 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,349 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:52:48,453 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,454 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,455 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,456 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:52:48,566 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-26 08:52:48,589 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-26 08:52:48,660 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,660 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:52:48,703 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,703 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:52:48,744 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,745 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:52:48,788 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,790 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:52:48,937 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,937 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,938 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:52:48,939 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-10-26 08:52:48,984 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-26 08:52:48,984 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:49,213 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-10-26 08:52:59,028 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) .cse6))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_834))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_836))) c_threadThread1of2ForFork0_~t~0.base) .cse8)))))) is different from false
[2023-10-26 08:53:00,041 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:00,041 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 79 treesize of output 72
[2023-10-26 08:53:00,054 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:00,055 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 516 treesize of output 452
[2023-10-26 08:53:00,080 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 478 treesize of output 462
[2023-10-26 08:53:00,214 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 262 treesize of output 254
[2023-10-26 08:53:00,607 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:00,607 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 89
[2023-10-26 08:53:00,655 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:00,655 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-10-26 08:53:00,661 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-26 08:53:00,684 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-26 08:53:00,684 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 138
[2023-10-26 08:53:00,694 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 71 treesize of output 67
[2023-10-26 08:53:00,719 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 128
[2023-10-26 08:53:00,772 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:00,774 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-10-26 08:53:00,780 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-26 08:53:00,817 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-26 08:53:00,818 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 138
[2023-10-26 08:53:00,827 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 71 treesize of output 67
[2023-10-26 08:53:00,835 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 128
[2023-10-26 08:53:00,888 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:53:00,888 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-10-26 08:53:00,894 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-26 08:53:00,920 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-26 08:53:00,921 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 126
[2023-10-26 08:53:00,931 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 56 treesize of output 52
[2023-10-26 08:53:00,944 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 98
[2023-10-26 08:53:07,113 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-26 08:53:07,113 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384096075] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:53:07,113 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:53:07,113 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36
[2023-10-26 08:53:07,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990316044]
[2023-10-26 08:53:07,113 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:53:07,114 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2023-10-26 08:53:07,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:53:07,114 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2023-10-26 08:53:07,114 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1027, Unknown=51, NotChecked=138, Total=1406
[2023-10-26 08:53:07,422 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 191
[2023-10-26 08:53:07,423 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 1854 transitions, 29524 flow. Second operand  has 38 states, 38 states have (on average 53.94736842105263) internal successors, (2050), 38 states have internal predecessors, (2050), 0 states have call successors, (0), 0 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-26 08:53:07,424 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:53:07,424 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 191
[2023-10-26 08:53:07,424 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:53:27,749 INFO  L130       PetriNetUnfolder]: 19633/32557 cut-off events.
[2023-10-26 08:53:27,749 INFO  L131       PetriNetUnfolder]: For 429869/429869 co-relation queries the response was YES.
[2023-10-26 08:53:27,920 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 266660 conditions, 32557 events. 19633/32557 cut-off events. For 429869/429869 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 235940 event pairs, 1732 based on Foata normal form. 50/31579 useless extension candidates. Maximal degree in co-relation 248663. Up to 27706 conditions per place. 
[2023-10-26 08:53:28,064 INFO  L137   encePairwiseOnDemand]: 163/191 looper letters, 2149 selfloop transitions, 390 changer transitions 2/2543 dead transitions.
[2023-10-26 08:53:28,064 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 2543 transitions, 44223 flow
[2023-10-26 08:53:28,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-10-26 08:53:28,065 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-10-26 08:53:28,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1699 transitions.
[2023-10-26 08:53:28,080 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34212645992750707
[2023-10-26 08:53:28,080 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1699 transitions.
[2023-10-26 08:53:28,080 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1699 transitions.
[2023-10-26 08:53:28,080 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:53:28,080 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1699 transitions.
[2023-10-26 08:53:28,085 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 65.34615384615384) internal successors, (1699), 26 states have internal predecessors, (1699), 0 states have call successors, (0), 0 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-26 08:53:28,114 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 191.0) internal successors, (5157), 27 states have internal predecessors, (5157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:28,124 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 191.0) internal successors, (5157), 27 states have internal predecessors, (5157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:53:28,125 INFO  L175             Difference]: Start difference. First operand has 193 places, 1854 transitions, 29524 flow. Second operand 26 states and 1699 transitions.
[2023-10-26 08:53:28,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 2543 transitions, 44223 flow
[2023-10-26 08:53:36,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 2543 transitions, 43911 flow, removed 154 selfloop flow, removed 2 redundant places.
[2023-10-26 08:53:36,380 INFO  L231             Difference]: Finished difference. Result has 231 places, 2157 transitions, 35360 flow
[2023-10-26 08:53:36,382 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=29224, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=35360, PETRI_PLACES=231, PETRI_TRANSITIONS=2157}
[2023-10-26 08:53:36,383 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 174 predicate places.
[2023-10-26 08:53:36,383 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 2157 transitions, 35360 flow
[2023-10-26 08:53:36,384 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 38 states have (on average 53.94736842105263) internal successors, (2050), 38 states have internal predecessors, (2050), 0 states have call successors, (0), 0 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-26 08:53:36,384 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:53:36,385 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:53:36,391 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-26 08:53:36,589 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2023-10-26 08:53:36,589 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:53:36,590 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:53:36,590 INFO  L85        PathProgramCache]: Analyzing trace with hash 1582367040, now seen corresponding path program 3 times
[2023-10-26 08:53:36,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:53:36,590 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12984344]
[2023-10-26 08:53:36,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:36,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:53:36,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:37,726 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-26 08:53:37,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:53:37,726 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12984344]
[2023-10-26 08:53:37,726 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12984344] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:53:37,726 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522739881]
[2023-10-26 08:53:37,726 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-26 08:53:37,726 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:53:37,726 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:53:37,740 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-26 08:53:37,770 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-26 08:53:37,950 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-26 08:53:37,950 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:53:37,966 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 50 conjunts are in the unsatisfiable core
[2023-10-26 08:53:37,969 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:53:37,976 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-26 08:53:38,269 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:53:38,269 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-26 08:53:38,352 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-26 08:53:38,494 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:53:38,573 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-26 08:53:38,638 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:38,639 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:53:38,728 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:38,729 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:38,730 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:53:38,830 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:38,831 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:38,832 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:53:38,833 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:53:38,936 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:53:38,968 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:53:39,003 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:53:39,052 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:53:39,157 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-26 08:53:39,214 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-26 08:53:39,214 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:53:39,246 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_947 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_947 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_947) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:54:01,453 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:54:01,454 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2023-10-26 08:54:01,461 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:54:01,461 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 82
[2023-10-26 08:54:01,466 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32
[2023-10-26 08:54:01,469 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46
[2023-10-26 08:54:01,519 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:54:01,520 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:54:01,531 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:54:01,531 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2023-10-26 08:54:01,538 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:54:01,538 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:54:01,795 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-26 08:54:01,795 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522739881] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:54:01,795 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:54:01,795 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31
[2023-10-26 08:54:01,795 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501648816]
[2023-10-26 08:54:01,795 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:54:01,796 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2023-10-26 08:54:01,796 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:54:01,796 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2023-10-26 08:54:01,796 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=779, Unknown=79, NotChecked=60, Total=1056
[2023-10-26 08:54:02,446 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-10-26 08:54:02,447 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 2157 transitions, 35360 flow. Second operand  has 33 states, 33 states have (on average 59.121212121212125) internal successors, (1951), 33 states have internal predecessors, (1951), 0 states have call successors, (0), 0 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-26 08:54:02,447 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:54:02,447 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-10-26 08:54:02,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:54:21,243 INFO  L130       PetriNetUnfolder]: 21490/35492 cut-off events.
[2023-10-26 08:54:21,243 INFO  L131       PetriNetUnfolder]: For 543211/543213 co-relation queries the response was YES.
[2023-10-26 08:54:21,439 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 306761 conditions, 35492 events. 21490/35492 cut-off events. For 543211/543213 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 258870 event pairs, 1836 based on Foata normal form. 82/34546 useless extension candidates. Maximal degree in co-relation 301618. Up to 28561 conditions per place. 
[2023-10-26 08:54:21,704 INFO  L137   encePairwiseOnDemand]: 173/191 looper letters, 2458 selfloop transitions, 506 changer transitions 0/2966 dead transitions.
[2023-10-26 08:54:21,704 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 2966 transitions, 54598 flow
[2023-10-26 08:54:21,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-10-26 08:54:21,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-10-26 08:54:21,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1304 transitions.
[2023-10-26 08:54:21,707 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37929028504944734
[2023-10-26 08:54:21,707 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1304 transitions.
[2023-10-26 08:54:21,707 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1304 transitions.
[2023-10-26 08:54:21,707 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:54:21,707 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1304 transitions.
[2023-10-26 08:54:21,709 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 72.44444444444444) internal successors, (1304), 18 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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-26 08:54:21,711 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 191.0) internal successors, (3629), 19 states have internal predecessors, (3629), 0 states have call successors, (0), 0 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-26 08:54:21,711 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 191.0) internal successors, (3629), 19 states have internal predecessors, (3629), 0 states have call successors, (0), 0 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-26 08:54:21,711 INFO  L175             Difference]: Start difference. First operand has 231 places, 2157 transitions, 35360 flow. Second operand 18 states and 1304 transitions.
[2023-10-26 08:54:21,711 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 2966 transitions, 54598 flow
[2023-10-26 08:54:36,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 2966 transitions, 53970 flow, removed 297 selfloop flow, removed 8 redundant places.
[2023-10-26 08:54:36,348 INFO  L231             Difference]: Finished difference. Result has 249 places, 2443 transitions, 42361 flow
[2023-10-26 08:54:36,350 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=34856, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=42361, PETRI_PLACES=249, PETRI_TRANSITIONS=2443}
[2023-10-26 08:54:36,352 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 192 predicate places.
[2023-10-26 08:54:36,352 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 2443 transitions, 42361 flow
[2023-10-26 08:54:36,352 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 59.121212121212125) internal successors, (1951), 33 states have internal predecessors, (1951), 0 states have call successors, (0), 0 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-26 08:54:36,352 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:54:36,352 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:54:36,359 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-26 08:54:36,557 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,SelfDestructingSolverStorable14
[2023-10-26 08:54:36,557 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:54:36,558 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:54:36,558 INFO  L85        PathProgramCache]: Analyzing trace with hash 663141978, now seen corresponding path program 4 times
[2023-10-26 08:54:36,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:54:36,559 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749482206]
[2023-10-26 08:54:36,559 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:54:36,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:54:36,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:54:37,547 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-26 08:54:37,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:54:37,547 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749482206]
[2023-10-26 08:54:37,548 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749482206] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:54:37,548 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383499107]
[2023-10-26 08:54:37,548 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-26 08:54:37,548 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:54:37,548 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:54:37,549 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-26 08:54:37,575 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-26 08:54:37,823 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-26 08:54:37,823 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:54:37,825 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 55 conjunts are in the unsatisfiable core
[2023-10-26 08:54:37,832 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:54:37,851 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-26 08:54:37,851 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27
[2023-10-26 08:54:38,084 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:54:38,085 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-26 08:54:38,180 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-10-26 08:54:38,265 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:54:38,371 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:38,372 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:54:38,460 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:38,461 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:38,461 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:54:38,607 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-10-26 08:54:38,701 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2023-10-26 08:54:38,734 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:38,735 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:38,736 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:54:38,737 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:54:38,834 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 41 treesize of output 37
[2023-10-26 08:54:38,893 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 41 treesize of output 37
[2023-10-26 08:54:38,934 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 41 treesize of output 37
[2023-10-26 08:54:39,105 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-26 08:54:39,175 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-26 08:54:39,175 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:54:39,223 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1060 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2023-10-26 08:54:39,286 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2023-10-26 08:54:39,851 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (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_1054))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) .cse1))))) is different from false
[2023-10-26 08:54:39,883 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (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_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) .cse2 v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) .cse2 v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (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_1054))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) .cse2 v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) .cse2 v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2023-10-26 08:54:39,994 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) .cse3 v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) .cse3 v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) .cse3 v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse6 c_threadThread1of2ForFork0_~t~0.base (store (select .cse6 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1059) .cse3 v_ArrVal_1060) c_threadThread1of2ForFork0_~t~0.base) .cse7)))))) is different from false
[2023-10-26 08:54:40,330 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:54:40,330 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 71 treesize of output 64
[2023-10-26 08:54:40,338 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:54:40,338 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 308 treesize of output 226
[2023-10-26 08:54:40,344 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 210 treesize of output 186
[2023-10-26 08:54:40,349 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 70 treesize of output 66
[2023-10-26 08:54:40,366 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 182 treesize of output 170
[2023-10-26 08:54:40,446 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2023-10-26 08:54:40,447 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 69 treesize of output 1
[2023-10-26 08:54:40,453 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2023-10-26 08:54:40,453 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 71 treesize of output 1
[2023-10-26 08:54:40,466 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2023-10-26 08:54:40,466 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 71 treesize of output 1
[2023-10-26 08:54:40,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:54:40,705 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [383499107] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:54:40,705 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:54:40,705 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 32
[2023-10-26 08:54:40,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543440209]
[2023-10-26 08:54:40,705 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:54:40,706 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2023-10-26 08:54:40,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:54:40,706 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2023-10-26 08:54:40,706 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=676, Unknown=25, NotChecked=290, Total=1122
[2023-10-26 08:54:40,707 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-10-26 08:54:40,708 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 2443 transitions, 42361 flow. Second operand  has 34 states, 34 states have (on average 59.11764705882353) internal successors, (2010), 34 states have internal predecessors, (2010), 0 states have call successors, (0), 0 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-26 08:54:40,708 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:54:40,708 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-10-26 08:54:40,708 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:03,071 INFO  L130       PetriNetUnfolder]: 22111/36471 cut-off events.
[2023-10-26 08:55:03,071 INFO  L131       PetriNetUnfolder]: For 624388/624390 co-relation queries the response was YES.
[2023-10-26 08:55:03,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 328631 conditions, 36471 events. 22111/36471 cut-off events. For 624388/624390 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 266569 event pairs, 1780 based on Foata normal form. 82/35525 useless extension candidates. Maximal degree in co-relation 322961. Up to 29681 conditions per place. 
[2023-10-26 08:55:03,497 INFO  L137   encePairwiseOnDemand]: 158/191 looper letters, 2318 selfloop transitions, 646 changer transitions 0/2966 dead transitions.
[2023-10-26 08:55:03,497 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 2966 transitions, 56570 flow
[2023-10-26 08:55:03,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-26 08:55:03,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-26 08:55:03,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1770 transitions.
[2023-10-26 08:55:03,499 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3706806282722513
[2023-10-26 08:55:03,499 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1770 transitions.
[2023-10-26 08:55:03,499 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1770 transitions.
[2023-10-26 08:55:03,500 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:55:03,500 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1770 transitions.
[2023-10-26 08:55:03,502 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 70.8) internal successors, (1770), 25 states have internal predecessors, (1770), 0 states have call successors, (0), 0 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-26 08:55:03,505 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 191.0) internal successors, (4966), 26 states have internal predecessors, (4966), 0 states have call successors, (0), 0 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-26 08:55:03,505 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 191.0) internal successors, (4966), 26 states have internal predecessors, (4966), 0 states have call successors, (0), 0 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-26 08:55:03,505 INFO  L175             Difference]: Start difference. First operand has 249 places, 2443 transitions, 42361 flow. Second operand 25 states and 1770 transitions.
[2023-10-26 08:55:03,505 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 2966 transitions, 56570 flow
[2023-10-26 08:55:22,602 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 2966 transitions, 56289 flow, removed 105 selfloop flow, removed 6 redundant places.
[2023-10-26 08:55:22,642 INFO  L231             Difference]: Finished difference. Result has 278 places, 2632 transitions, 47785 flow
[2023-10-26 08:55:22,644 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=42095, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=465, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1891, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=47785, PETRI_PLACES=278, PETRI_TRANSITIONS=2632}
[2023-10-26 08:55:22,645 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 221 predicate places.
[2023-10-26 08:55:22,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 278 places, 2632 transitions, 47785 flow
[2023-10-26 08:55:22,646 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 59.11764705882353) internal successors, (2010), 34 states have internal predecessors, (2010), 0 states have call successors, (0), 0 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-26 08:55:22,646 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:22,646 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:55:22,652 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-26 08:55:22,850 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-10-26 08:55:22,851 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:55:22,852 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:22,852 INFO  L85        PathProgramCache]: Analyzing trace with hash -2135794578, now seen corresponding path program 5 times
[2023-10-26 08:55:22,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:22,853 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463669259]
[2023-10-26 08:55:22,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:22,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:22,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:23,741 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-26 08:55:23,742 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:23,742 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463669259]
[2023-10-26 08:55:23,742 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463669259] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:55:23,742 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996020151]
[2023-10-26 08:55:23,742 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-26 08:55:23,742 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:55:23,742 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:55:23,743 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:55:23,773 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-10-26 08:55:23,889 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:55:23,889 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:55:23,890 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-10-26 08:55:23,892 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:55:23,898 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:23,902 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-26 08:55:24,058 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:55:24,058 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-26 08:55:24,117 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,118 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-26 08:55:24,163 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:55:24,250 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,251 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:55:24,331 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-26 08:55:24,401 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,403 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,404 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:55:24,519 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,521 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,522 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,523 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:55:24,648 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,649 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:55:24,699 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,700 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:55:24,742 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,743 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:55:24,782 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:55:24,783 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:55:24,912 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-26 08:55:24,958 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-26 08:55:24,958 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:55:24,996 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-10-26 08:55:25,043 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2023-10-26 08:55:25,409 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-26 08:55:25,750 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |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_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) .cse1 v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) .cse1 v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) .cse1 v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1170) .cse1 v_ArrVal_1171) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:55:25,856 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:25,857 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2023-10-26 08:55:25,864 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:25,864 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 228 treesize of output 154
[2023-10-26 08:55:25,868 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110
[2023-10-26 08:55:25,873 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 59 treesize of output 51
[2023-10-26 08:55:25,900 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:55:25,901 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:55:25,906 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:55:25,907 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:55:25,913 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:55:25,914 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2023-10-26 08:55:26,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:55:26,041 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996020151] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:55:26,041 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:55:26,041 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31
[2023-10-26 08:55:26,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249059327]
[2023-10-26 08:55:26,041 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:55:26,041 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2023-10-26 08:55:26,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:55:26,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2023-10-26 08:55:26,042 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=662, Unknown=46, NotChecked=228, Total=1056
[2023-10-26 08:55:26,240 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-10-26 08:55:26,241 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 2632 transitions, 47785 flow. Second operand  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 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-26 08:55:26,241 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:55:26,241 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-10-26 08:55:26,241 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:29,250 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-26 08:55:33,453 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-26 08:55:35,634 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-26 08:55:39,849 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-26 08:55:41,871 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-26 08:55:46,516 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-26 08:55:48,522 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-26 08:56:11,600 INFO  L130       PetriNetUnfolder]: 23651/38870 cut-off events.
[2023-10-26 08:56:11,600 INFO  L131       PetriNetUnfolder]: For 728904/728904 co-relation queries the response was YES.
[2023-10-26 08:56:11,876 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 365889 conditions, 38870 events. 23651/38870 cut-off events. For 728904/728904 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 285010 event pairs, 1839 based on Foata normal form. 92/37934 useless extension candidates. Maximal degree in co-relation 359517. Up to 30573 conditions per place. 
[2023-10-26 08:56:12,072 INFO  L137   encePairwiseOnDemand]: 158/191 looper letters, 2822 selfloop transitions, 720 changer transitions 0/3544 dead transitions.
[2023-10-26 08:56:12,072 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 3544 transitions, 71844 flow
[2023-10-26 08:56:12,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-10-26 08:56:12,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-10-26 08:56:12,074 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1568 transitions.
[2023-10-26 08:56:12,075 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.373155640171347
[2023-10-26 08:56:12,075 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1568 transitions.
[2023-10-26 08:56:12,075 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1568 transitions.
[2023-10-26 08:56:12,076 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:56:12,076 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1568 transitions.
[2023-10-26 08:56:12,077 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 71.27272727272727) internal successors, (1568), 22 states have internal predecessors, (1568), 0 states have call successors, (0), 0 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-26 08:56:12,080 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 191.0) internal successors, (4393), 23 states have internal predecessors, (4393), 0 states have call successors, (0), 0 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-26 08:56:12,081 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 191.0) internal successors, (4393), 23 states have internal predecessors, (4393), 0 states have call successors, (0), 0 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-26 08:56:12,081 INFO  L175             Difference]: Start difference. First operand has 278 places, 2632 transitions, 47785 flow. Second operand 22 states and 1568 transitions.
[2023-10-26 08:56:12,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 3544 transitions, 71844 flow
[2023-10-26 08:56:36,216 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 3544 transitions, 70646 flow, removed 355 selfloop flow, removed 15 redundant places.
[2023-10-26 08:56:36,266 INFO  L231             Difference]: Finished difference. Result has 298 places, 3027 transitions, 58236 flow
[2023-10-26 08:56:36,268 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=47082, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2077, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=58236, PETRI_PLACES=298, PETRI_TRANSITIONS=3027}
[2023-10-26 08:56:36,273 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 241 predicate places.
[2023-10-26 08:56:36,274 INFO  L495      AbstractCegarLoop]: Abstraction has has 298 places, 3027 transitions, 58236 flow
[2023-10-26 08:56:36,274 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 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-26 08:56:36,274 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:56:36,274 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:56:36,281 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-10-26 08:56:36,479 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-10-26 08:56:36,480 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:56:36,480 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:56:36,481 INFO  L85        PathProgramCache]: Analyzing trace with hash -1256111306, now seen corresponding path program 6 times
[2023-10-26 08:56:36,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:56:36,481 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650411856]
[2023-10-26 08:56:36,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:56:36,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:56:36,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:56:37,270 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-26 08:56:37,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:56:37,270 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650411856]
[2023-10-26 08:56:37,270 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650411856] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:56:37,270 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718617136]
[2023-10-26 08:56:37,270 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2023-10-26 08:56:37,270 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:56:37,271 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:56:37,272 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:56:37,293 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-10-26 08:56:37,452 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2023-10-26 08:56:37,452 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:56:37,453 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 49 conjunts are in the unsatisfiable core
[2023-10-26 08:56:37,456 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:56:37,464 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-26 08:56:37,643 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:56:37,643 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-26 08:56:37,703 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-26 08:56:37,784 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-26 08:56:37,846 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:56:37,898 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-26 08:56:37,934 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:56:37,935 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:56:37,980 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:56:37,981 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:56:37,982 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:56:38,033 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:56:38,034 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:56:38,035 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:56:38,036 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:56:38,117 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-26 08:56:38,161 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-26 08:56:38,162 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:56:38,982 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:56:38,983 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 1 case distinctions, treesize of input 18 treesize of output 19
[2023-10-26 08:56:38,986 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 18 treesize of output 14
[2023-10-26 08:56:39,258 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-26 08:56:39,258 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718617136] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:56:39,258 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:56:39,258 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 28
[2023-10-26 08:56:39,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125487237]
[2023-10-26 08:56:39,258 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:56:39,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2023-10-26 08:56:39,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:56:39,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2023-10-26 08:56:39,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=715, Unknown=36, NotChecked=0, Total=870
[2023-10-26 08:56:40,053 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-10-26 08:56:40,054 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 3027 transitions, 58236 flow. Second operand  has 30 states, 30 states have (on average 59.166666666666664) internal successors, (1775), 30 states have internal predecessors, (1775), 0 states have call successors, (0), 0 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-26 08:56:40,054 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:56:40,054 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-10-26 08:56:40,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:12,779 INFO  L130       PetriNetUnfolder]: 31381/51372 cut-off events.
[2023-10-26 08:57:12,779 INFO  L131       PetriNetUnfolder]: For 1031530/1031530 co-relation queries the response was YES.
[2023-10-26 08:57:13,361 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 489785 conditions, 51372 events. 31381/51372 cut-off events. For 1031530/1031530 co-relation queries the response was YES. Maximal size of possible extension queue 1389. Compared 392634 event pairs, 2512 based on Foata normal form. 290/50004 useless extension candidates. Maximal degree in co-relation 475492. Up to 24269 conditions per place. 
[2023-10-26 08:57:13,629 INFO  L137   encePairwiseOnDemand]: 171/191 looper letters, 3280 selfloop transitions, 1457 changer transitions 3/4742 dead transitions.
[2023-10-26 08:57:13,630 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 4742 transitions, 97398 flow
[2023-10-26 08:57:13,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-26 08:57:13,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-26 08:57:13,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1412 transitions.
[2023-10-26 08:57:13,632 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38908790300358226
[2023-10-26 08:57:13,633 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1412 transitions.
[2023-10-26 08:57:13,633 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1412 transitions.
[2023-10-26 08:57:13,633 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:13,633 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1412 transitions.
[2023-10-26 08:57:13,634 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 74.3157894736842) internal successors, (1412), 19 states have internal predecessors, (1412), 0 states have call successors, (0), 0 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-26 08:57:13,637 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 191.0) internal successors, (3820), 20 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:13,637 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 191.0) internal successors, (3820), 20 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:13,637 INFO  L175             Difference]: Start difference. First operand has 298 places, 3027 transitions, 58236 flow. Second operand 19 states and 1412 transitions.
[2023-10-26 08:57:13,637 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 4742 transitions, 97398 flow
[2023-10-26 08:58:06,579 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 4742 transitions, 96613 flow, removed 383 selfloop flow, removed 4 redundant places.
[2023-10-26 08:58:06,654 INFO  L231             Difference]: Finished difference. Result has 324 places, 3838 transitions, 79910 flow
[2023-10-26 08:58:06,656 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=57457, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=753, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=79910, PETRI_PLACES=324, PETRI_TRANSITIONS=3838}
[2023-10-26 08:58:06,657 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 267 predicate places.
[2023-10-26 08:58:06,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 324 places, 3838 transitions, 79910 flow
[2023-10-26 08:58:06,657 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 59.166666666666664) internal successors, (1775), 30 states have internal predecessors, (1775), 0 states have call successors, (0), 0 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-26 08:58:06,657 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:06,657 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:58:06,664 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2023-10-26 08:58:06,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-26 08:58:06,863 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:58:06,864 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:06,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -629172633, now seen corresponding path program 1 times
[2023-10-26 08:58:06,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:06,865 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256495773]
[2023-10-26 08:58:06,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:06,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:06,905 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:07,528 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-26 08:58:07,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:07,528 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256495773]
[2023-10-26 08:58:07,528 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256495773] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:58:07,528 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730370460]
[2023-10-26 08:58:07,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:07,529 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:58:07,529 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:58:07,530 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:58:07,573 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-10-26 08:58:07,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:07,742 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core
[2023-10-26 08:58:07,747 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:58:07,754 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:07,757 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-26 08:58:07,758 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36
[2023-10-26 08:58:07,958 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:58:07,959 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-26 08:58:08,000 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:58:08,005 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-10-26 08:58:08,061 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2023-10-26 08:58:08,081 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-26 08:58:08,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 0 case distinctions, treesize of input 18 treesize of output 20
[2023-10-26 08:58:08,110 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:58:08,127 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:58:08,127 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:58:08,148 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:58:08,148 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:58:08,159 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-26 08:58:08,159 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:58:08,267 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:58:08,267 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 1 case distinctions, treesize of input 26 treesize of output 27
[2023-10-26 08:58:08,270 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 42 treesize of output 26
[2023-10-26 08:58:08,311 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1380 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-10-26 08:58:08,575 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-26 08:58:08,575 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [730370460] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:58:08,575 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:58:08,575 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20
[2023-10-26 08:58:08,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511010878]
[2023-10-26 08:58:08,575 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:58:08,575 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2023-10-26 08:58:08,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:08,576 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2023-10-26 08:58:08,576 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=326, Unknown=26, NotChecked=38, Total=462
[2023-10-26 08:58:09,263 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 191
[2023-10-26 08:58:09,264 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 3838 transitions, 79910 flow. Second operand  has 22 states, 22 states have (on average 56.27272727272727) internal successors, (1238), 22 states have internal predecessors, (1238), 0 states have call successors, (0), 0 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-26 08:58:09,264 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:09,264 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 191
[2023-10-26 08:58:09,264 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:58:49,933 INFO  L130       PetriNetUnfolder]: 31667/51870 cut-off events.
[2023-10-26 08:58:49,937 INFO  L131       PetriNetUnfolder]: For 1248924/1248924 co-relation queries the response was YES.
[2023-10-26 08:58:50,541 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 526282 conditions, 51870 events. 31667/51870 cut-off events. For 1248924/1248924 co-relation queries the response was YES. Maximal size of possible extension queue 1399. Compared 397583 event pairs, 2120 based on Foata normal form. 300/50468 useless extension candidates. Maximal degree in co-relation 511282. Up to 22036 conditions per place. 
[2023-10-26 08:58:50,808 INFO  L137   encePairwiseOnDemand]: 169/191 looper letters, 3457 selfloop transitions, 2073 changer transitions 0/5532 dead transitions.
[2023-10-26 08:58:50,809 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 5532 transitions, 124712 flow
[2023-10-26 08:58:50,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2023-10-26 08:58:50,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2023-10-26 08:58:50,811 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1980 transitions.
[2023-10-26 08:58:50,813 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34554973821989526
[2023-10-26 08:58:50,813 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1980 transitions.
[2023-10-26 08:58:50,813 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1980 transitions.
[2023-10-26 08:58:50,813 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:58:50,813 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1980 transitions.
[2023-10-26 08:58:50,815 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 66.0) internal successors, (1980), 30 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:50,841 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 191.0) internal successors, (5921), 31 states have internal predecessors, (5921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:50,842 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 191.0) internal successors, (5921), 31 states have internal predecessors, (5921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:58:50,842 INFO  L175             Difference]: Start difference. First operand has 324 places, 3838 transitions, 79910 flow. Second operand 30 states and 1980 transitions.
[2023-10-26 08:58:50,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 5532 transitions, 124712 flow
[2023-10-26 08:59:54,899 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 5532 transitions, 123236 flow, removed 686 selfloop flow, removed 5 redundant places.
[2023-10-26 08:59:55,016 INFO  L231             Difference]: Finished difference. Result has 365 places, 4643 transitions, 103033 flow
[2023-10-26 08:59:55,031 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=78715, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3827, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=103033, PETRI_PLACES=365, PETRI_TRANSITIONS=4643}
[2023-10-26 08:59:55,032 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 308 predicate places.
[2023-10-26 08:59:55,032 INFO  L495      AbstractCegarLoop]: Abstraction has has 365 places, 4643 transitions, 103033 flow
[2023-10-26 08:59:55,032 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 56.27272727272727) internal successors, (1238), 22 states have internal predecessors, (1238), 0 states have call successors, (0), 0 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-26 08:59:55,033 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:59:55,033 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:59:55,039 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2023-10-26 08:59:55,237 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:59:55,237 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:59:55,237 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:59:55,238 INFO  L85        PathProgramCache]: Analyzing trace with hash -1987894726, now seen corresponding path program 7 times
[2023-10-26 08:59:55,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:59:55,238 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562190320]
[2023-10-26 08:59:55,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:59:55,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:59:55,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:59:55,969 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-26 08:59:55,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:59:55,970 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562190320]
[2023-10-26 08:59:55,970 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562190320] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:59:55,970 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463263796]
[2023-10-26 08:59:55,970 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2023-10-26 08:59:55,970 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:59:55,970 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:59:55,971 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:59:55,996 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-10-26 08:59:56,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:59:56,112 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-10-26 08:59:56,114 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:59:56,137 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 60 treesize of output 58
[2023-10-26 08:59:56,297 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 08:59:56,297 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-26 08:59:56,362 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-26 08:59:56,380 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:59:56,388 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-26 08:59:56,398 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:59:56,398 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:59:56,415 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:59:56,415 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:59:56,430 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-26 08:59:56,440 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-26 08:59:56,440 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:59:56,463 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1495 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1495 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1495 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1495 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2023-10-26 08:59:56,610 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1495 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1495 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1495 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1495 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-26 08:59:56,632 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1495 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1495 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1495 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1495 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1495) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2023-10-26 08:59:56,648 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:59:56,649 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-26 08:59:56,654 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:59:56,655 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32
[2023-10-26 08:59:56,689 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:59:56,689 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-26 08:59:56,693 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:59:56,694 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-26 08:59:56,701 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:59:56,701 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-26 08:59:56,798 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem10#1.base_69| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem10#1.base_69| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_1486 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem10#1.base_69| v_ArrVal_1486) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) is different from false
[2023-10-26 08:59:56,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:59:56,800 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463263796] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:59:56,800 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:59:56,800 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20
[2023-10-26 08:59:56,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498776263]
[2023-10-26 08:59:56,800 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:59:56,800 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2023-10-26 08:59:56,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:59:56,801 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2023-10-26 08:59:56,801 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=244, Unknown=9, NotChecked=140, Total=462
[2023-10-26 08:59:56,850 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-10-26 08:59:56,851 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 4643 transitions, 103033 flow. Second operand  has 22 states, 22 states have (on average 59.27272727272727) internal successors, (1304), 22 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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-26 08:59:56,851 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:59:56,851 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-10-26 08:59:56,851 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:59:59,286 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-26 09:00:59,758 INFO  L130       PetriNetUnfolder]: 40708/66506 cut-off events.
[2023-10-26 09:00:59,758 INFO  L131       PetriNetUnfolder]: For 1675639/1675639 co-relation queries the response was YES.
[2023-10-26 09:01:00,683 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 688899 conditions, 66506 events. 40708/66506 cut-off events. For 1675639/1675639 co-relation queries the response was YES. Maximal size of possible extension queue 1847. Compared 530697 event pairs, 4330 based on Foata normal form. 269/64375 useless extension candidates. Maximal degree in co-relation 669634. Up to 50279 conditions per place. 
[2023-10-26 09:01:01,247 INFO  L137   encePairwiseOnDemand]: 156/191 looper letters, 5484 selfloop transitions, 622 changer transitions 3/6111 dead transitions.
[2023-10-26 09:01:01,248 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 6111 transitions, 142892 flow
[2023-10-26 09:01:01,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2023-10-26 09:01:01,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2023-10-26 09:01:01,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1279 transitions.
[2023-10-26 09:01:01,255 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3939020634431783
[2023-10-26 09:01:01,255 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1279 transitions.
[2023-10-26 09:01:01,256 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1279 transitions.
[2023-10-26 09:01:01,257 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:01:01,257 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1279 transitions.
[2023-10-26 09:01:01,261 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 75.23529411764706) internal successors, (1279), 17 states have internal predecessors, (1279), 0 states have call successors, (0), 0 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-26 09:01:01,285 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 191.0) internal successors, (3438), 18 states have internal predecessors, (3438), 0 states have call successors, (0), 0 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-26 09:01:01,286 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 191.0) internal successors, (3438), 18 states have internal predecessors, (3438), 0 states have call successors, (0), 0 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-26 09:01:01,286 INFO  L175             Difference]: Start difference. First operand has 365 places, 4643 transitions, 103033 flow. Second operand 17 states and 1279 transitions.
[2023-10-26 09:01:01,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 6111 transitions, 142892 flow
[2023-10-26 09:03:05,703 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 6111 transitions, 140499 flow, removed 1152 selfloop flow, removed 4 redundant places.
[2023-10-26 09:03:05,805 INFO  L231             Difference]: Finished difference. Result has 388 places, 5232 transitions, 116424 flow
[2023-10-26 09:03:05,808 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=101694, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=116424, PETRI_PLACES=388, PETRI_TRANSITIONS=5232}
[2023-10-26 09:03:05,809 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 331 predicate places.
[2023-10-26 09:03:05,810 INFO  L495      AbstractCegarLoop]: Abstraction has has 388 places, 5232 transitions, 116424 flow
[2023-10-26 09:03:05,810 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 59.27272727272727) internal successors, (1304), 22 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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-26 09:03:05,810 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:03:05,810 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:03:05,816 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2023-10-26 09:03:06,015 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:03:06,015 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 09:03:06,016 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:03:06,016 INFO  L85        PathProgramCache]: Analyzing trace with hash -1987997026, now seen corresponding path program 8 times
[2023-10-26 09:03:06,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:03:06,017 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88325461]
[2023-10-26 09:03:06,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:03:06,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:03:06,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:03:06,730 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-26 09:03:06,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:03:06,730 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88325461]
[2023-10-26 09:03:06,730 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88325461] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 09:03:06,730 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977399685]
[2023-10-26 09:03:06,730 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 09:03:06,730 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:03:06,731 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:03:06,732 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 09:03:06,771 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2023-10-26 09:03:07,130 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 09:03:07,130 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 09:03:07,132 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 42 conjunts are in the unsatisfiable core
[2023-10-26 09:03:07,134 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 09:03:07,141 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118
[2023-10-26 09:03:07,405 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-26 09:03:07,405 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-26 09:03:07,531 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-26 09:03:07,633 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 09:03:07,691 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:03:07,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 09:03:07,735 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:03:07,737 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:03:07,738 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 09:03:07,793 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2023-10-26 09:03:07,837 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:03:07,838 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:03:07,839 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 09:03:07,841 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 09:03:07,841 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 09:03:07,884 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-26 09:03:07,884 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 09:03:08,017 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1599) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1599 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1599) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1599 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1599) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-26 09:03:08,033 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1599 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1599) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1599 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1599) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1599 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1599) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-10-26 09:03:08,047 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 09:03:08,048 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41
[2023-10-26 09:03:08,053 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 09:03:08,054 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 52 treesize of output 24
[2023-10-26 09:03:08,061 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2023-10-26 09:03:08,061 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 3 case distinctions, treesize of input 30 treesize of output 1
[2023-10-26 09:03:08,066 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2023-10-26 09:03:08,066 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 3 case distinctions, treesize of input 28 treesize of output 1
[2023-10-26 09:03:08,094 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1592) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2023-10-26 09:03:08,121 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem10#1.base_71| Int)) (or (forall ((v_ArrVal_1592 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem10#1.base_71| v_ArrVal_1592) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) (not (<= |v_ULTIMATE.start_main_#t~mem10#1.base_71| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2023-10-26 09:03:08,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 09:03:08,122 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977399685] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 09:03:08,122 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 09:03:08,122 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 26
[2023-10-26 09:03:08,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955719334]
[2023-10-26 09:03:08,123 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 09:03:08,123 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-10-26 09:03:08,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:03:08,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-10-26 09:03:08,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=457, Unknown=15, NotChecked=188, Total=756
[2023-10-26 09:03:08,337 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 191
[2023-10-26 09:03:08,338 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 5232 transitions, 116424 flow. Second operand  has 28 states, 28 states have (on average 59.214285714285715) internal successors, (1658), 28 states have internal predecessors, (1658), 0 states have call successors, (0), 0 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-26 09:03:08,338 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:03:08,338 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 191
[2023-10-26 09:03:08,338 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
