./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-tid.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-tid.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 cfad0b2f92a7cfe2a62ca103d0ef6e2a604561400f9f39e859a6074e6dd658e5
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-26 08:51:16,789 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-26 08:51:16,791 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-26 08:51:16,864 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-26 08:51:16,865 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-26 08:51:16,869 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-26 08:51:16,870 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-26 08:51:16,873 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-26 08:51:16,875 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-26 08:51:16,879 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-26 08:51:16,880 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-26 08:51:16,882 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-26 08:51:16,882 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-26 08:51:16,884 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-26 08:51:16,885 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-26 08:51:16,903 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-26 08:51:16,904 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-26 08:51:16,905 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-26 08:51:16,906 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-26 08:51:16,913 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-26 08:51:16,914 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-26 08:51:16,916 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-26 08:51:16,917 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-26 08:51:16,917 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-26 08:51:16,921 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-26 08:51:16,921 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-26 08:51:16,921 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-26 08:51:16,923 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-26 08:51:16,923 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-26 08:51:16,924 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-26 08:51:16,925 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-26 08:51:16,925 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-26 08:51:16,927 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-26 08:51:16,928 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-26 08:51:16,928 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-26 08:51:16,929 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-26 08:51:16,929 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-26 08:51:16,945 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-26 08:51:16,945 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-26 08:51:16,947 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-26 08:51:16,947 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-26 08:51:16,948 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,991 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-26 08:51:16,991 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-26 08:51:16,992 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-26 08:51:16,992 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-26 08:51:16,993 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-26 08:51:16,993 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-26 08:51:16,993 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-26 08:51:16,994 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-26 08:51:16,994 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-26 08:51:16,994 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-26 08:51:16,995 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-26 08:51:16,995 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-26 08:51:16,995 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-26 08:51:16,995 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-26 08:51:16,995 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-26 08:51:16,996 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-26 08:51:16,996 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-26 08:51:16,996 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-26 08:51:16,996 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-26 08:51:16,996 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-26 08:51:16,996 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-26 08:51:16,996 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-26 08:51:16,997 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-26 08:51:16,997 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-26 08:51:16,997 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-26 08:51:16,997 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-26 08:51:16,997 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:51:16,997 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-26 08:51:16,998 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-26 08:51:16,998 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-26 08:51:16,998 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-26 08:51:16,998 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-26 08:51:16,999 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-26 08:51:16,999 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-26 08:51:16,999 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-26 08:51:16,999 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-26 08:51:17,000 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-26 08:51:17,000 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 -> cfad0b2f92a7cfe2a62ca103d0ef6e2a604561400f9f39e859a6074e6dd658e5
[2023-10-26 08:51:17,456 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 08:51:17,498 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 08:51:17,500 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 08:51:17,501 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 08:51:17,501 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 08:51:17,502 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2023-10-26 08:51:19,335 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 08:51:19,772 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 08:51:19,784 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2023-10-26 08:51:19,815 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/456ebc5d2/7485373b3d754997bf467d8a81696867/FLAG0443154a2
[2023-10-26 08:51:19,840 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/456ebc5d2/7485373b3d754997bf467d8a81696867
[2023-10-26 08:51:19,843 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 08:51:19,844 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 08:51:19,850 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 08:51:19,850 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 08:51:19,853 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 08:51:19,870 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,872 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af2548c 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,872 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,879 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 08:51:19,960 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 08:51:20,229 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:51:20,601 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:51:20,625 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 08:51:20,656 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:51:20,705 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:51:20,796 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 08:51:20,797 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,797 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 08:51:20,798 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 08:51:20,798 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 08:51:20,798 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 08:51:20,804 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,841 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,906 INFO  L138                Inliner]: procedures = 264, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74
[2023-10-26 08:51:20,906 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 08:51:20,907 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 08:51:20,907 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 08:51:20,907 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 08:51:20,915 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,916 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,929 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,945 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,955 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,962 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,965 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,971 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,974 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 08:51:20,977 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 08:51:20,977 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 08:51:20,977 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 08:51:20,978 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,998 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:51:21,006 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:21,034 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:21,098 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:21,110 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-26 08:51:21,110 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 08:51:21,110 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-26 08:51:21,113 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-26 08:51:21,113 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-26 08:51:21,113 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2023-10-26 08:51:21,113 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 08:51:21,113 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 08:51:21,113 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 08:51:21,114 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 08:51:21,115 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,361 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 08:51:21,379 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 08:51:21,787 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 08:51:21,797 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 08:51:21,804 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 08:51:21,807 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,817 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 08:51:21,819 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 08:51:21,820 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 08:51:21,823 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 08:51:21,824 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,824 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd28bd8 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,825 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,826 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd28bd8 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,827 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,829 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i
[2023-10-26 08:51:21,856 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 08:51:21,865 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 08:51:21,881 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2023-10-26 08:51:21,881 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 08:51:21,990 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-26 08:51:22,044 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2023-10-26 08:51:22,161 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2023-10-26 08:51:22,169 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:51:22,174 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2023-10-26 08:51:22,174 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 210 flow
[2023-10-26 08:51:22,180 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 210 flow
[2023-10-26 08:51:22,187 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:51:22,213 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 101 transitions, 210 flow
[2023-10-26 08:51:22,218 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 101 transitions, 210 flow
[2023-10-26 08:51:22,218 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2023-10-26 08:51:22,310 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2023-10-26 08:51:22,311 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:51:22,311 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2023-10-26 08:51:22,320 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1410
[2023-10-26 08:51:25,404 INFO  L134        LiptonReduction]: Checked pairs total: 5574
[2023-10-26 08:51:25,407 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2023-10-26 08:51:25,440 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:51:25,446 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;@357c2713, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:51:25,447 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-10-26 08:51:25,452 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2023-10-26 08:51:25,452 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:51:25,453 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:25,454 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:25,462 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:51:25,466 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:25,467 INFO  L85        PathProgramCache]: Analyzing trace with hash -1050340217, now seen corresponding path program 1 times
[2023-10-26 08:51:25,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:25,485 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580832720]
[2023-10-26 08:51:25,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:25,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:25,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:26,471 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,473 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:26,473 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580832720]
[2023-10-26 08:51:26,474 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580832720] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:26,474 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:26,474 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:26,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197849216]
[2023-10-26 08:51:26,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:26,484 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:26,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:26,524 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:26,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:26,829 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 68 out of 176
[2023-10-26 08:51:26,832 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 84 flow. Second operand  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 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,834 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:26,834 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 176
[2023-10-26 08:51:26,835 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:27,106 INFO  L130       PetriNetUnfolder]: 135/363 cut-off events.
[2023-10-26 08:51:27,107 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:51:27,109 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 691 conditions, 363 events. 135/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1596 event pairs, 91 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 632. Up to 281 conditions per place. 
[2023-10-26 08:51:27,114 INFO  L137   encePairwiseOnDemand]: 165/176 looper letters, 37 selfloop transitions, 21 changer transitions 0/65 dead transitions.
[2023-10-26 08:51:27,114 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 254 flow
[2023-10-26 08:51:27,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:27,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:27,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions.
[2023-10-26 08:51:27,149 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4431818181818182
[2023-10-26 08:51:27,150 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 468 transitions.
[2023-10-26 08:51:27,151 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 468 transitions.
[2023-10-26 08:51:27,154 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:27,158 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 468 transitions.
[2023-10-26 08:51:27,173 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 0 states have call successors, (0), 0 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,180 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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,181 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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,198 INFO  L175             Difference]: Start difference. First operand has 40 places, 38 transitions, 84 flow. Second operand 6 states and 468 transitions.
[2023-10-26 08:51:27,199 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 254 flow
[2023-10-26 08:51:27,202 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:27,204 INFO  L231             Difference]: Finished difference. Result has 48 places, 57 transitions, 206 flow
[2023-10-26 08:51:27,206 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=48, PETRI_TRANSITIONS=57}
[2023-10-26 08:51:27,209 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places.
[2023-10-26 08:51:27,209 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 57 transitions, 206 flow
[2023-10-26 08:51:27,210 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 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,210 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:27,210 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:27,210 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-26 08:51:27,211 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:51:27,212 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:27,212 INFO  L85        PathProgramCache]: Analyzing trace with hash 647833824, now seen corresponding path program 1 times
[2023-10-26 08:51:27,213 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:27,213 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045104009]
[2023-10-26 08:51:27,215 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:27,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:27,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:27,352 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,352 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:27,353 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045104009]
[2023-10-26 08:51:27,353 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045104009] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:27,354 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:27,354 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:51:27,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238632524]
[2023-10-26 08:51:27,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:27,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:51:27,359 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:27,359 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:51:27,360 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:51:27,469 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 176
[2023-10-26 08:51:27,470 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 57 transitions, 206 flow. Second operand  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 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,470 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:27,470 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 176
[2023-10-26 08:51:27,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:27,589 INFO  L130       PetriNetUnfolder]: 55/234 cut-off events.
[2023-10-26 08:51:27,590 INFO  L131       PetriNetUnfolder]: For 28/36 co-relation queries the response was YES.
[2023-10-26 08:51:27,593 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 489 conditions, 234 events. 55/234 cut-off events. For 28/36 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 984 event pairs, 3 based on Foata normal form. 2/210 useless extension candidates. Maximal degree in co-relation 421. Up to 79 conditions per place. 
[2023-10-26 08:51:27,594 INFO  L137   encePairwiseOnDemand]: 172/176 looper letters, 25 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2023-10-26 08:51:27,594 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 290 flow
[2023-10-26 08:51:27,595 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:51:27,595 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:51:27,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions.
[2023-10-26 08:51:27,596 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.546875
[2023-10-26 08:51:27,596 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 385 transitions.
[2023-10-26 08:51:27,596 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 385 transitions.
[2023-10-26 08:51:27,596 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:27,597 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 385 transitions.
[2023-10-26 08:51:27,598 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 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,599 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:27,600 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:27,600 INFO  L175             Difference]: Start difference. First operand has 48 places, 57 transitions, 206 flow. Second operand 4 states and 385 transitions.
[2023-10-26 08:51:27,600 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 290 flow
[2023-10-26 08:51:27,604 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:27,605 INFO  L231             Difference]: Finished difference. Result has 53 places, 57 transitions, 216 flow
[2023-10-26 08:51:27,610 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=57}
[2023-10-26 08:51:27,611 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places.
[2023-10-26 08:51:27,611 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 216 flow
[2023-10-26 08:51:27,617 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 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,617 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:27,617 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:27,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-26 08:51:27,618 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:51:27,619 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:27,619 INFO  L85        PathProgramCache]: Analyzing trace with hash -516340613, now seen corresponding path program 1 times
[2023-10-26 08:51:27,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:27,620 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088907659]
[2023-10-26 08:51:27,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:27,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:27,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:28,105 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,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:28,105 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088907659]
[2023-10-26 08:51:28,106 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088907659] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:28,107 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:28,107 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:28,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332612704]
[2023-10-26 08:51:28,108 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:28,108 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:28,108 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:28,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:28,109 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:28,335 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 176
[2023-10-26 08:51:28,336 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 216 flow. Second operand  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 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,336 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:28,336 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 176
[2023-10-26 08:51:28,336 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:28,852 INFO  L130       PetriNetUnfolder]: 193/497 cut-off events.
[2023-10-26 08:51:28,853 INFO  L131       PetriNetUnfolder]: For 111/115 co-relation queries the response was YES.
[2023-10-26 08:51:28,854 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 497 events. 193/497 cut-off events. For 111/115 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2299 event pairs, 39 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 1182. Up to 339 conditions per place. 
[2023-10-26 08:51:28,855 INFO  L137   encePairwiseOnDemand]: 158/176 looper letters, 68 selfloop transitions, 57 changer transitions 5/137 dead transitions.
[2023-10-26 08:51:28,856 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 137 transitions, 714 flow
[2023-10-26 08:51:28,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:28,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:28,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions.
[2023-10-26 08:51:28,871 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5085227272727273
[2023-10-26 08:51:28,871 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 537 transitions.
[2023-10-26 08:51:28,871 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions.
[2023-10-26 08:51:28,872 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:28,872 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions.
[2023-10-26 08:51:28,873 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 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,874 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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,875 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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,875 INFO  L175             Difference]: Start difference. First operand has 53 places, 57 transitions, 216 flow. Second operand 6 states and 537 transitions.
[2023-10-26 08:51:28,875 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 137 transitions, 714 flow
[2023-10-26 08:51:28,880 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 137 transitions, 692 flow, removed 5 selfloop flow, removed 3 redundant places.
[2023-10-26 08:51:28,883 INFO  L231             Difference]: Finished difference. Result has 58 places, 108 transitions, 562 flow
[2023-10-26 08:51:28,883 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=58, PETRI_TRANSITIONS=108}
[2023-10-26 08:51:28,884 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places.
[2023-10-26 08:51:28,884 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 108 transitions, 562 flow
[2023-10-26 08:51:28,885 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 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,885 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:28,885 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:28,885 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-26 08:51:28,900 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:51:28,901 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:28,901 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831922026, now seen corresponding path program 1 times
[2023-10-26 08:51:28,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:28,902 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593952334]
[2023-10-26 08:51:28,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:28,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:28,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:29,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:51:29,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:29,385 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593952334]
[2023-10-26 08:51:29,385 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593952334] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:29,385 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:29,385 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:29,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437403482]
[2023-10-26 08:51:29,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:29,386 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:29,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:29,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:29,388 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:29,655 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 176
[2023-10-26 08:51:29,656 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 108 transitions, 562 flow. Second operand  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 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,656 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:29,656 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 176
[2023-10-26 08:51:29,656 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:29,871 INFO  L130       PetriNetUnfolder]: 200/560 cut-off events.
[2023-10-26 08:51:29,871 INFO  L131       PetriNetUnfolder]: For 335/347 co-relation queries the response was YES.
[2023-10-26 08:51:29,878 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 560 events. 200/560 cut-off events. For 335/347 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2835 event pairs, 43 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 1725. Up to 369 conditions per place. 
[2023-10-26 08:51:29,883 INFO  L137   encePairwiseOnDemand]: 165/176 looper letters, 87 selfloop transitions, 29 changer transitions 0/142 dead transitions.
[2023-10-26 08:51:29,884 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 142 transitions, 968 flow
[2023-10-26 08:51:29,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:29,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:29,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions.
[2023-10-26 08:51:29,886 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4630681818181818
[2023-10-26 08:51:29,886 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 489 transitions.
[2023-10-26 08:51:29,886 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 489 transitions.
[2023-10-26 08:51:29,887 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:29,888 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 489 transitions.
[2023-10-26 08:51:29,889 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 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,905 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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,906 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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,906 INFO  L175             Difference]: Start difference. First operand has 58 places, 108 transitions, 562 flow. Second operand 6 states and 489 transitions.
[2023-10-26 08:51:29,906 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 142 transitions, 968 flow
[2023-10-26 08:51:29,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 932 flow, removed 18 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:29,914 INFO  L231             Difference]: Finished difference. Result has 67 places, 132 transitions, 808 flow
[2023-10-26 08:51:29,914 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=67, PETRI_TRANSITIONS=132}
[2023-10-26 08:51:29,916 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places.
[2023-10-26 08:51:29,916 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 132 transitions, 808 flow
[2023-10-26 08:51:29,916 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 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,916 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:29,917 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-26 08:51:29,917 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-26 08:51:29,917 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:51:29,917 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:29,918 INFO  L85        PathProgramCache]: Analyzing trace with hash -2007496268, now seen corresponding path program 1 times
[2023-10-26 08:51:29,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:29,918 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76029751]
[2023-10-26 08:51:29,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:29,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:29,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:51:29,977 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:51:29,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:51:30,039 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:51:30,039 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:51:30,041 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-10-26 08:51:30,042 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-10-26 08:51:30,042 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-10-26 08:51:30,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-10-26 08:51:30,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-10-26 08:51:30,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-10-26 08:51:30,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-10-26 08:51:30,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-26 08:51:30,044 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-10-26 08:51:30,054 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:51:30,054 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-26 08:51:30,103 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-26 08:51:30,107 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2023-10-26 08:51:30,146 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2023-10-26 08:51:30,152 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:51:30,153 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2023-10-26 08:51:30,153 INFO  L82        GeneralOperation]: Start removeDead. Operand has 118 places, 118 transitions, 254 flow
[2023-10-26 08:51:30,154 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 118 places, 118 transitions, 254 flow
[2023-10-26 08:51:30,154 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:51:30,154 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 118 transitions, 254 flow
[2023-10-26 08:51:30,154 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 118 transitions, 254 flow
[2023-10-26 08:51:30,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2023-10-26 08:51:30,206 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2023-10-26 08:51:30,206 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:51:30,207 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2023-10-26 08:51:30,210 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4200
[2023-10-26 08:51:32,716 INFO  L134        LiptonReduction]: Checked pairs total: 17458
[2023-10-26 08:51:32,716 INFO  L136        LiptonReduction]: Total number of compositions: 74
[2023-10-26 08:51:32,718 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:51:32,718 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;@357c2713, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:51:32,718 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-26 08:51:32,720 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2023-10-26 08:51:32,720 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:51:32,720 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:32,720 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:32,720 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:32,720 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:32,720 INFO  L85        PathProgramCache]: Analyzing trace with hash 1843145426, now seen corresponding path program 1 times
[2023-10-26 08:51:32,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:32,721 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249009124]
[2023-10-26 08:51:32,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:32,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:32,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:32,964 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,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:32,965 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249009124]
[2023-10-26 08:51:32,965 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249009124] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:32,965 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:32,966 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:32,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825162470]
[2023-10-26 08:51:32,967 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:32,968 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:32,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:32,968 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:32,968 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:33,211 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 192
[2023-10-26 08:51:33,211 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 126 flow. Second operand  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 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,212 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:33,212 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 192
[2023-10-26 08:51:33,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:34,087 INFO  L130       PetriNetUnfolder]: 2299/4146 cut-off events.
[2023-10-26 08:51:34,095 INFO  L131       PetriNetUnfolder]: For 58/58 co-relation queries the response was YES.
[2023-10-26 08:51:34,100 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8058 conditions, 4146 events. 2299/4146 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 23085 event pairs, 1715 based on Foata normal form. 0/3930 useless extension candidates. Maximal degree in co-relation 1116. Up to 3508 conditions per place. 
[2023-10-26 08:51:34,127 INFO  L137   encePairwiseOnDemand]: 178/192 looper letters, 58 selfloop transitions, 37 changer transitions 0/106 dead transitions.
[2023-10-26 08:51:34,128 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 420 flow
[2023-10-26 08:51:34,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:34,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:34,137 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions.
[2023-10-26 08:51:34,137 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4947916666666667
[2023-10-26 08:51:34,138 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 570 transitions.
[2023-10-26 08:51:34,138 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions.
[2023-10-26 08:51:34,138 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:34,138 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions.
[2023-10-26 08:51:34,139 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 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,142 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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,143 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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,143 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 570 transitions.
[2023-10-26 08:51:34,143 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 420 flow
[2023-10-26 08:51:34,144 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:34,162 INFO  L231             Difference]: Finished difference. Result has 66 places, 90 transitions, 338 flow
[2023-10-26 08:51:34,163 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=66, PETRI_TRANSITIONS=90}
[2023-10-26 08:51:34,166 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2023-10-26 08:51:34,166 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 338 flow
[2023-10-26 08:51:34,166 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 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,166 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:34,167 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:34,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-26 08:51:34,167 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:34,168 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:34,168 INFO  L85        PathProgramCache]: Analyzing trace with hash 37653776, now seen corresponding path program 1 times
[2023-10-26 08:51:34,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:34,168 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887434913]
[2023-10-26 08:51:34,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:34,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:34,176 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:34,228 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,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:34,229 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887434913]
[2023-10-26 08:51:34,231 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887434913] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:34,232 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:34,232 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:51:34,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759111246]
[2023-10-26 08:51:34,232 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:34,233 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:51:34,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:34,233 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:51:34,234 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:51:34,342 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 192
[2023-10-26 08:51:34,343 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 338 flow. Second operand  has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 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,343 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:34,343 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 192
[2023-10-26 08:51:34,343 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:34,708 INFO  L130       PetriNetUnfolder]: 831/2045 cut-off events.
[2023-10-26 08:51:34,721 INFO  L131       PetriNetUnfolder]: For 351/391 co-relation queries the response was YES.
[2023-10-26 08:51:34,734 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4465 conditions, 2045 events. 831/2045 cut-off events. For 351/391 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13313 event pairs, 354 based on Foata normal form. 1/1904 useless extension candidates. Maximal degree in co-relation 2180. Up to 890 conditions per place. 
[2023-10-26 08:51:34,747 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 31 selfloop transitions, 2 changer transitions 2/100 dead transitions.
[2023-10-26 08:51:34,747 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 436 flow
[2023-10-26 08:51:34,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:51:34,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:51:34,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions.
[2023-10-26 08:51:34,749 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.58203125
[2023-10-26 08:51:34,749 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 447 transitions.
[2023-10-26 08:51:34,749 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions.
[2023-10-26 08:51:34,750 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:34,750 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions.
[2023-10-26 08:51:34,751 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 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,752 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 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,765 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 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,766 INFO  L175             Difference]: Start difference. First operand has 66 places, 90 transitions, 338 flow. Second operand 4 states and 447 transitions.
[2023-10-26 08:51:34,766 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 436 flow
[2023-10-26 08:51:34,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 436 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:34,772 INFO  L231             Difference]: Finished difference. Result has 71 places, 91 transitions, 352 flow
[2023-10-26 08:51:34,772 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=71, PETRI_TRANSITIONS=91}
[2023-10-26 08:51:34,774 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places.
[2023-10-26 08:51:34,774 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 352 flow
[2023-10-26 08:51:34,774 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 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,775 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:34,775 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:34,775 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-26 08:51:34,777 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:34,777 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:34,777 INFO  L85        PathProgramCache]: Analyzing trace with hash -1297270937, now seen corresponding path program 1 times
[2023-10-26 08:51:34,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:34,780 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543487096]
[2023-10-26 08:51:34,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:34,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:34,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:35,144 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:35,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:35,145 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543487096]
[2023-10-26 08:51:35,145 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543487096] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:35,145 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:35,145 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:35,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7495485]
[2023-10-26 08:51:35,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:35,146 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:35,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:35,147 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:35,147 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:35,340 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 192
[2023-10-26 08:51:35,341 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 352 flow. Second operand  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 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,341 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:35,341 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 192
[2023-10-26 08:51:35,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:36,807 INFO  L130       PetriNetUnfolder]: 3649/6392 cut-off events.
[2023-10-26 08:51:36,825 INFO  L131       PetriNetUnfolder]: For 1465/1507 co-relation queries the response was YES.
[2023-10-26 08:51:36,835 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16449 conditions, 6392 events. 3649/6392 cut-off events. For 1465/1507 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 38348 event pairs, 1337 based on Foata normal form. 0/6111 useless extension candidates. Maximal degree in co-relation 16362. Up to 4916 conditions per place. 
[2023-10-26 08:51:36,875 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 131 selfloop transitions, 89 changer transitions 0/231 dead transitions.
[2023-10-26 08:51:36,875 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 231 transitions, 1222 flow
[2023-10-26 08:51:36,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:36,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:36,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions.
[2023-10-26 08:51:36,892 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2023-10-26 08:51:36,898 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 672 transitions.
[2023-10-26 08:51:36,899 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions.
[2023-10-26 08:51:36,899 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:36,899 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions.
[2023-10-26 08:51:36,901 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 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,902 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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,902 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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,903 INFO  L175             Difference]: Start difference. First operand has 71 places, 91 transitions, 352 flow. Second operand 6 states and 672 transitions.
[2023-10-26 08:51:36,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 231 transitions, 1222 flow
[2023-10-26 08:51:36,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 231 transitions, 1206 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-10-26 08:51:36,921 INFO  L231             Difference]: Finished difference. Result has 77 places, 175 transitions, 910 flow
[2023-10-26 08:51:36,922 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=77, PETRI_TRANSITIONS=175}
[2023-10-26 08:51:36,923 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2023-10-26 08:51:36,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 175 transitions, 910 flow
[2023-10-26 08:51:36,934 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 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,934 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:36,935 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:36,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-26 08:51:36,935 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:36,935 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:36,936 INFO  L85        PathProgramCache]: Analyzing trace with hash 490022662, now seen corresponding path program 1 times
[2023-10-26 08:51:36,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:36,936 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531187708]
[2023-10-26 08:51:36,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:36,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:36,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:37,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:51:37,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:37,253 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531187708]
[2023-10-26 08:51:37,253 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531187708] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:51:37,254 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:51:37,254 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:51:37,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294908984]
[2023-10-26 08:51:37,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:51:37,255 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:51:37,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:37,255 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:51:37,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:51:37,507 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 192
[2023-10-26 08:51:37,507 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 175 transitions, 910 flow. Second operand  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 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,508 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:37,508 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 192
[2023-10-26 08:51:37,508 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:39,114 INFO  L130       PetriNetUnfolder]: 4197/7805 cut-off events.
[2023-10-26 08:51:39,123 INFO  L131       PetriNetUnfolder]: For 6317/6605 co-relation queries the response was YES.
[2023-10-26 08:51:39,137 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25509 conditions, 7805 events. 4197/7805 cut-off events. For 6317/6605 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 51218 event pairs, 1254 based on Foata normal form. 11/7497 useless extension candidates. Maximal degree in co-relation 20095. Up to 5830 conditions per place. 
[2023-10-26 08:51:39,193 INFO  L137   encePairwiseOnDemand]: 172/192 looper letters, 160 selfloop transitions, 69 changer transitions 0/258 dead transitions.
[2023-10-26 08:51:39,209 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 258 transitions, 1801 flow
[2023-10-26 08:51:39,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:51:39,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:51:39,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions.
[2023-10-26 08:51:39,211 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5243055555555556
[2023-10-26 08:51:39,211 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 604 transitions.
[2023-10-26 08:51:39,211 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions.
[2023-10-26 08:51:39,212 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:39,212 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions.
[2023-10-26 08:51:39,213 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:51:39,214 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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,215 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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,227 INFO  L175             Difference]: Start difference. First operand has 77 places, 175 transitions, 910 flow. Second operand 6 states and 604 transitions.
[2023-10-26 08:51:39,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 258 transitions, 1801 flow
[2023-10-26 08:51:39,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 258 transitions, 1701 flow, removed 50 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:39,312 INFO  L231             Difference]: Finished difference. Result has 87 places, 235 transitions, 1526 flow
[2023-10-26 08:51:39,313 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1526, PETRI_PLACES=87, PETRI_TRANSITIONS=235}
[2023-10-26 08:51:39,314 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places.
[2023-10-26 08:51:39,314 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 235 transitions, 1526 flow
[2023-10-26 08:51:39,315 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 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,315 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:39,316 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:39,316 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-26 08:51:39,316 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:39,316 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:39,316 INFO  L85        PathProgramCache]: Analyzing trace with hash -1420041874, now seen corresponding path program 1 times
[2023-10-26 08:51:39,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:39,317 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063309488]
[2023-10-26 08:51:39,317 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:39,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:39,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:39,847 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:39,848 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:39,848 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063309488]
[2023-10-26 08:51:39,848 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063309488] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:39,848 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104854276]
[2023-10-26 08:51:39,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:39,849 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:39,849 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:39,867 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:39,909 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,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:40,042 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-26 08:51:40,045 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:40,119 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:51:40,158 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:51:40,159 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 11 treesize of output 11
[2023-10-26 08:51:40,202 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:51:40,227 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:51:40,267 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:40,267 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:51:40,317 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:40,317 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:51:40,419 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:51:40,433 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:40,433 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:40,647 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:40,647 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [104854276] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:40,647 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:40,648 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2023-10-26 08:51:40,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764835421]
[2023-10-26 08:51:40,650 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:40,650 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-10-26 08:51:40,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:40,651 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-10-26 08:51:40,651 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2023-10-26 08:51:41,477 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-10-26 08:51:41,478 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 235 transitions, 1526 flow. Second operand  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 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,478 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:41,478 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-10-26 08:51:41,478 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:43,998 INFO  L130       PetriNetUnfolder]: 4656/8478 cut-off events.
[2023-10-26 08:51:43,998 INFO  L131       PetriNetUnfolder]: For 12874/13089 co-relation queries the response was YES.
[2023-10-26 08:51:44,034 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32369 conditions, 8478 events. 4656/8478 cut-off events. For 12874/13089 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 54154 event pairs, 1418 based on Foata normal form. 0/8147 useless extension candidates. Maximal degree in co-relation 22476. Up to 6478 conditions per place. 
[2023-10-26 08:51:44,108 INFO  L137   encePairwiseOnDemand]: 172/192 looper letters, 329 selfloop transitions, 74 changer transitions 0/415 dead transitions.
[2023-10-26 08:51:44,109 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 415 transitions, 3510 flow
[2023-10-26 08:51:44,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-26 08:51:44,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-26 08:51:44,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions.
[2023-10-26 08:51:44,126 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.45928030303030304
[2023-10-26 08:51:44,126 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 970 transitions.
[2023-10-26 08:51:44,126 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions.
[2023-10-26 08:51:44,127 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:44,127 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions.
[2023-10-26 08:51:44,129 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 0 states have call successors, (0), 0 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:44,132 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 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:44,132 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 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:44,133 INFO  L175             Difference]: Start difference. First operand has 87 places, 235 transitions, 1526 flow. Second operand 11 states and 970 transitions.
[2023-10-26 08:51:44,133 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 415 transitions, 3510 flow
[2023-10-26 08:51:44,300 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 415 transitions, 3274 flow, removed 118 selfloop flow, removed 0 redundant places.
[2023-10-26 08:51:44,304 INFO  L231             Difference]: Finished difference. Result has 104 places, 271 transitions, 1985 flow
[2023-10-26 08:51:44,311 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1985, PETRI_PLACES=104, PETRI_TRANSITIONS=271}
[2023-10-26 08:51:44,312 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 47 predicate places.
[2023-10-26 08:51:44,313 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 271 transitions, 1985 flow
[2023-10-26 08:51:44,313 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 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:44,313 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:44,313 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:44,336 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-10-26 08:51:44,518 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-10-26 08:51:44,519 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:44,519 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:44,520 INFO  L85        PathProgramCache]: Analyzing trace with hash 668269293, now seen corresponding path program 1 times
[2023-10-26 08:51:44,520 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:44,520 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627808306]
[2023-10-26 08:51:44,520 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:44,520 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:44,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:45,049 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:45,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:45,049 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627808306]
[2023-10-26 08:51:45,049 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627808306] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:45,050 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880852596]
[2023-10-26 08:51:45,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:45,050 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:45,050 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:45,051 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:45,087 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:45,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:45,212 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-26 08:51:45,215 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:45,233 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:51:45,248 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:51:45,248 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 11 treesize of output 11
[2023-10-26 08:51:45,285 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 13 treesize of output 9
[2023-10-26 08:51:45,302 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 22
[2023-10-26 08:51:45,337 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:45,337 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 32 treesize of output 34
[2023-10-26 08:51:45,357 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:45,358 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 41 treesize of output 46
[2023-10-26 08:51:45,402 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 43 treesize of output 39
[2023-10-26 08:51:45,411 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:45,411 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:45,451 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))) is different from false
[2023-10-26 08:51:45,478 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (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_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))))) is different from false
[2023-10-26 08:51:45,510 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (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_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-10-26 08:51:45,620 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-26 08:51:45,620 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880852596] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:45,620 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:45,620 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13
[2023-10-26 08:51:45,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425332327]
[2023-10-26 08:51:45,621 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:45,621 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2023-10-26 08:51:45,621 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:45,621 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2023-10-26 08:51:45,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210
[2023-10-26 08:51:45,712 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 192
[2023-10-26 08:51:45,713 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 271 transitions, 1985 flow. Second operand  has 15 states, 15 states have (on average 59.666666666666664) internal successors, (895), 15 states have internal predecessors, (895), 0 states have call successors, (0), 0 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:45,713 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:45,713 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 192
[2023-10-26 08:51:45,713 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:50,000 INFO  L130       PetriNetUnfolder]: 9089/15228 cut-off events.
[2023-10-26 08:51:50,001 INFO  L131       PetriNetUnfolder]: For 26270/26274 co-relation queries the response was YES.
[2023-10-26 08:51:50,044 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61251 conditions, 15228 events. 9089/15228 cut-off events. For 26270/26274 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 98016 event pairs, 1448 based on Foata normal form. 4/13846 useless extension candidates. Maximal degree in co-relation 48685. Up to 7856 conditions per place. 
[2023-10-26 08:51:50,194 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 578 selfloop transitions, 532 changer transitions 9/1123 dead transitions.
[2023-10-26 08:51:50,209 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1123 transitions, 9568 flow
[2023-10-26 08:51:50,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-26 08:51:50,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-26 08:51:50,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1636 transitions.
[2023-10-26 08:51:50,213 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.44846491228070173
[2023-10-26 08:51:50,213 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1636 transitions.
[2023-10-26 08:51:50,214 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1636 transitions.
[2023-10-26 08:51:50,214 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:50,214 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1636 transitions.
[2023-10-26 08:51:50,217 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 86.10526315789474) internal successors, (1636), 19 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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:50,221 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 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:50,222 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 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:50,222 INFO  L175             Difference]: Start difference. First operand has 104 places, 271 transitions, 1985 flow. Second operand 19 states and 1636 transitions.
[2023-10-26 08:51:50,222 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 1123 transitions, 9568 flow
[2023-10-26 08:51:50,680 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 1123 transitions, 9556 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-10-26 08:51:50,693 INFO  L231             Difference]: Finished difference. Result has 131 places, 771 transitions, 7820 flow
[2023-10-26 08:51:50,694 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7820, PETRI_PLACES=131, PETRI_TRANSITIONS=771}
[2023-10-26 08:51:50,695 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 74 predicate places.
[2023-10-26 08:51:50,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 771 transitions, 7820 flow
[2023-10-26 08:51:50,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 59.666666666666664) internal successors, (895), 15 states have internal predecessors, (895), 0 states have call successors, (0), 0 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:50,696 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:50,696 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:50,704 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:50,901 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:50,902 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:50,902 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:50,902 INFO  L85        PathProgramCache]: Analyzing trace with hash -220900113, now seen corresponding path program 1 times
[2023-10-26 08:51:50,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:50,903 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255954966]
[2023-10-26 08:51:50,903 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:50,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:50,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:51,403 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:51,404 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:51,404 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255954966]
[2023-10-26 08:51:51,405 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255954966] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:51,405 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436687300]
[2023-10-26 08:51:51,405 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:51,405 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:51,405 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:51,418 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:51,449 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:51,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:51,565 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-26 08:51:51,573 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:51,576 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:51:51,597 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:51:51,598 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 11 treesize of output 11
[2023-10-26 08:51:51,620 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:51:51,646 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:51:51,656 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:51,657 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:51:51,675 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:51:51,676 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:51:51,708 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:51:51,717 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:51,717 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:51,879 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:51,881 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [436687300] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:51,881 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:51,881 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2023-10-26 08:51:51,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392940008]
[2023-10-26 08:51:51,881 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:51,882 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-10-26 08:51:51,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:51,883 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-10-26 08:51:51,883 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2023-10-26 08:51:52,549 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-10-26 08:51:52,550 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 771 transitions, 7820 flow. Second operand  has 12 states, 12 states have (on average 76.75) internal successors, (921), 12 states have internal predecessors, (921), 0 states have call successors, (0), 0 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:52,550 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:51:52,550 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-10-26 08:51:52,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:51:55,853 INFO  L130       PetriNetUnfolder]: 8746/15150 cut-off events.
[2023-10-26 08:51:55,853 INFO  L131       PetriNetUnfolder]: For 62441/63984 co-relation queries the response was YES.
[2023-10-26 08:51:55,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88265 conditions, 15150 events. 8746/15150 cut-off events. For 62441/63984 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 104065 event pairs, 626 based on Foata normal form. 179/14802 useless extension candidates. Maximal degree in co-relation 86284. Up to 10299 conditions per place. 
[2023-10-26 08:51:56,055 INFO  L137   encePairwiseOnDemand]: 176/192 looper letters, 839 selfloop transitions, 358 changer transitions 2/1229 dead transitions.
[2023-10-26 08:51:56,056 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 1229 transitions, 15058 flow
[2023-10-26 08:51:56,056 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-26 08:51:56,056 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-26 08:51:56,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1079 transitions.
[2023-10-26 08:51:56,058 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4683159722222222
[2023-10-26 08:51:56,059 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1079 transitions.
[2023-10-26 08:51:56,059 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1079 transitions.
[2023-10-26 08:51:56,059 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:51:56,059 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1079 transitions.
[2023-10-26 08:51:56,061 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 89.91666666666667) internal successors, (1079), 12 states have internal predecessors, (1079), 0 states have call successors, (0), 0 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:56,063 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 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:56,064 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 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:56,064 INFO  L175             Difference]: Start difference. First operand has 131 places, 771 transitions, 7820 flow. Second operand 12 states and 1079 transitions.
[2023-10-26 08:51:56,064 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 1229 transitions, 15058 flow
[2023-10-26 08:51:58,023 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1229 transitions, 14413 flow, removed 318 selfloop flow, removed 4 redundant places.
[2023-10-26 08:51:58,063 INFO  L231             Difference]: Finished difference. Result has 143 places, 1023 transitions, 11838 flow
[2023-10-26 08:51:58,063 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=7529, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11838, PETRI_PLACES=143, PETRI_TRANSITIONS=1023}
[2023-10-26 08:51:58,064 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places.
[2023-10-26 08:51:58,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 1023 transitions, 11838 flow
[2023-10-26 08:51:58,065 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 76.75) internal successors, (921), 12 states have internal predecessors, (921), 0 states have call successors, (0), 0 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:58,065 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:51:58,065 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:51:58,071 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:51:58,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-10-26 08:51:58,270 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:51:58,271 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:51:58,271 INFO  L85        PathProgramCache]: Analyzing trace with hash -972504981, now seen corresponding path program 2 times
[2023-10-26 08:51:58,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:51:58,272 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605033855]
[2023-10-26 08:51:58,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:51:58,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:51:58,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:51:58,821 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:58,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:51:58,822 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605033855]
[2023-10-26 08:51:58,822 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605033855] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:51:58,822 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101573461]
[2023-10-26 08:51:58,822 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:51:58,822 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:51:58,822 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:51:58,823 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:51:58,861 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:51:59,015 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:51:59,015 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:51:59,018 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-10-26 08:51:59,021 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:51:59,029 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:51:59,064 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:51:59,065 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 11 treesize of output 11
[2023-10-26 08:51:59,252 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:51:59,310 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:51:59,380 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:51:59,511 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-26 08:51:59,548 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:51:59,616 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:51:59,670 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,671 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:51:59,851 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,851 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101573461] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:51:59,851 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:51:59,851 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20
[2023-10-26 08:51:59,853 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963763168]
[2023-10-26 08:51:59,853 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:51:59,854 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2023-10-26 08:51:59,854 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:51:59,855 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2023-10-26 08:51:59,855 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462
[2023-10-26 08:52:01,262 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-10-26 08:52:01,263 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 1023 transitions, 11838 flow. Second operand  has 22 states, 22 states have (on average 76.81818181818181) internal successors, (1690), 22 states have internal predecessors, (1690), 0 states have call successors, (0), 0 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:01,263 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:01,263 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-10-26 08:52:01,263 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:06,173 INFO  L130       PetriNetUnfolder]: 9057/15823 cut-off events.
[2023-10-26 08:52:06,173 INFO  L131       PetriNetUnfolder]: For 80875/82329 co-relation queries the response was YES.
[2023-10-26 08:52:06,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95075 conditions, 15823 events. 9057/15823 cut-off events. For 80875/82329 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 109257 event pairs, 657 based on Foata normal form. 152/15449 useless extension candidates. Maximal degree in co-relation 93109. Up to 11155 conditions per place. 
[2023-10-26 08:52:06,351 INFO  L137   encePairwiseOnDemand]: 171/192 looper letters, 1149 selfloop transitions, 376 changer transitions 16/1571 dead transitions.
[2023-10-26 08:52:06,351 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1571 transitions, 20634 flow
[2023-10-26 08:52:06,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-26 08:52:06,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-26 08:52:06,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1834 transitions.
[2023-10-26 08:52:06,387 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4548611111111111
[2023-10-26 08:52:06,388 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1834 transitions.
[2023-10-26 08:52:06,388 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1834 transitions.
[2023-10-26 08:52:06,389 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:06,389 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1834 transitions.
[2023-10-26 08:52:06,392 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 87.33333333333333) internal successors, (1834), 21 states have internal predecessors, (1834), 0 states have call successors, (0), 0 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:06,396 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 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:06,396 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 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:06,397 INFO  L175             Difference]: Start difference. First operand has 143 places, 1023 transitions, 11838 flow. Second operand 21 states and 1834 transitions.
[2023-10-26 08:52:06,397 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1571 transitions, 20634 flow
[2023-10-26 08:52:08,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 1571 transitions, 20199 flow, removed 205 selfloop flow, removed 5 redundant places.
[2023-10-26 08:52:08,401 INFO  L231             Difference]: Finished difference. Result has 166 places, 1174 transitions, 14603 flow
[2023-10-26 08:52:08,402 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=11423, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14603, PETRI_PLACES=166, PETRI_TRANSITIONS=1174}
[2023-10-26 08:52:08,402 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 109 predicate places.
[2023-10-26 08:52:08,403 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 1174 transitions, 14603 flow
[2023-10-26 08:52:08,403 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 76.81818181818181) internal successors, (1690), 22 states have internal predecessors, (1690), 0 states have call successors, (0), 0 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:08,403 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:08,403 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:08,409 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:08,608 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:08,608 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:08,617 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:08,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 2049850436, now seen corresponding path program 2 times
[2023-10-26 08:52:08,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:08,620 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939637133]
[2023-10-26 08:52:08,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:08,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:08,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:09,132 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:09,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:09,132 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939637133]
[2023-10-26 08:52:09,133 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939637133] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:09,133 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154261906]
[2023-10-26 08:52:09,133 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:52:09,133 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:09,133 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:09,150 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:09,201 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:09,338 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:52:09,338 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:52:09,353 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-10-26 08:52:09,356 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:09,361 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:52:09,386 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:52:09,386 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 11 treesize of output 11
[2023-10-26 08:52:09,564 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:52:09,631 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:52:09,682 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:52:09,736 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:52:09,786 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:52:09,844 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:09,844 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:09,867 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2023-10-26 08:52:09,907 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-10-26 08:52:09,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:52:09,980 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154261906] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:09,980 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:09,980 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21
[2023-10-26 08:52:09,980 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959865665]
[2023-10-26 08:52:09,980 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:09,980 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2023-10-26 08:52:09,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:09,981 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2023-10-26 08:52:09,981 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=349, Unknown=2, NotChecked=78, Total=506
[2023-10-26 08:52:10,101 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-26 08:52:10,102 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 1174 transitions, 14603 flow. Second operand  has 23 states, 23 states have (on average 54.69565217391305) internal successors, (1258), 23 states have internal predecessors, (1258), 0 states have call successors, (0), 0 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:10,102 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:10,103 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-26 08:52:10,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:16,754 INFO  L130       PetriNetUnfolder]: 11708/19508 cut-off events.
[2023-10-26 08:52:16,754 INFO  L131       PetriNetUnfolder]: For 124723/124729 co-relation queries the response was YES.
[2023-10-26 08:52:16,814 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127668 conditions, 19508 events. 11708/19508 cut-off events. For 124723/124729 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 131180 event pairs, 698 based on Foata normal form. 1/18175 useless extension candidates. Maximal degree in co-relation 125380. Up to 13919 conditions per place. 
[2023-10-26 08:52:16,887 INFO  L137   encePairwiseOnDemand]: 167/192 looper letters, 1349 selfloop transitions, 732 changer transitions 2/2087 dead transitions.
[2023-10-26 08:52:16,887 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 2087 transitions, 29755 flow
[2023-10-26 08:52:16,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-10-26 08:52:16,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-10-26 08:52:16,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1530 transitions.
[2023-10-26 08:52:16,893 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34646739130434784
[2023-10-26 08:52:16,893 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1530 transitions.
[2023-10-26 08:52:16,893 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1530 transitions.
[2023-10-26 08:52:16,903 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:16,903 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1530 transitions.
[2023-10-26 08:52:16,908 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 66.52173913043478) internal successors, (1530), 23 states have internal predecessors, (1530), 0 states have call successors, (0), 0 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,929 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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,930 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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,930 INFO  L175             Difference]: Start difference. First operand has 166 places, 1174 transitions, 14603 flow. Second operand 23 states and 1530 transitions.
[2023-10-26 08:52:16,931 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 2087 transitions, 29755 flow
[2023-10-26 08:52:19,857 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 2087 transitions, 29052 flow, removed 136 selfloop flow, removed 7 redundant places.
[2023-10-26 08:52:19,890 INFO  L231             Difference]: Finished difference. Result has 195 places, 1597 transitions, 22944 flow
[2023-10-26 08:52:19,891 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=13955, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=407, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=22944, PETRI_PLACES=195, PETRI_TRANSITIONS=1597}
[2023-10-26 08:52:19,893 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 138 predicate places.
[2023-10-26 08:52:19,893 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 1597 transitions, 22944 flow
[2023-10-26 08:52:19,893 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 54.69565217391305) internal successors, (1258), 23 states have internal predecessors, (1258), 0 states have call successors, (0), 0 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,893 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:19,893 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:52:19,899 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:20,098 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2023-10-26 08:52:20,098 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:20,099 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:20,099 INFO  L85        PathProgramCache]: Analyzing trace with hash -862277107, now seen corresponding path program 3 times
[2023-10-26 08:52:20,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:20,100 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046584749]
[2023-10-26 08:52:20,100 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:20,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:20,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:20,585 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:20,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:20,585 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046584749]
[2023-10-26 08:52:20,585 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046584749] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:20,585 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893506991]
[2023-10-26 08:52:20,586 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-26 08:52:20,586 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:20,586 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:20,602 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:20,633 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:20,803 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-26 08:52:20,804 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:52:20,818 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-10-26 08:52:20,820 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:20,825 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:52:20,862 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:52:20,865 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 11 treesize of output 11
[2023-10-26 08:52:21,019 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:52:21,050 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:52:21,150 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:52:21,201 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-26 08:52:21,231 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:52:21,292 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:52:21,336 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:21,336 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:21,356 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2023-10-26 08:52:21,384 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))))))) is different from false
[2023-10-26 08:52:21,400 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|))))) is different from false
[2023-10-26 08:52:21,429 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse0 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse4 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse6 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse7 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)))))))) is different from false
[2023-10-26 08:52:21,445 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse1 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse4 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse5 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse7 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false
[2023-10-26 08:52:21,536 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:52:21,536 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [893506991] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:21,536 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:21,537 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25
[2023-10-26 08:52:21,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189372937]
[2023-10-26 08:52:21,537 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:21,537 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-26 08:52:21,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:21,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-26 08:52:21,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=393, Unknown=5, NotChecked=220, Total=702
[2023-10-26 08:52:21,786 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-26 08:52:21,787 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 1597 transitions, 22944 flow. Second operand  has 27 states, 27 states have (on average 54.7037037037037) internal successors, (1477), 27 states have internal predecessors, (1477), 0 states have call successors, (0), 0 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:21,787 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:21,787 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-26 08:52:21,787 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:29,520 INFO  L130       PetriNetUnfolder]: 11553/19268 cut-off events.
[2023-10-26 08:52:29,521 INFO  L131       PetriNetUnfolder]: For 185351/185357 co-relation queries the response was YES.
[2023-10-26 08:52:29,596 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 139651 conditions, 19268 events. 11553/19268 cut-off events. For 185351/185357 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 129405 event pairs, 697 based on Foata normal form. 118/18359 useless extension candidates. Maximal degree in co-relation 137316. Up to 14904 conditions per place. 
[2023-10-26 08:52:29,711 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 1574 selfloop transitions, 601 changer transitions 2/2181 dead transitions.
[2023-10-26 08:52:29,711 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 2181 transitions, 34403 flow
[2023-10-26 08:52:29,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-26 08:52:29,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-26 08:52:29,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1635 transitions.
[2023-10-26 08:52:29,730 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.340625
[2023-10-26 08:52:29,730 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1635 transitions.
[2023-10-26 08:52:29,730 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1635 transitions.
[2023-10-26 08:52:29,731 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:29,731 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1635 transitions.
[2023-10-26 08:52:29,733 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 65.4) internal successors, (1635), 25 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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:29,751 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 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:29,753 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 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:29,765 INFO  L175             Difference]: Start difference. First operand has 195 places, 1597 transitions, 22944 flow. Second operand 25 states and 1635 transitions.
[2023-10-26 08:52:29,765 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 2181 transitions, 34403 flow
[2023-10-26 08:52:33,647 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2181 transitions, 31812 flow, removed 1089 selfloop flow, removed 6 redundant places.
[2023-10-26 08:52:33,678 INFO  L231             Difference]: Finished difference. Result has 223 places, 1767 transitions, 25279 flow
[2023-10-26 08:52:33,679 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=20484, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=462, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=25279, PETRI_PLACES=223, PETRI_TRANSITIONS=1767}
[2023-10-26 08:52:33,680 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 166 predicate places.
[2023-10-26 08:52:33,681 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 1767 transitions, 25279 flow
[2023-10-26 08:52:33,681 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 54.7037037037037) internal successors, (1477), 27 states have internal predecessors, (1477), 0 states have call successors, (0), 0 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:33,681 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:33,681 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]
[2023-10-26 08:52:33,689 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:52:33,888 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2023-10-26 08:52:33,889 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:33,905 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:33,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 329382834, now seen corresponding path program 1 times
[2023-10-26 08:52:33,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:33,906 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118063223]
[2023-10-26 08:52:33,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:33,906 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:33,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:34,308 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:34,308 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:34,308 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118063223]
[2023-10-26 08:52:34,308 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118063223] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:34,308 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279494180]
[2023-10-26 08:52:34,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:34,309 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:34,309 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:34,326 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:52:34,356 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:52:34,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:34,492 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-10-26 08:52:34,498 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:34,501 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:52:34,507 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:52:34,508 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 11 treesize of output 11
[2023-10-26 08:52:34,538 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 13 treesize of output 9
[2023-10-26 08:52:34,556 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 22
[2023-10-26 08:52:34,566 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:34,566 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 32 treesize of output 34
[2023-10-26 08:52:34,593 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:34,593 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 41 treesize of output 46
[2023-10-26 08:52:34,605 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 43 treesize of output 39
[2023-10-26 08:52:34,613 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:34,629 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:34,645 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:52:34,759 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (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_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-10-26 08:52:34,788 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 5)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (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_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:52:34,846 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:34,846 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 37 treesize of output 53
[2023-10-26 08:52:34,852 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:34,853 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 86 treesize of output 32
[2023-10-26 08:52:34,861 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-10-26 08:52:34,862 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 37 treesize of output 1
[2023-10-26 08:52:34,866 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-10-26 08:52:34,866 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 37 treesize of output 1
[2023-10-26 08:52:34,887 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-10-26 08:52:34,887 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 37 treesize of output 1
[2023-10-26 08:52:34,913 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:34,913 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [279494180] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:34,913 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:34,913 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14
[2023-10-26 08:52:34,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577168986]
[2023-10-26 08:52:34,914 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:34,914 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-10-26 08:52:34,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:34,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-10-26 08:52:34,915 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=114, Unknown=9, NotChecked=72, Total=240
[2023-10-26 08:52:35,005 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 192
[2023-10-26 08:52:35,005 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1767 transitions, 25279 flow. Second operand  has 16 states, 16 states have (on average 59.8125) internal successors, (957), 16 states have internal predecessors, (957), 0 states have call successors, (0), 0 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:35,005 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:35,006 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 192
[2023-10-26 08:52:35,006 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:52:43,818 INFO  L130       PetriNetUnfolder]: 12234/20378 cut-off events.
[2023-10-26 08:52:43,818 INFO  L131       PetriNetUnfolder]: For 217902/217910 co-relation queries the response was YES.
[2023-10-26 08:52:43,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156294 conditions, 20378 events. 12234/20378 cut-off events. For 217902/217910 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 138964 event pairs, 1327 based on Foata normal form. 65/19384 useless extension candidates. Maximal degree in co-relation 153912. Up to 10079 conditions per place. 
[2023-10-26 08:52:44,167 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 1019 selfloop transitions, 1404 changer transitions 10/2437 dead transitions.
[2023-10-26 08:52:44,171 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 2437 transitions, 38878 flow
[2023-10-26 08:52:44,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-10-26 08:52:44,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-10-26 08:52:44,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1533 transitions.
[2023-10-26 08:52:44,178 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4435763888888889
[2023-10-26 08:52:44,179 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1533 transitions.
[2023-10-26 08:52:44,179 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1533 transitions.
[2023-10-26 08:52:44,179 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:52:44,179 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1533 transitions.
[2023-10-26 08:52:44,181 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 85.16666666666667) internal successors, (1533), 18 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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:44,183 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 192.0) internal successors, (3648), 19 states have internal predecessors, (3648), 0 states have call successors, (0), 0 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:44,183 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 192.0) internal successors, (3648), 19 states have internal predecessors, (3648), 0 states have call successors, (0), 0 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:44,183 INFO  L175             Difference]: Start difference. First operand has 223 places, 1767 transitions, 25279 flow. Second operand 18 states and 1533 transitions.
[2023-10-26 08:52:44,183 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 2437 transitions, 38878 flow
[2023-10-26 08:52:49,027 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2437 transitions, 37334 flow, removed 671 selfloop flow, removed 8 redundant places.
[2023-10-26 08:52:49,079 INFO  L231             Difference]: Finished difference. Result has 236 places, 1973 transitions, 30792 flow
[2023-10-26 08:52:49,081 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=24133, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=30792, PETRI_PLACES=236, PETRI_TRANSITIONS=1973}
[2023-10-26 08:52:49,092 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 179 predicate places.
[2023-10-26 08:52:49,093 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 1973 transitions, 30792 flow
[2023-10-26 08:52:49,093 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 59.8125) internal successors, (957), 16 states have internal predecessors, (957), 0 states have call successors, (0), 0 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:49,093 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:52:49,093 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]
[2023-10-26 08:52:49,099 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:52:49,297 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-10-26 08:52:49,298 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:52:49,298 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:52:49,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -1883145753, now seen corresponding path program 1 times
[2023-10-26 08:52:49,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:52:49,299 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699383086]
[2023-10-26 08:52:49,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:49,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:52:49,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:49,770 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:49,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:52:49,770 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699383086]
[2023-10-26 08:52:49,770 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699383086] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:52:49,770 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852867321]
[2023-10-26 08:52:49,770 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:52:49,770 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:52:49,770 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:52:49,772 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:52:49,806 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:52:49,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:52:49,945 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 40 conjunts are in the unsatisfiable core
[2023-10-26 08:52:49,950 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:52:49,961 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:52:49,987 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:52:49,987 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 11 treesize of output 11
[2023-10-26 08:52:50,115 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:52:50,157 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:52:50,207 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:52:50,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:52:50,334 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:52:50,380 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:50,380 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:52:50,744 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false
[2023-10-26 08:52:50,756 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2) 0)))) (and (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2023-10-26 08:52:50,781 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:50,782 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 51 treesize of output 67
[2023-10-26 08:52:50,786 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:52:50,786 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 83 treesize of output 39
[2023-10-26 08:52:50,789 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 10 treesize of output 3
[2023-10-26 08:52:50,795 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-26 08:52:50,795 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 51 treesize of output 1
[2023-10-26 08:52:50,799 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-26 08:52:50,799 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 50 treesize of output 1
[2023-10-26 08:52:50,840 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:50,840 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852867321] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:52:50,840 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:52:50,840 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2023-10-26 08:52:50,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093046617]
[2023-10-26 08:52:50,841 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:52:50,841 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:52:50,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:52:50,841 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:52:50,842 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=433, Unknown=19, NotChecked=90, Total=650
[2023-10-26 08:52:51,035 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-26 08:52:51,035 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1973 transitions, 30792 flow. Second operand  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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:51,036 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:52:51,036 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-26 08:52:51,036 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:53:07,293 INFO  L130       PetriNetUnfolder]: 21940/36688 cut-off events.
[2023-10-26 08:53:07,293 INFO  L131       PetriNetUnfolder]: For 426823/426905 co-relation queries the response was YES.
[2023-10-26 08:53:07,528 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 300915 conditions, 36688 events. 21940/36688 cut-off events. For 426823/426905 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 277379 event pairs, 1049 based on Foata normal form. 352/34898 useless extension candidates. Maximal degree in co-relation 294677. Up to 15484 conditions per place. 
[2023-10-26 08:53:07,707 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2770 selfloop transitions, 1147 changer transitions 2/3923 dead transitions.
[2023-10-26 08:53:07,707 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 3923 transitions, 65680 flow
[2023-10-26 08:53:07,708 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2023-10-26 08:53:07,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2023-10-26 08:53:07,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1986 transitions.
[2023-10-26 08:53:07,738 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34479166666666666
[2023-10-26 08:53:07,738 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1986 transitions.
[2023-10-26 08:53:07,738 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1986 transitions.
[2023-10-26 08:53:07,738 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:53:07,739 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1986 transitions.
[2023-10-26 08:53:07,741 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 66.2) internal successors, (1986), 30 states have internal predecessors, (1986), 0 states have call successors, (0), 0 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,744 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 192.0) internal successors, (5952), 31 states have internal predecessors, (5952), 0 states have call successors, (0), 0 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,745 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 192.0) internal successors, (5952), 31 states have internal predecessors, (5952), 0 states have call successors, (0), 0 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,745 INFO  L175             Difference]: Start difference. First operand has 236 places, 1973 transitions, 30792 flow. Second operand 30 states and 1986 transitions.
[2023-10-26 08:53:07,745 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 3923 transitions, 65680 flow
[2023-10-26 08:53:30,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 3923 transitions, 61915 flow, removed 686 selfloop flow, removed 10 redundant places.
[2023-10-26 08:53:31,046 INFO  L231             Difference]: Finished difference. Result has 277 places, 3020 transitions, 49672 flow
[2023-10-26 08:53:31,062 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=28910, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=49672, PETRI_PLACES=277, PETRI_TRANSITIONS=3020}
[2023-10-26 08:53:31,063 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 220 predicate places.
[2023-10-26 08:53:31,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 3020 transitions, 49672 flow
[2023-10-26 08:53:31,064 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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:31,064 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:53:31,064 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]
[2023-10-26 08:53:31,070 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:53:31,268 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-10-26 08:53:31,268 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:53:31,269 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:53:31,269 INFO  L85        PathProgramCache]: Analyzing trace with hash -201168629, now seen corresponding path program 2 times
[2023-10-26 08:53:31,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:53:31,269 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510059190]
[2023-10-26 08:53:31,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:53:31,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:53:31,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:53:31,688 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:31,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:53:31,688 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510059190]
[2023-10-26 08:53:31,688 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510059190] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:53:31,688 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381348818]
[2023-10-26 08:53:31,688 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:53:31,688 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:53:31,688 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:53:31,697 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:53:31,725 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:53:31,855 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:53:31,855 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:53:31,856 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-26 08:53:31,859 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:53:31,870 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:53:31,894 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:53:31,894 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 11 treesize of output 11
[2023-10-26 08:53:32,001 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:53:32,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 28 treesize of output 27
[2023-10-26 08:53:32,092 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:53:32,194 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-26 08:53:32,205 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:53:32,271 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:53:32,302 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:32,302 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:53:32,334 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)))) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2023-10-26 08:53:32,482 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0))))) is different from false
[2023-10-26 08:53:32,504 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (and (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0))))) is different from false
[2023-10-26 08:53:32,621 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:32,621 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [381348818] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:53:32,621 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:53:32,621 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2023-10-26 08:53:32,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126685022]
[2023-10-26 08:53:32,622 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:53:32,622 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:53:32,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:53:32,622 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:53:32,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=416, Unknown=9, NotChecked=132, Total=650
[2023-10-26 08:53:32,673 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-10-26 08:53:32,674 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 3020 transitions, 49672 flow. Second operand  has 26 states, 26 states have (on average 56.80769230769231) internal successors, (1477), 26 states have internal predecessors, (1477), 0 states have call successors, (0), 0 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:32,674 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:53:32,674 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-10-26 08:53:32,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:53:56,302 INFO  L130       PetriNetUnfolder]: 25276/42687 cut-off events.
[2023-10-26 08:53:56,302 INFO  L131       PetriNetUnfolder]: For 780172/780244 co-relation queries the response was YES.
[2023-10-26 08:53:56,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 388629 conditions, 42687 events. 25276/42687 cut-off events. For 780172/780244 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 331992 event pairs, 1801 based on Foata normal form. 269/40371 useless extension candidates. Maximal degree in co-relation 382433. Up to 20482 conditions per place. 
[2023-10-26 08:53:56,808 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2885 selfloop transitions, 1072 changer transitions 0/3961 dead transitions.
[2023-10-26 08:53:56,808 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 3961 transitions, 72942 flow
[2023-10-26 08:53:56,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-10-26 08:53:56,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-10-26 08:53:56,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1822 transitions.
[2023-10-26 08:53:56,811 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36498397435897434
[2023-10-26 08:53:56,811 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1822 transitions.
[2023-10-26 08:53:56,811 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1822 transitions.
[2023-10-26 08:53:56,811 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:53:56,811 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1822 transitions.
[2023-10-26 08:53:56,842 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 70.07692307692308) internal successors, (1822), 26 states have internal predecessors, (1822), 0 states have call successors, (0), 0 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:56,845 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 192.0) internal successors, (5184), 27 states have internal predecessors, (5184), 0 states have call successors, (0), 0 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:56,845 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 192.0) internal successors, (5184), 27 states have internal predecessors, (5184), 0 states have call successors, (0), 0 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:56,845 INFO  L175             Difference]: Start difference. First operand has 277 places, 3020 transitions, 49672 flow. Second operand 26 states and 1822 transitions.
[2023-10-26 08:53:56,846 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 3961 transitions, 72942 flow
[2023-10-26 08:54:38,277 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 3961 transitions, 68771 flow, removed 2083 selfloop flow, removed 3 redundant places.
[2023-10-26 08:54:38,326 INFO  L231             Difference]: Finished difference. Result has 317 places, 3492 transitions, 58992 flow
[2023-10-26 08:54:38,328 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=46139, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=621, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=58992, PETRI_PLACES=317, PETRI_TRANSITIONS=3492}
[2023-10-26 08:54:38,329 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 260 predicate places.
[2023-10-26 08:54:38,329 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 3492 transitions, 58992 flow
[2023-10-26 08:54:38,329 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.80769230769231) internal successors, (1477), 26 states have internal predecessors, (1477), 0 states have call successors, (0), 0 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:38,329 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:54:38,329 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:54:38,336 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:54:38,534 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-26 08:54:38,535 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:54:38,535 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:54:38,536 INFO  L85        PathProgramCache]: Analyzing trace with hash -530869613, now seen corresponding path program 3 times
[2023-10-26 08:54:38,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:54:38,537 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347365901]
[2023-10-26 08:54:38,537 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:54:38,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:54:38,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:54:38,997 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:38,998 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:54:38,998 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347365901]
[2023-10-26 08:54:38,998 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347365901] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:54:38,998 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136947289]
[2023-10-26 08:54:38,998 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-26 08:54:38,998 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:54:38,998 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:54:38,999 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:54:39,045 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:54:39,208 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-26 08:54:39,208 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:54:39,222 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-26 08:54:39,224 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:54:39,227 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:54:39,244 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:54:39,245 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 11 treesize of output 11
[2023-10-26 08:54:39,361 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:54:39,466 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:54:39,517 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:54:39,576 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-26 08:54:39,601 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:54:39,656 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:54:39,688 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,688 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:54:39,730 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2023-10-26 08:54:39,755 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)))))) is different from false
[2023-10-26 08:54:39,797 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) 0))))) is different from false
[2023-10-26 08:54:39,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:54:39,905 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [136947289] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:54:39,905 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:54:39,905 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23
[2023-10-26 08:54:39,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213761869]
[2023-10-26 08:54:39,905 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:54:39,906 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2023-10-26 08:54:39,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:54:39,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-10-26 08:54:39,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=378, Unknown=3, NotChecked=126, Total=600
[2023-10-26 08:54:40,070 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-10-26 08:54:40,071 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 3492 transitions, 58992 flow. Second operand  has 25 states, 25 states have (on average 56.84) internal successors, (1421), 25 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:54:40,071 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:54:40,071 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-10-26 08:54:40,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:08,220 INFO  L130       PetriNetUnfolder]: 26170/44205 cut-off events.
[2023-10-26 08:55:08,220 INFO  L131       PetriNetUnfolder]: For 1031411/1031425 co-relation queries the response was YES.
[2023-10-26 08:55:08,619 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 432566 conditions, 44205 events. 26170/44205 cut-off events. For 1031411/1031425 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 345770 event pairs, 1339 based on Foata normal form. 199/41763 useless extension candidates. Maximal degree in co-relation 426112. Up to 15717 conditions per place. 
[2023-10-26 08:55:08,848 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2780 selfloop transitions, 1750 changer transitions 2/4536 dead transitions.
[2023-10-26 08:55:08,848 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 4536 transitions, 85690 flow
[2023-10-26 08:55:08,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-26 08:55:08,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-26 08:55:08,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1765 transitions.
[2023-10-26 08:55:08,852 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36770833333333336
[2023-10-26 08:55:08,852 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1765 transitions.
[2023-10-26 08:55:08,877 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1765 transitions.
[2023-10-26 08:55:08,878 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:55:08,878 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1765 transitions.
[2023-10-26 08:55:08,880 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 70.6) internal successors, (1765), 25 states have internal predecessors, (1765), 0 states have call successors, (0), 0 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:08,883 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 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:08,884 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 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:08,884 INFO  L175             Difference]: Start difference. First operand has 317 places, 3492 transitions, 58992 flow. Second operand 25 states and 1765 transitions.
[2023-10-26 08:55:08,884 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 4536 transitions, 85690 flow
[2023-10-26 08:55:52,530 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 4536 transitions, 83793 flow, removed 946 selfloop flow, removed 3 redundant places.
[2023-10-26 08:55:52,587 INFO  L231             Difference]: Finished difference. Result has 345 places, 3971 transitions, 71320 flow
[2023-10-26 08:55:52,590 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=57313, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=71320, PETRI_PLACES=345, PETRI_TRANSITIONS=3971}
[2023-10-26 08:55:52,591 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 288 predicate places.
[2023-10-26 08:55:52,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 345 places, 3971 transitions, 71320 flow
[2023-10-26 08:55:52,592 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 56.84) internal successors, (1421), 25 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:52,592 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:52,592 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:55:52,599 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:55:52,797 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:55:52,797 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:55:52,798 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:52,798 INFO  L85        PathProgramCache]: Analyzing trace with hash -85817847, now seen corresponding path program 1 times
[2023-10-26 08:55:52,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:52,799 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797312231]
[2023-10-26 08:55:52,799 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:52,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:52,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:53,254 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:55:53,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:53,254 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797312231]
[2023-10-26 08:55:53,254 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797312231] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:55:53,254 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774237365]
[2023-10-26 08:55:53,255 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:53,255 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:55:53,255 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:55:53,257 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:55:53,283 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:55:53,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:53,412 INFO  L263         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-26 08:55:53,414 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:55:53,417 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:55:53,429 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:55:53,430 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 11 treesize of output 11
[2023-10-26 08:55:53,445 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:55:53,456 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:55:53,462 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:55:53,477 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:53,497 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:55:53,509 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:55:53,510 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:55:53,537 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:55:53,550 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:55:53,558 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:55:53,558 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:55:53,589 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))))) is different from false
[2023-10-26 08:55:53,741 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false
[2023-10-26 08:55:53,769 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse4 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-10-26 08:55:53,833 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:55:53,834 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774237365] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:55:53,834 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:55:53,834 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14
[2023-10-26 08:55:53,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178405935]
[2023-10-26 08:55:53,834 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:55:53,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-10-26 08:55:53,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:55:53,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-10-26 08:55:53,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=9, NotChecked=72, Total=240
[2023-10-26 08:55:53,943 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-26 08:55:53,943 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 3971 transitions, 71320 flow. Second operand  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:53,943 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:55:53,943 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-26 08:55:53,944 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:56:22,234 INFO  L130       PetriNetUnfolder]: 26160/44175 cut-off events.
[2023-10-26 08:56:22,235 INFO  L131       PetriNetUnfolder]: For 1231998/1232042 co-relation queries the response was YES.
[2023-10-26 08:56:22,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 465723 conditions, 44175 events. 26160/44175 cut-off events. For 1231998/1232042 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 344462 event pairs, 3912 based on Foata normal form. 66/41604 useless extension candidates. Maximal degree in co-relation 461007. Up to 38536 conditions per place. 
[2023-10-26 08:56:22,999 INFO  L137   encePairwiseOnDemand]: 168/192 looper letters, 3174 selfloop transitions, 1041 changer transitions 0/4219 dead transitions.
[2023-10-26 08:56:22,999 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 4219 transitions, 84045 flow
[2023-10-26 08:56:23,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-26 08:56:23,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-26 08:56:23,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 819 transitions.
[2023-10-26 08:56:23,007 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35546875
[2023-10-26 08:56:23,007 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 819 transitions.
[2023-10-26 08:56:23,007 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 819 transitions.
[2023-10-26 08:56:23,008 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:56:23,008 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 819 transitions.
[2023-10-26 08:56:23,013 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 0 states have call successors, (0), 0 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:23,014 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 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:23,014 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 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:23,014 INFO  L175             Difference]: Start difference. First operand has 345 places, 3971 transitions, 71320 flow. Second operand 12 states and 819 transitions.
[2023-10-26 08:56:23,015 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 4219 transitions, 84045 flow
[2023-10-26 08:57:08,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4219 transitions, 82234 flow, removed 856 selfloop flow, removed 9 redundant places.
[2023-10-26 08:57:08,224 INFO  L231             Difference]: Finished difference. Result has 349 places, 4037 transitions, 72965 flow
[2023-10-26 08:57:08,226 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=69498, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=969, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=72965, PETRI_PLACES=349, PETRI_TRANSITIONS=4037}
[2023-10-26 08:57:08,227 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 292 predicate places.
[2023-10-26 08:57:08,227 INFO  L495      AbstractCegarLoop]: Abstraction has has 349 places, 4037 transitions, 72965 flow
[2023-10-26 08:57:08,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:57:08,227 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:57:08,240 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]
[2023-10-26 08:57:08,302 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:57:08,500 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:57:08,501 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:57:08,501 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:57:08,501 INFO  L85        PathProgramCache]: Analyzing trace with hash 92273895, now seen corresponding path program 4 times
[2023-10-26 08:57:08,501 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:57:08,502 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328302018]
[2023-10-26 08:57:08,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:57:08,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:57:08,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:57:08,936 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:57:08,936 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:57:08,936 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328302018]
[2023-10-26 08:57:08,936 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328302018] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:57:08,936 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594852497]
[2023-10-26 08:57:08,936 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-26 08:57:08,937 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:57:08,937 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:57:08,938 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:57:08,989 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:57:09,213 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-26 08:57:09,213 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:57:09,215 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core
[2023-10-26 08:57:09,222 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:57:09,226 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:57:09,233 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:57:09,233 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 11 treesize of output 11
[2023-10-26 08:57:09,261 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:57:09,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:57:09,289 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-10-26 08:57:09,305 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:57:09,305 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:57:09,320 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:57:09,322 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:57:09,342 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:57:09,350 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:57:09,350 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:57:09,369 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)))) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2023-10-26 08:57:09,467 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2023-10-26 08:57:09,487 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3))) (and (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)))) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0))))) is different from false
[2023-10-26 08:57:09,512 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3))) (and (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0))))) is different from false
[2023-10-26 08:57:09,566 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:57:09,567 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594852497] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:57:09,567 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:57:09,567 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 15
[2023-10-26 08:57:09,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436841890]
[2023-10-26 08:57:09,567 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:57:09,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2023-10-26 08:57:09,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:57:09,567 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2023-10-26 08:57:09,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=10, NotChecked=100, Total=272
[2023-10-26 08:57:09,641 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-10-26 08:57:09,642 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 4037 transitions, 72965 flow. Second operand  has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 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:09,642 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:57:09,642 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-10-26 08:57:09,642 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:57:44,098 INFO  L130       PetriNetUnfolder]: 29823/50776 cut-off events.
[2023-10-26 08:57:44,098 INFO  L131       PetriNetUnfolder]: For 1471610/1471630 co-relation queries the response was YES.
[2023-10-26 08:57:44,688 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 530969 conditions, 50776 events. 29823/50776 cut-off events. For 1471610/1471630 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 408296 event pairs, 2784 based on Foata normal form. 184/47868 useless extension candidates. Maximal degree in co-relation 525729. Up to 32484 conditions per place. 
[2023-10-26 08:57:44,962 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 3395 selfloop transitions, 1642 changer transitions 0/5041 dead transitions.
[2023-10-26 08:57:44,962 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 5041 transitions, 102378 flow
[2023-10-26 08:57:44,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-10-26 08:57:44,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2023-10-26 08:57:44,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1702 transitions.
[2023-10-26 08:57:44,964 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3693576388888889
[2023-10-26 08:57:44,964 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1702 transitions.
[2023-10-26 08:57:44,964 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1702 transitions.
[2023-10-26 08:57:44,965 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:57:44,965 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1702 transitions.
[2023-10-26 08:57:44,966 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 70.91666666666667) internal successors, (1702), 24 states have internal predecessors, (1702), 0 states have call successors, (0), 0 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:44,973 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 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:44,973 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 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:44,973 INFO  L175             Difference]: Start difference. First operand has 349 places, 4037 transitions, 72965 flow. Second operand 24 states and 1702 transitions.
[2023-10-26 08:57:44,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 5041 transitions, 102378 flow
[2023-10-26 08:58:35,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 5041 transitions, 100501 flow, removed 117 selfloop flow, removed 7 redundant places.
[2023-10-26 08:58:35,231 INFO  L231             Difference]: Finished difference. Result has 385 places, 4635 transitions, 91290 flow
[2023-10-26 08:58:35,234 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=71127, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4037, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=91290, PETRI_PLACES=385, PETRI_TRANSITIONS=4635}
[2023-10-26 08:58:35,234 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 328 predicate places.
[2023-10-26 08:58:35,234 INFO  L495      AbstractCegarLoop]: Abstraction has has 385 places, 4635 transitions, 91290 flow
[2023-10-26 08:58:35,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 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:35,235 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:58:35,235 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]
[2023-10-26 08:58:35,246 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 08:58:35,444 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-10-26 08:58:35,444 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:58:35,445 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:58:35,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -1956895420, now seen corresponding path program 1 times
[2023-10-26 08:58:35,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:58:35,447 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886048847]
[2023-10-26 08:58:35,447 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:35,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:58:35,504 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:35,858 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:35,858 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:58:35,858 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886048847]
[2023-10-26 08:58:35,858 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886048847] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:58:35,858 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968818626]
[2023-10-26 08:58:35,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:58:35,858 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:58:35,858 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:58:35,863 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 08:58:35,909 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 08:58:36,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:58:36,090 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-10-26 08:58:36,094 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:58:36,102 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 08:58:36,126 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:58:36,126 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 11 treesize of output 11
[2023-10-26 08:58:36,264 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:36,305 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 08:58:36,358 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 08:58:36,414 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 08:58:36,475 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 08:58:36,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:58:36,522 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:58:36,552 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)))) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2023-10-26 08:58:36,671 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2023-10-26 08:58:36,687 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2) 0)))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2023-10-26 08:58:36,698 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:58:36,698 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 51 treesize of output 67
[2023-10-26 08:58:36,703 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:58:36,703 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 83 treesize of output 39
[2023-10-26 08:58:36,707 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 10 treesize of output 3
[2023-10-26 08:58:36,717 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-26 08:58:36,717 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 51 treesize of output 1
[2023-10-26 08:58:36,723 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-26 08:58:36,724 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 50 treesize of output 1
[2023-10-26 08:58:36,782 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:36,782 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [968818626] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:58:36,782 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:58:36,782 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2023-10-26 08:58:36,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789404246]
[2023-10-26 08:58:36,783 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:58:36,783 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:58:36,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:58:36,783 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:58:36,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=404, Unknown=14, NotChecked=132, Total=650
[2023-10-26 08:58:37,060 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-26 08:58:37,061 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 4635 transitions, 91290 flow. Second operand  has 26 states, 26 states have (on average 49.73076923076923) internal successors, (1293), 26 states have internal predecessors, (1293), 0 states have call successors, (0), 0 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:37,062 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:58:37,062 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-26 08:58:37,062 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:59:18,387 INFO  L130       PetriNetUnfolder]: 30142/51413 cut-off events.
[2023-10-26 08:59:18,387 INFO  L131       PetriNetUnfolder]: For 1854577/1854615 co-relation queries the response was YES.
[2023-10-26 08:59:19,047 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 574702 conditions, 51413 events. 30142/51413 cut-off events. For 1854577/1854615 co-relation queries the response was YES. Maximal size of possible extension queue 1555. Compared 415600 event pairs, 2004 based on Foata normal form. 114/48419 useless extension candidates. Maximal degree in co-relation 568834. Up to 18452 conditions per place. 
[2023-10-26 08:59:19,482 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 3219 selfloop transitions, 2253 changer transitions 4/5480 dead transitions.
[2023-10-26 08:59:19,482 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 5480 transitions, 118395 flow
[2023-10-26 08:59:19,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2023-10-26 08:59:19,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2023-10-26 08:59:19,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2123 transitions.
[2023-10-26 08:59:19,498 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3252144607843137
[2023-10-26 08:59:19,498 INFO  L72            ComplementDD]: Start complementDD. Operand 34 states and 2123 transitions.
[2023-10-26 08:59:19,498 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 34 states and 2123 transitions.
[2023-10-26 08:59:19,499 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:59:19,499 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2123 transitions.
[2023-10-26 08:59:19,501 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 35 states, 34 states have (on average 62.44117647058823) internal successors, (2123), 34 states have internal predecessors, (2123), 0 states have call successors, (0), 0 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:19,507 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 35 states, 35 states have (on average 192.0) internal successors, (6720), 35 states have internal predecessors, (6720), 0 states have call successors, (0), 0 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:19,507 INFO  L81            ComplementDD]: Finished complementDD. Result  has 35 states, 35 states have (on average 192.0) internal successors, (6720), 35 states have internal predecessors, (6720), 0 states have call successors, (0), 0 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:19,508 INFO  L175             Difference]: Start difference. First operand has 385 places, 4635 transitions, 91290 flow. Second operand 34 states and 2123 transitions.
[2023-10-26 08:59:19,508 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 5480 transitions, 118395 flow
[2023-10-26 09:00:24,374 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 5480 transitions, 115212 flow, removed 1585 selfloop flow, removed 4 redundant places.
[2023-10-26 09:00:24,469 INFO  L231             Difference]: Finished difference. Result has 422 places, 4840 transitions, 99613 flow
[2023-10-26 09:00:24,472 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=88151, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2041, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=99613, PETRI_PLACES=422, PETRI_TRANSITIONS=4840}
[2023-10-26 09:00:24,473 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 365 predicate places.
[2023-10-26 09:00:24,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 422 places, 4840 transitions, 99613 flow
[2023-10-26 09:00:24,474 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.73076923076923) internal successors, (1293), 26 states have internal predecessors, (1293), 0 states have call successors, (0), 0 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:00:24,474 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:00:24,474 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]
[2023-10-26 09:00:24,481 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2023-10-26 09:00:24,679 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2023-10-26 09:00:24,680 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 09:00:24,685 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:00:24,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 736991051, now seen corresponding path program 5 times
[2023-10-26 09:00:24,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:00:24,686 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894890965]
[2023-10-26 09:00:24,686 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:00:24,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:00:24,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:00:25,117 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:00:25,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:00:25,117 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894890965]
[2023-10-26 09:00:25,117 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894890965] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 09:00:25,117 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790045206]
[2023-10-26 09:00:25,118 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-26 09:00:25,118 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:00:25,118 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:00:25,119 INFO  L229       MonitoredProcess]: Starting monitored process 15 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:00:25,161 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2023-10-26 09:00:25,342 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 09:00:25,342 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 09:00:25,358 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 42 conjunts are in the unsatisfiable core
[2023-10-26 09:00:25,360 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 09:00:25,417 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 09:00:25,439 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 09:00:25,440 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 11 treesize of output 11
[2023-10-26 09:00:25,544 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 09:00:25,609 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 09:00:25,622 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 09:00:25,673 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 09:00:25,726 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 09:00:25,790 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 09:00:25,845 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:00:25,845 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 09:00:25,877 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false
[2023-10-26 09:00:26,075 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false
[2023-10-26 09:00:26,089 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2023-10-26 09:00:26,200 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:00:26,200 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [790045206] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 09:00:26,200 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 09:00:26,200 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2023-10-26 09:00:26,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688307597]
[2023-10-26 09:00:26,200 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 09:00:26,201 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 09:00:26,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:00:26,201 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 09:00:26,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=414, Unknown=13, NotChecked=132, Total=650
[2023-10-26 09:00:26,324 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-26 09:00:26,325 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 4840 transitions, 99613 flow. Second operand  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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:00:26,325 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:00:26,326 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-26 09:00:26,326 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:01:16,244 INFO  L130       PetriNetUnfolder]: 33457/57317 cut-off events.
[2023-10-26 09:01:16,244 INFO  L131       PetriNetUnfolder]: For 2928608/2928634 co-relation queries the response was YES.
[2023-10-26 09:01:17,129 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 675531 conditions, 57317 events. 33457/57317 cut-off events. For 2928608/2928634 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 472331 event pairs, 2420 based on Foata normal form. 184/55469 useless extension candidates. Maximal degree in co-relation 669066. Up to 22990 conditions per place. 
[2023-10-26 09:01:17,671 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 3860 selfloop transitions, 2116 changer transitions 0/5980 dead transitions.
[2023-10-26 09:01:17,671 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 5980 transitions, 136763 flow
[2023-10-26 09:01:17,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-26 09:01:17,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-26 09:01:17,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1588 transitions.
[2023-10-26 09:01:17,673 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3308333333333333
[2023-10-26 09:01:17,673 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1588 transitions.
[2023-10-26 09:01:17,673 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1588 transitions.
[2023-10-26 09:01:17,674 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:01:17,674 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1588 transitions.
[2023-10-26 09:01:17,675 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 63.52) internal successors, (1588), 25 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 09:01:17,678 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 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:17,678 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 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:17,678 INFO  L175             Difference]: Start difference. First operand has 422 places, 4840 transitions, 99613 flow. Second operand 25 states and 1588 transitions.
[2023-10-26 09:01:17,678 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 5980 transitions, 136763 flow
[2023-10-26 09:02:43,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 5980 transitions, 134508 flow, removed 720 selfloop flow, removed 13 redundant places.
[2023-10-26 09:02:43,707 INFO  L231             Difference]: Finished difference. Result has 451 places, 5469 transitions, 123099 flow
[2023-10-26 09:02:43,721 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=97634, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1597, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=123099, PETRI_PLACES=451, PETRI_TRANSITIONS=5469}
[2023-10-26 09:02:43,733 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 394 predicate places.
[2023-10-26 09:02:43,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 451 places, 5469 transitions, 123099 flow
[2023-10-26 09:02:43,734 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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:02:43,734 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:02:43,734 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 09:02:43,741 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2023-10-26 09:02:43,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:02:43,940 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 09:02:43,941 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:02:43,941 INFO  L85        PathProgramCache]: Analyzing trace with hash -159175320, now seen corresponding path program 1 times
[2023-10-26 09:02:43,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:02:43,941 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835278280]
[2023-10-26 09:02:43,942 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:02:43,942 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:02:43,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:02:44,416 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 09:02:44,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:02:44,417 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835278280]
[2023-10-26 09:02:44,417 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835278280] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 09:02:44,417 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749619792]
[2023-10-26 09:02:44,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:02:44,417 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:02:44,417 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:02:44,418 INFO  L229       MonitoredProcess]: Starting monitored process 16 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:02:44,451 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2023-10-26 09:02:44,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:02:44,595 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-26 09:02:44,598 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 09:02:44,600 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 09:02:44,615 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 09:02:44,615 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 11 treesize of output 11
[2023-10-26 09:02:44,635 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 09:02:44,648 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 09:02:44,658 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-10-26 09:02:44,666 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 09:02:44,674 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 09:02:44,685 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 09:02:44,685 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 09:02:44,705 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 09:02:44,705 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 09:02:44,719 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-26 09:02:44,727 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 09:02:44,728 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 09:02:44,766 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))))) is different from false
[2023-10-26 09:02:44,913 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3) |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-10-26 09:02:44,931 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3) |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-10-26 09:02:45,040 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 09:02:45,040 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [749619792] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 09:02:45,040 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 09:02:45,040 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14
[2023-10-26 09:02:45,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280171432]
[2023-10-26 09:02:45,040 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 09:02:45,041 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-10-26 09:02:45,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:02:45,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-10-26 09:02:45,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=9, NotChecked=72, Total=240
[2023-10-26 09:02:45,137 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-26 09:02:45,137 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 5469 transitions, 123099 flow. Second operand  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:02:45,138 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:02:45,138 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-26 09:02:45,138 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:03:45,084 INFO  L130       PetriNetUnfolder]: 33456/57201 cut-off events.
[2023-10-26 09:03:45,085 INFO  L131       PetriNetUnfolder]: For 3318944/3318972 co-relation queries the response was YES.
[2023-10-26 09:03:46,022 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 704513 conditions, 57201 events. 33456/57201 cut-off events. For 3318944/3318972 co-relation queries the response was YES. Maximal size of possible extension queue 1718. Compared 469188 event pairs, 5576 based on Foata normal form. 2/55170 useless extension candidates. Maximal degree in co-relation 703678. Up to 50485 conditions per place. 
[2023-10-26 09:03:46,531 INFO  L137   encePairwiseOnDemand]: 168/192 looper letters, 4522 selfloop transitions, 1107 changer transitions 0/5633 dead transitions.
[2023-10-26 09:03:46,532 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 5633 transitions, 137877 flow
[2023-10-26 09:03:46,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-26 09:03:46,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-26 09:03:46,546 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 816 transitions.
[2023-10-26 09:03:46,552 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3541666666666667
[2023-10-26 09:03:46,552 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 816 transitions.
[2023-10-26 09:03:46,552 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 816 transitions.
[2023-10-26 09:03:46,552 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:03:46,552 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 816 transitions.
[2023-10-26 09:03:46,554 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 68.0) internal successors, (816), 12 states have internal predecessors, (816), 0 states have call successors, (0), 0 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:46,555 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 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:46,555 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 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:46,555 INFO  L175             Difference]: Start difference. First operand has 451 places, 5469 transitions, 123099 flow. Second operand 12 states and 816 transitions.
[2023-10-26 09:03:46,555 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 5633 transitions, 137877 flow
[2023-10-26 09:05:11,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 5633 transitions, 133616 flow, removed 2125 selfloop flow, removed 4 redundant places.
[2023-10-26 09:05:11,816 INFO  L231             Difference]: Finished difference. Result has 460 places, 5470 transitions, 121337 flow
[2023-10-26 09:05:11,829 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=118838, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=121337, PETRI_PLACES=460, PETRI_TRANSITIONS=5470}
[2023-10-26 09:05:11,845 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 403 predicate places.
[2023-10-26 09:05:11,846 INFO  L495      AbstractCegarLoop]: Abstraction has has 460 places, 5470 transitions, 121337 flow
[2023-10-26 09:05:11,846 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 09:05:11,846 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 09:05:11,846 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]
[2023-10-26 09:05:11,853 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2023-10-26 09:05:12,050 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:05:12,051 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 09:05:12,051 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 09:05:12,051 INFO  L85        PathProgramCache]: Analyzing trace with hash 818731398, now seen corresponding path program 1 times
[2023-10-26 09:05:12,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 09:05:12,052 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029847518]
[2023-10-26 09:05:12,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:05:12,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 09:05:12,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:05:12,514 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:05:12,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 09:05:12,514 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029847518]
[2023-10-26 09:05:12,514 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029847518] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 09:05:12,514 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502889035]
[2023-10-26 09:05:12,514 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 09:05:12,514 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 09:05:12,514 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 09:05:12,516 INFO  L229       MonitoredProcess]: Starting monitored process 17 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:05:12,547 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2023-10-26 09:05:12,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 09:05:12,691 INFO  L263         TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-10-26 09:05:12,695 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 09:05:12,704 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-26 09:05:12,731 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 09:05:12,731 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 11 treesize of output 11
[2023-10-26 09:05:12,834 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 09:05:12,861 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-26 09:05:12,929 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 30 treesize of output 30
[2023-10-26 09:05:12,947 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 30 treesize of output 30
[2023-10-26 09:05:12,961 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 30 treesize of output 30
[2023-10-26 09:05:12,993 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-26 09:05:13,049 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-26 09:05:13,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 54 treesize of output 50
[2023-10-26 09:05:13,169 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:05:13,170 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 09:05:13,203 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2023-10-26 09:05:13,219 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false
[2023-10-26 09:05:13,240 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2023-10-26 09:05:13,266 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse6 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0))))) is different from false
[2023-10-26 09:05:13,313 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= 0 (select (select (store (let ((.cse6 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2)))))) is different from false
[2023-10-26 09:05:13,421 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:05:13,422 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502889035] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 09:05:13,422 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 09:05:13,422 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25
[2023-10-26 09:05:13,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780537369]
[2023-10-26 09:05:13,422 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 09:05:13,422 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-26 09:05:13,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 09:05:13,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-26 09:05:13,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=390, Unknown=5, NotChecked=220, Total=702
[2023-10-26 09:05:13,559 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-26 09:05:13,560 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 5470 transitions, 121337 flow. Second operand  has 27 states, 27 states have (on average 50.0) internal successors, (1350), 27 states have internal predecessors, (1350), 0 states have call successors, (0), 0 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:05:13,560 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 09:05:13,560 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-26 09:05:13,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 09:06:14,353 INFO  L130       PetriNetUnfolder]: 33432/57261 cut-off events.
[2023-10-26 09:06:14,355 INFO  L131       PetriNetUnfolder]: For 3329294/3329306 co-relation queries the response was YES.
[2023-10-26 09:06:15,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 699705 conditions, 57261 events. 33432/57261 cut-off events. For 3329294/3329306 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 472147 event pairs, 1957 based on Foata normal form. 28/55237 useless extension candidates. Maximal degree in co-relation 698904. Up to 26910 conditions per place. 
[2023-10-26 09:06:15,828 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 4071 selfloop transitions, 1882 changer transitions 0/5957 dead transitions.
[2023-10-26 09:06:15,828 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 5957 transitions, 142056 flow
[2023-10-26 09:06:15,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-10-26 09:06:15,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2023-10-26 09:06:15,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1539 transitions.
[2023-10-26 09:06:15,831 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.333984375
[2023-10-26 09:06:15,831 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1539 transitions.
[2023-10-26 09:06:15,832 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1539 transitions.
[2023-10-26 09:06:15,833 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 09:06:15,833 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1539 transitions.
[2023-10-26 09:06:15,834 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 64.125) internal successors, (1539), 24 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:06:15,836 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 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:06:15,836 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 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:06:15,837 INFO  L175             Difference]: Start difference. First operand has 460 places, 5470 transitions, 121337 flow. Second operand 24 states and 1539 transitions.
[2023-10-26 09:06:15,837 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 5957 transitions, 142056 flow
Killed by 15
