./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-27 12:34:36,773 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-27 12:34:36,776 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-27 12:34:36,847 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-27 12:34:36,847 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-27 12:34:36,850 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-27 12:34:36,851 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-27 12:34:36,853 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-27 12:34:36,855 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-27 12:34:36,859 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-27 12:34:36,860 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-27 12:34:36,861 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-27 12:34:36,861 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-27 12:34:36,863 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-27 12:34:36,865 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-27 12:34:36,865 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-27 12:34:36,867 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-27 12:34:36,867 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-27 12:34:36,869 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-27 12:34:36,874 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-27 12:34:36,875 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-27 12:34:36,876 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-27 12:34:36,878 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-27 12:34:36,878 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-27 12:34:36,896 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-27 12:34:36,896 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-27 12:34:36,897 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-27 12:34:36,898 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-27 12:34:36,898 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-27 12:34:36,899 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-27 12:34:36,899 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-27 12:34:36,900 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-27 12:34:36,901 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-27 12:34:36,902 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-27 12:34:36,903 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-27 12:34:36,903 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-27 12:34:36,903 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-27 12:34:36,903 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-27 12:34:36,904 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-27 12:34:36,904 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-27 12:34:36,905 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-27 12:34:36,906 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-27 12:34:36,944 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-27 12:34:36,944 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-27 12:34:36,945 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-27 12:34:36,945 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-27 12:34:36,946 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-27 12:34:36,961 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-27 12:34:36,962 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-27 12:34:36,962 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-27 12:34:36,962 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-27 12:34:36,963 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-27 12:34:36,964 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-27 12:34:36,964 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-27 12:34:36,964 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-27 12:34:36,964 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-27 12:34:36,964 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-27 12:34:36,964 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-27 12:34:36,965 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-27 12:34:36,965 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-27 12:34:36,965 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-27 12:34:36,965 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-27 12:34:36,965 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-27 12:34:36,965 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-27 12:34:36,966 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-27 12:34:36,966 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-27 12:34:36,966 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-27 12:34:36,966 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-27 12:34:36,966 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:34:36,966 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-27 12:34:36,967 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-27 12:34:36,967 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-27 12:34:36,967 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-27 12:34:36,968 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-27 12:34:36,968 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-27 12:34:36,969 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-27 12:34:36,969 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-27 12:34:36,969 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-27 12:34:36,969 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-27 12:34:36,969 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-27 12:34:37,370 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-27 12:34:37,400 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-27 12:34:37,402 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-27 12:34:37,410 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-27 12:34:37,411 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-27 12:34:37,412 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-27 12:34:39,150 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-27 12:34:39,575 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-27 12:34:39,580 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2023-10-27 12:34:39,611 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/46e3be1aa/2919cba4019847afacd92a45d9da0d56/FLAGb3aeee610
[2023-10-27 12:34:39,668 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/46e3be1aa/2919cba4019847afacd92a45d9da0d56
[2023-10-27 12:34:39,670 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-27 12:34:39,671 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-27 12:34:39,672 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-27 12:34:39,673 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-27 12:34:39,676 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-27 12:34:39,693 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:34:39" (1/1) ...
[2023-10-27 12:34:39,694 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642914f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:39, skipping insertion in model container
[2023-10-27 12:34:39,695 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:34:39" (1/1) ...
[2023-10-27 12:34:39,701 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-27 12:34:39,789 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-27 12:34:40,061 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:34:40,466 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:34:40,488 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-27 12:34:40,529 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:34:40,566 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:34:40,639 INFO  L208         MainTranslator]: Completed translation
[2023-10-27 12:34:40,642 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40 WrapperNode
[2023-10-27 12:34:40,642 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-27 12:34:40,644 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-27 12:34:40,650 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-27 12:34:40,650 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-27 12:34:40,655 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,677 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,721 INFO  L138                Inliner]: procedures = 264, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74
[2023-10-27 12:34:40,722 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-27 12:34:40,722 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-27 12:34:40,723 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-27 12:34:40,723 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-27 12:34:40,731 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,732 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,751 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,752 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,764 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,782 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,784 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,785 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,787 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-27 12:34:40,787 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-27 12:34:40,787 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-27 12:34:40,788 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-27 12:34:40,788 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (1/1) ...
[2023-10-27 12:34:40,792 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:34:40,811 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:34:40,827 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-27 12:34:40,862 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-27 12:34:40,867 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-27 12:34:40,867 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-27 12:34:40,867 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-27 12:34:40,869 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-27 12:34:40,869 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-27 12:34:40,869 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2023-10-27 12:34:40,869 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-27 12:34:40,869 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-27 12:34:40,869 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-27 12:34:40,870 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-27 12:34:40,871 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-27 12:34:41,062 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-27 12:34:41,069 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-27 12:34:41,437 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-27 12:34:41,443 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-27 12:34:41,462 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-27 12:34:41,464 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:34:41 BoogieIcfgContainer
[2023-10-27 12:34:41,464 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-27 12:34:41,466 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-27 12:34:41,466 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-27 12:34:41,468 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-27 12:34:41,471 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:34:39" (1/3) ...
[2023-10-27 12:34:41,472 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66435a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:34:41, skipping insertion in model container
[2023-10-27 12:34:41,474 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:34:40" (2/3) ...
[2023-10-27 12:34:41,474 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66435a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:34:41, skipping insertion in model container
[2023-10-27 12:34:41,474 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:34:41" (3/3) ...
[2023-10-27 12:34:41,475 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i
[2023-10-27 12:34:41,500 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-27 12:34:41,509 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-27 12:34:41,510 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2023-10-27 12:34:41,510 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-27 12:34:41,637 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-27 12:34:41,708 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2023-10-27 12:34:41,825 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2023-10-27 12:34:41,825 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:34:41,829 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-27 12:34:41,829 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 210 flow
[2023-10-27 12:34:41,834 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 210 flow
[2023-10-27 12:34:41,844 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:34:41,872 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 101 transitions, 210 flow
[2023-10-27 12:34:41,889 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 101 transitions, 210 flow
[2023-10-27 12:34:41,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2023-10-27 12:34:41,958 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2023-10-27 12:34:41,960 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:34:41,961 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-27 12:34:41,964 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1410
[2023-10-27 12:34:44,926 INFO  L134        LiptonReduction]: Checked pairs total: 5574
[2023-10-27 12:34:44,927 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2023-10-27 12:34:44,963 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:34:44,970 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;@fae9129, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:34:44,985 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-10-27 12:34:44,992 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2023-10-27 12:34:44,992 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:34:44,993 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:34:44,994 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:34:44,994 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-27 12:34:44,998 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:34:44,998 INFO  L85        PathProgramCache]: Analyzing trace with hash -1050340217, now seen corresponding path program 1 times
[2023-10-27 12:34:45,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:34:45,022 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635722873]
[2023-10-27 12:34:45,022 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:45,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:34:45,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:34:45,995 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-27 12:34:45,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:34:45,996 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635722873]
[2023-10-27 12:34:45,997 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635722873] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:34:45,997 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:34:45,997 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:34:45,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663708079]
[2023-10-27 12:34:45,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:34:46,006 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:34:46,006 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:34:46,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:34:46,058 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:34:46,333 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 68 out of 176
[2023-10-27 12:34:46,337 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-27 12:34:46,337 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:34:46,337 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 176
[2023-10-27 12:34:46,338 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:34:46,582 INFO  L130       PetriNetUnfolder]: 135/363 cut-off events.
[2023-10-27 12:34:46,582 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:34:46,584 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-27 12:34:46,587 INFO  L137   encePairwiseOnDemand]: 165/176 looper letters, 37 selfloop transitions, 21 changer transitions 0/65 dead transitions.
[2023-10-27 12:34:46,587 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 254 flow
[2023-10-27 12:34:46,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:34:46,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:34:46,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions.
[2023-10-27 12:34:46,617 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4431818181818182
[2023-10-27 12:34:46,618 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 468 transitions.
[2023-10-27 12:34:46,618 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 468 transitions.
[2023-10-27 12:34:46,621 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:34:46,623 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 468 transitions.
[2023-10-27 12:34:46,627 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-27 12:34:46,644 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-27 12:34:46,645 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-27 12:34:46,646 INFO  L175             Difference]: Start difference. First operand has 40 places, 38 transitions, 84 flow. Second operand 6 states and 468 transitions.
[2023-10-27 12:34:46,647 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 254 flow
[2023-10-27 12:34:46,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:34:46,651 INFO  L231             Difference]: Finished difference. Result has 48 places, 57 transitions, 206 flow
[2023-10-27 12:34:46,652 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-27 12:34:46,669 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places.
[2023-10-27 12:34:46,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 57 transitions, 206 flow
[2023-10-27 12:34:46,670 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-27 12:34:46,670 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:34:46,670 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:34:46,670 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-27 12:34:46,673 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-27 12:34:46,674 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:34:46,675 INFO  L85        PathProgramCache]: Analyzing trace with hash 647833824, now seen corresponding path program 1 times
[2023-10-27 12:34:46,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:34:46,676 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704381305]
[2023-10-27 12:34:46,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:46,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:34:46,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:34:46,775 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-27 12:34:46,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:34:46,776 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704381305]
[2023-10-27 12:34:46,776 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704381305] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:34:46,777 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:34:46,777 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:34:46,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068406581]
[2023-10-27 12:34:46,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:34:46,781 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-27 12:34:46,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:34:46,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-27 12:34:46,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-27 12:34:46,896 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 176
[2023-10-27 12:34:46,896 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-27 12:34:46,897 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:34:46,897 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 176
[2023-10-27 12:34:46,897 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:34:47,002 INFO  L130       PetriNetUnfolder]: 55/234 cut-off events.
[2023-10-27 12:34:47,003 INFO  L131       PetriNetUnfolder]: For 28/36 co-relation queries the response was YES.
[2023-10-27 12:34:47,022 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-27 12:34:47,023 INFO  L137   encePairwiseOnDemand]: 172/176 looper letters, 25 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2023-10-27 12:34:47,023 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 290 flow
[2023-10-27 12:34:47,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:34:47,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:34:47,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions.
[2023-10-27 12:34:47,025 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.546875
[2023-10-27 12:34:47,025 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 385 transitions.
[2023-10-27 12:34:47,025 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 385 transitions.
[2023-10-27 12:34:47,026 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:34:47,026 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 385 transitions.
[2023-10-27 12:34:47,027 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-27 12:34:47,028 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-27 12:34:47,029 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-27 12:34:47,029 INFO  L175             Difference]: Start difference. First operand has 48 places, 57 transitions, 206 flow. Second operand 4 states and 385 transitions.
[2023-10-27 12:34:47,029 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 290 flow
[2023-10-27 12:34:47,033 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:34:47,034 INFO  L231             Difference]: Finished difference. Result has 53 places, 57 transitions, 216 flow
[2023-10-27 12:34:47,034 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-27 12:34:47,035 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places.
[2023-10-27 12:34:47,035 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 216 flow
[2023-10-27 12:34:47,035 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-27 12:34:47,036 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:34:47,036 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:34:47,036 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-27 12:34:47,036 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-27 12:34:47,037 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:34:47,037 INFO  L85        PathProgramCache]: Analyzing trace with hash -516340613, now seen corresponding path program 1 times
[2023-10-27 12:34:47,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:34:47,038 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295136960]
[2023-10-27 12:34:47,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:47,038 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:34:47,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:34:47,494 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-27 12:34:47,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:34:47,495 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295136960]
[2023-10-27 12:34:47,495 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295136960] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:34:47,496 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:34:47,496 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:34:47,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792554452]
[2023-10-27 12:34:47,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:34:47,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:34:47,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:34:47,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:34:47,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:34:47,716 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 176
[2023-10-27 12:34:47,716 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-27 12:34:47,716 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:34:47,717 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 176
[2023-10-27 12:34:47,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:34:48,139 INFO  L130       PetriNetUnfolder]: 193/497 cut-off events.
[2023-10-27 12:34:48,139 INFO  L131       PetriNetUnfolder]: For 111/115 co-relation queries the response was YES.
[2023-10-27 12:34:48,140 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-27 12:34:48,142 INFO  L137   encePairwiseOnDemand]: 158/176 looper letters, 68 selfloop transitions, 57 changer transitions 5/137 dead transitions.
[2023-10-27 12:34:48,142 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 137 transitions, 714 flow
[2023-10-27 12:34:48,143 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:34:48,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:34:48,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions.
[2023-10-27 12:34:48,145 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5085227272727273
[2023-10-27 12:34:48,145 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 537 transitions.
[2023-10-27 12:34:48,145 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions.
[2023-10-27 12:34:48,145 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:34:48,146 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions.
[2023-10-27 12:34:48,147 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-27 12:34:48,148 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-27 12:34:48,149 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-27 12:34:48,149 INFO  L175             Difference]: Start difference. First operand has 53 places, 57 transitions, 216 flow. Second operand 6 states and 537 transitions.
[2023-10-27 12:34:48,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 137 transitions, 714 flow
[2023-10-27 12:34:48,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 137 transitions, 692 flow, removed 5 selfloop flow, removed 3 redundant places.
[2023-10-27 12:34:48,156 INFO  L231             Difference]: Finished difference. Result has 58 places, 108 transitions, 562 flow
[2023-10-27 12:34:48,156 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-27 12:34:48,157 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places.
[2023-10-27 12:34:48,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 108 transitions, 562 flow
[2023-10-27 12:34:48,158 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-27 12:34:48,158 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:34:48,158 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:34:48,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-27 12:34:48,161 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-27 12:34:48,162 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:34:48,162 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831922026, now seen corresponding path program 1 times
[2023-10-27 12:34:48,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:34:48,162 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445520577]
[2023-10-27 12:34:48,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:48,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:34:48,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:34:48,664 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-27 12:34:48,664 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:34:48,664 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445520577]
[2023-10-27 12:34:48,664 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445520577] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:34:48,664 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:34:48,666 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:34:48,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424354819]
[2023-10-27 12:34:48,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:34:48,667 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:34:48,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:34:48,668 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:34:48,669 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:34:48,920 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 176
[2023-10-27 12:34:48,921 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-27 12:34:48,921 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:34:48,921 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 176
[2023-10-27 12:34:48,921 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:34:49,113 INFO  L130       PetriNetUnfolder]: 200/560 cut-off events.
[2023-10-27 12:34:49,113 INFO  L131       PetriNetUnfolder]: For 335/347 co-relation queries the response was YES.
[2023-10-27 12:34:49,115 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-27 12:34:49,120 INFO  L137   encePairwiseOnDemand]: 165/176 looper letters, 87 selfloop transitions, 29 changer transitions 0/142 dead transitions.
[2023-10-27 12:34:49,133 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 142 transitions, 968 flow
[2023-10-27 12:34:49,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:34:49,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:34:49,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions.
[2023-10-27 12:34:49,135 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4630681818181818
[2023-10-27 12:34:49,135 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 489 transitions.
[2023-10-27 12:34:49,135 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 489 transitions.
[2023-10-27 12:34:49,136 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:34:49,137 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 489 transitions.
[2023-10-27 12:34:49,138 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-27 12:34:49,140 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-27 12:34:49,140 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-27 12:34:49,140 INFO  L175             Difference]: Start difference. First operand has 58 places, 108 transitions, 562 flow. Second operand 6 states and 489 transitions.
[2023-10-27 12:34:49,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 142 transitions, 968 flow
[2023-10-27 12:34:49,146 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 932 flow, removed 18 selfloop flow, removed 0 redundant places.
[2023-10-27 12:34:49,148 INFO  L231             Difference]: Finished difference. Result has 67 places, 132 transitions, 808 flow
[2023-10-27 12:34:49,149 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-27 12:34:49,156 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places.
[2023-10-27 12:34:49,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 132 transitions, 808 flow
[2023-10-27 12:34:49,157 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-27 12:34:49,157 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:34:49,157 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:34:49,157 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-27 12:34:49,157 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-27 12:34:49,158 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:34:49,158 INFO  L85        PathProgramCache]: Analyzing trace with hash -2007496268, now seen corresponding path program 1 times
[2023-10-27 12:34:49,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:34:49,158 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697868727]
[2023-10-27 12:34:49,158 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:49,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:34:49,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:34:49,206 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:34:49,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:34:49,287 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:34:49,288 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:34:49,289 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-10-27 12:34:49,290 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-10-27 12:34:49,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-10-27 12:34:49,304 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-10-27 12:34:49,305 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-10-27 12:34:49,305 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-10-27 12:34:49,305 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-10-27 12:34:49,305 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-27 12:34:49,305 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-10-27 12:34:49,307 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:34:49,308 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-27 12:34:49,321 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-27 12:34:49,340 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2023-10-27 12:34:49,385 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2023-10-27 12:34:49,385 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-27 12:34:49,386 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-27 12:34:49,386 INFO  L82        GeneralOperation]: Start removeDead. Operand has 118 places, 118 transitions, 254 flow
[2023-10-27 12:34:49,387 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 118 places, 118 transitions, 254 flow
[2023-10-27 12:34:49,387 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:34:49,387 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 118 transitions, 254 flow
[2023-10-27 12:34:49,387 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 118 transitions, 254 flow
[2023-10-27 12:34:49,387 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2023-10-27 12:34:49,428 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2023-10-27 12:34:49,428 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-27 12:34:49,429 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-27 12:34:49,431 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4200
[2023-10-27 12:34:51,746 INFO  L134        LiptonReduction]: Checked pairs total: 17458
[2023-10-27 12:34:51,746 INFO  L136        LiptonReduction]: Total number of compositions: 74
[2023-10-27 12:34:51,748 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:34:51,748 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;@fae9129, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:34:51,748 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-27 12:34:51,752 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2023-10-27 12:34:51,752 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:34:51,752 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:34:51,752 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:34:51,753 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-27 12:34:51,754 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:34:51,754 INFO  L85        PathProgramCache]: Analyzing trace with hash 1843145426, now seen corresponding path program 1 times
[2023-10-27 12:34:51,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:34:51,754 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376217394]
[2023-10-27 12:34:51,754 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:51,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:34:51,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:34:52,003 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-27 12:34:52,003 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:34:52,003 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376217394]
[2023-10-27 12:34:52,003 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376217394] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:34:52,004 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:34:52,004 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:34:52,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077135100]
[2023-10-27 12:34:52,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:34:52,006 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:34:52,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:34:52,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:34:52,009 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:34:52,237 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 192
[2023-10-27 12:34:52,238 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-27 12:34:52,238 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:34:52,238 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 192
[2023-10-27 12:34:52,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:34:53,171 INFO  L130       PetriNetUnfolder]: 2299/4146 cut-off events.
[2023-10-27 12:34:53,171 INFO  L131       PetriNetUnfolder]: For 58/58 co-relation queries the response was YES.
[2023-10-27 12:34:53,190 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-27 12:34:53,233 INFO  L137   encePairwiseOnDemand]: 178/192 looper letters, 58 selfloop transitions, 37 changer transitions 0/106 dead transitions.
[2023-10-27 12:34:53,234 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 420 flow
[2023-10-27 12:34:53,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:34:53,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:34:53,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions.
[2023-10-27 12:34:53,236 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4947916666666667
[2023-10-27 12:34:53,236 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 570 transitions.
[2023-10-27 12:34:53,236 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions.
[2023-10-27 12:34:53,237 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:34:53,237 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions.
[2023-10-27 12:34:53,238 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-27 12:34:53,241 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-27 12:34:53,241 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-27 12:34:53,241 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 570 transitions.
[2023-10-27 12:34:53,241 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 420 flow
[2023-10-27 12:34:53,243 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:34:53,245 INFO  L231             Difference]: Finished difference. Result has 66 places, 90 transitions, 338 flow
[2023-10-27 12:34:53,245 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-27 12:34:53,248 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2023-10-27 12:34:53,248 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 338 flow
[2023-10-27 12:34:53,248 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-27 12:34:53,249 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:34:53,249 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:34:53,249 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-27 12:34:53,249 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-27 12:34:53,250 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:34:53,250 INFO  L85        PathProgramCache]: Analyzing trace with hash 37653776, now seen corresponding path program 1 times
[2023-10-27 12:34:53,250 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:34:53,250 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283607348]
[2023-10-27 12:34:53,250 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:53,250 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:34:53,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:34:53,316 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-27 12:34:53,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:34:53,316 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283607348]
[2023-10-27 12:34:53,319 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283607348] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:34:53,319 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:34:53,319 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:34:53,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100602454]
[2023-10-27 12:34:53,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:34:53,319 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-27 12:34:53,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:34:53,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-27 12:34:53,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-27 12:34:53,417 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 192
[2023-10-27 12:34:53,417 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-27 12:34:53,418 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:34:53,418 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 192
[2023-10-27 12:34:53,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:34:53,797 INFO  L130       PetriNetUnfolder]: 831/2045 cut-off events.
[2023-10-27 12:34:53,813 INFO  L131       PetriNetUnfolder]: For 351/391 co-relation queries the response was YES.
[2023-10-27 12:34:53,818 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-27 12:34:53,825 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 31 selfloop transitions, 2 changer transitions 2/100 dead transitions.
[2023-10-27 12:34:53,825 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 436 flow
[2023-10-27 12:34:53,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:34:53,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:34:53,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions.
[2023-10-27 12:34:53,827 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.58203125
[2023-10-27 12:34:53,827 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 447 transitions.
[2023-10-27 12:34:53,827 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions.
[2023-10-27 12:34:53,827 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:34:53,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions.
[2023-10-27 12:34:53,829 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-27 12:34:53,830 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-27 12:34:53,830 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-27 12:34:53,830 INFO  L175             Difference]: Start difference. First operand has 66 places, 90 transitions, 338 flow. Second operand 4 states and 447 transitions.
[2023-10-27 12:34:53,845 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 436 flow
[2023-10-27 12:34:53,847 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 436 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:34:53,850 INFO  L231             Difference]: Finished difference. Result has 71 places, 91 transitions, 352 flow
[2023-10-27 12:34:53,850 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-27 12:34:53,851 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places.
[2023-10-27 12:34:53,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 352 flow
[2023-10-27 12:34:53,852 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-27 12:34:53,852 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:34:53,852 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:34:53,852 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-27 12:34:53,853 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-27 12:34:53,854 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:34:53,854 INFO  L85        PathProgramCache]: Analyzing trace with hash -1297270937, now seen corresponding path program 1 times
[2023-10-27 12:34:53,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:34:53,856 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480730398]
[2023-10-27 12:34:53,856 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:53,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:34:53,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:34:54,189 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-27 12:34:54,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:34:54,189 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480730398]
[2023-10-27 12:34:54,189 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480730398] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:34:54,190 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:34:54,195 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:34:54,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412690916]
[2023-10-27 12:34:54,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:34:54,196 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:34:54,196 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:34:54,197 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:34:54,197 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:34:54,360 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 192
[2023-10-27 12:34:54,361 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-27 12:34:54,361 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:34:54,361 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 192
[2023-10-27 12:34:54,361 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:34:55,734 INFO  L130       PetriNetUnfolder]: 3649/6392 cut-off events.
[2023-10-27 12:34:55,734 INFO  L131       PetriNetUnfolder]: For 1465/1507 co-relation queries the response was YES.
[2023-10-27 12:34:55,754 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-27 12:34:55,819 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 131 selfloop transitions, 89 changer transitions 0/231 dead transitions.
[2023-10-27 12:34:55,819 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 231 transitions, 1222 flow
[2023-10-27 12:34:55,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:34:55,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:34:55,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions.
[2023-10-27 12:34:55,821 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2023-10-27 12:34:55,821 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 672 transitions.
[2023-10-27 12:34:55,822 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions.
[2023-10-27 12:34:55,822 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:34:55,822 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions.
[2023-10-27 12:34:55,824 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-27 12:34:55,826 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-27 12:34:55,826 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-27 12:34:55,826 INFO  L175             Difference]: Start difference. First operand has 71 places, 91 transitions, 352 flow. Second operand 6 states and 672 transitions.
[2023-10-27 12:34:55,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 231 transitions, 1222 flow
[2023-10-27 12:34:55,839 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 231 transitions, 1206 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-10-27 12:34:55,849 INFO  L231             Difference]: Finished difference. Result has 77 places, 175 transitions, 910 flow
[2023-10-27 12:34:55,849 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-27 12:34:55,852 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2023-10-27 12:34:55,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 175 transitions, 910 flow
[2023-10-27 12:34:55,852 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-27 12:34:55,852 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:34:55,852 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-27 12:34:55,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-27 12:34:55,853 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-27 12:34:55,853 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:34:55,853 INFO  L85        PathProgramCache]: Analyzing trace with hash 490022662, now seen corresponding path program 1 times
[2023-10-27 12:34:55,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:34:55,853 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524890534]
[2023-10-27 12:34:55,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:55,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:34:55,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:34:56,168 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-27 12:34:56,168 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:34:56,168 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524890534]
[2023-10-27 12:34:56,169 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524890534] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:34:56,169 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:34:56,169 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:34:56,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395097903]
[2023-10-27 12:34:56,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:34:56,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:34:56,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:34:56,170 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:34:56,170 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:34:56,421 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 192
[2023-10-27 12:34:56,422 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-27 12:34:56,422 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:34:56,422 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 192
[2023-10-27 12:34:56,422 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:34:58,213 INFO  L130       PetriNetUnfolder]: 4197/7805 cut-off events.
[2023-10-27 12:34:58,213 INFO  L131       PetriNetUnfolder]: For 6317/6605 co-relation queries the response was YES.
[2023-10-27 12:34:58,223 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-27 12:34:58,290 INFO  L137   encePairwiseOnDemand]: 172/192 looper letters, 160 selfloop transitions, 69 changer transitions 0/258 dead transitions.
[2023-10-27 12:34:58,302 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 258 transitions, 1801 flow
[2023-10-27 12:34:58,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:34:58,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:34:58,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions.
[2023-10-27 12:34:58,304 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5243055555555556
[2023-10-27 12:34:58,304 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 604 transitions.
[2023-10-27 12:34:58,304 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions.
[2023-10-27 12:34:58,305 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:34:58,305 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions.
[2023-10-27 12:34:58,306 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-27 12:34:58,307 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-27 12:34:58,308 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-27 12:34:58,308 INFO  L175             Difference]: Start difference. First operand has 77 places, 175 transitions, 910 flow. Second operand 6 states and 604 transitions.
[2023-10-27 12:34:58,308 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 258 transitions, 1801 flow
[2023-10-27 12:34:58,387 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 258 transitions, 1701 flow, removed 50 selfloop flow, removed 0 redundant places.
[2023-10-27 12:34:58,405 INFO  L231             Difference]: Finished difference. Result has 87 places, 235 transitions, 1526 flow
[2023-10-27 12:34:58,405 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-27 12:34:58,406 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places.
[2023-10-27 12:34:58,407 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 235 transitions, 1526 flow
[2023-10-27 12:34:58,408 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-27 12:34:58,408 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:34:58,408 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:34:58,408 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-27 12:34:58,408 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-27 12:34:58,408 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:34:58,408 INFO  L85        PathProgramCache]: Analyzing trace with hash -1420041874, now seen corresponding path program 1 times
[2023-10-27 12:34:58,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:34:58,409 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148086589]
[2023-10-27 12:34:58,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:58,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:34:58,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:34:59,025 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-27 12:34:59,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:34:59,026 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148086589]
[2023-10-27 12:34:59,026 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148086589] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:34:59,026 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489064395]
[2023-10-27 12:34:59,027 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:34:59,027 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:34:59,027 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:34:59,029 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-27 12:34:59,071 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-27 12:34:59,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:34:59,227 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-27 12:34:59,238 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:34:59,304 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-27 12:34:59,358 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:34:59,358 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-27 12:34:59,407 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-27 12:34:59,441 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-27 12:34:59,488 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:34:59,489 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-27 12:34:59,540 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:34:59,541 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-27 12:34:59,641 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-27 12:34:59,674 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-27 12:34:59,674 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:34:59,899 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-27 12:34:59,899 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [489064395] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:34:59,899 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:34:59,899 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2023-10-27 12:34:59,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675964015]
[2023-10-27 12:34:59,902 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:34:59,903 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-10-27 12:34:59,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:34:59,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-10-27 12:34:59,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2023-10-27 12:35:00,739 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-10-27 12:35:00,740 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-27 12:35:00,740 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:35:00,740 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-10-27 12:35:00,740 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:35:03,442 INFO  L130       PetriNetUnfolder]: 4656/8478 cut-off events.
[2023-10-27 12:35:03,451 INFO  L131       PetriNetUnfolder]: For 12874/13089 co-relation queries the response was YES.
[2023-10-27 12:35:03,514 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-27 12:35:03,648 INFO  L137   encePairwiseOnDemand]: 172/192 looper letters, 329 selfloop transitions, 74 changer transitions 0/415 dead transitions.
[2023-10-27 12:35:03,654 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 415 transitions, 3510 flow
[2023-10-27 12:35:03,655 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-27 12:35:03,655 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-27 12:35:03,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions.
[2023-10-27 12:35:03,675 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.45928030303030304
[2023-10-27 12:35:03,675 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 970 transitions.
[2023-10-27 12:35:03,675 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions.
[2023-10-27 12:35:03,676 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:35:03,676 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions.
[2023-10-27 12:35:03,680 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-27 12:35:03,686 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-27 12:35:03,687 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-27 12:35:03,687 INFO  L175             Difference]: Start difference. First operand has 87 places, 235 transitions, 1526 flow. Second operand 11 states and 970 transitions.
[2023-10-27 12:35:03,687 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 415 transitions, 3510 flow
[2023-10-27 12:35:03,815 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 415 transitions, 3274 flow, removed 118 selfloop flow, removed 0 redundant places.
[2023-10-27 12:35:03,819 INFO  L231             Difference]: Finished difference. Result has 104 places, 271 transitions, 1985 flow
[2023-10-27 12:35:03,826 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-27 12:35:03,827 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 47 predicate places.
[2023-10-27 12:35:03,827 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 271 transitions, 1985 flow
[2023-10-27 12:35:03,828 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-27 12:35:03,828 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:35:03,828 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:35:03,838 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-27 12:35:04,032 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-27 12:35:04,033 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-27 12:35:04,034 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:35:04,034 INFO  L85        PathProgramCache]: Analyzing trace with hash 668269293, now seen corresponding path program 1 times
[2023-10-27 12:35:04,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:35:04,035 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016954830]
[2023-10-27 12:35:04,035 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:35:04,035 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:35:04,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:35:04,573 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-27 12:35:04,573 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:35:04,573 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016954830]
[2023-10-27 12:35:04,573 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016954830] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:35:04,573 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516022852]
[2023-10-27 12:35:04,573 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:35:04,574 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:35:04,574 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:35:04,575 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-27 12:35:04,611 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-27 12:35:04,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:35:04,737 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-27 12:35:04,740 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:35:04,758 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-27 12:35:04,770 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:35:04,771 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-27 12:35:04,809 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-27 12:35:04,824 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-27 12:35:04,857 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:35:04,857 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-27 12:35:04,881 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:35:04,881 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-27 12:35:04,925 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-27 12:35:04,936 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-27 12:35:04,937 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:35:04,978 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-27 12:35:05,017 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-27 12:35:05,048 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-27 12:35:05,182 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-27 12:35:05,183 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [516022852] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:35:05,183 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:35:05,183 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13
[2023-10-27 12:35:05,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205503444]
[2023-10-27 12:35:05,184 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:35:05,184 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2023-10-27 12:35:05,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:35:05,185 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2023-10-27 12:35:05,185 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210
[2023-10-27 12:35:05,284 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 192
[2023-10-27 12:35:05,285 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-27 12:35:05,285 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:35:05,285 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 192
[2023-10-27 12:35:05,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:35:10,031 INFO  L130       PetriNetUnfolder]: 9089/15228 cut-off events.
[2023-10-27 12:35:10,032 INFO  L131       PetriNetUnfolder]: For 26270/26274 co-relation queries the response was YES.
[2023-10-27 12:35:10,074 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-27 12:35:10,229 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 578 selfloop transitions, 532 changer transitions 9/1123 dead transitions.
[2023-10-27 12:35:10,229 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1123 transitions, 9568 flow
[2023-10-27 12:35:10,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-27 12:35:10,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-27 12:35:10,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1636 transitions.
[2023-10-27 12:35:10,246 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.44846491228070173
[2023-10-27 12:35:10,247 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1636 transitions.
[2023-10-27 12:35:10,247 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1636 transitions.
[2023-10-27 12:35:10,248 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:35:10,248 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1636 transitions.
[2023-10-27 12:35:10,251 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-27 12:35:10,256 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-27 12:35:10,257 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-27 12:35:10,257 INFO  L175             Difference]: Start difference. First operand has 104 places, 271 transitions, 1985 flow. Second operand 19 states and 1636 transitions.
[2023-10-27 12:35:10,257 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 1123 transitions, 9568 flow
[2023-10-27 12:35:10,737 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 1123 transitions, 9556 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-10-27 12:35:10,749 INFO  L231             Difference]: Finished difference. Result has 131 places, 771 transitions, 7820 flow
[2023-10-27 12:35:10,750 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-27 12:35:10,752 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 74 predicate places.
[2023-10-27 12:35:10,752 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 771 transitions, 7820 flow
[2023-10-27 12:35:10,753 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-27 12:35:10,753 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:35:10,753 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:35:10,759 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-27 12:35:10,957 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-27 12:35:10,958 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-27 12:35:10,958 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:35:10,959 INFO  L85        PathProgramCache]: Analyzing trace with hash -220900113, now seen corresponding path program 1 times
[2023-10-27 12:35:10,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:35:10,959 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110539199]
[2023-10-27 12:35:10,960 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:35:10,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:35:11,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:35:11,492 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-27 12:35:11,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:35:11,493 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110539199]
[2023-10-27 12:35:11,493 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110539199] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:35:11,493 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970806615]
[2023-10-27 12:35:11,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:35:11,494 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:35:11,494 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:35:11,495 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-27 12:35:11,536 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-27 12:35:11,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:35:11,669 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-27 12:35:11,687 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:35:11,690 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-27 12:35:11,698 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:35:11,698 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-27 12:35:11,735 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-27 12:35:11,744 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:35:11,753 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:35:11,754 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-27 12:35:11,778 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:35:11,778 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-27 12:35:11,810 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-27 12:35:11,819 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-27 12:35:11,819 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:35:11,965 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-27 12:35:11,966 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970806615] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:35:11,966 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:35:11,967 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2023-10-27 12:35:11,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731115405]
[2023-10-27 12:35:11,967 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:35:11,968 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-10-27 12:35:11,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:35:11,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-10-27 12:35:11,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2023-10-27 12:35:12,780 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-10-27 12:35:12,781 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-27 12:35:12,781 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:35:12,781 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-10-27 12:35:12,781 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:35:16,473 INFO  L130       PetriNetUnfolder]: 8746/15150 cut-off events.
[2023-10-27 12:35:16,473 INFO  L131       PetriNetUnfolder]: For 62441/63984 co-relation queries the response was YES.
[2023-10-27 12:35:16,575 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-27 12:35:16,728 INFO  L137   encePairwiseOnDemand]: 176/192 looper letters, 839 selfloop transitions, 358 changer transitions 2/1229 dead transitions.
[2023-10-27 12:35:16,736 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 1229 transitions, 15058 flow
[2023-10-27 12:35:16,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-27 12:35:16,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-27 12:35:16,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1079 transitions.
[2023-10-27 12:35:16,753 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4683159722222222
[2023-10-27 12:35:16,754 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1079 transitions.
[2023-10-27 12:35:16,754 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1079 transitions.
[2023-10-27 12:35:16,754 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:35:16,755 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1079 transitions.
[2023-10-27 12:35:16,756 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-27 12:35:16,781 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-27 12:35:16,781 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-27 12:35:16,781 INFO  L175             Difference]: Start difference. First operand has 131 places, 771 transitions, 7820 flow. Second operand 12 states and 1079 transitions.
[2023-10-27 12:35:16,781 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 1229 transitions, 15058 flow
[2023-10-27 12:35:18,824 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1229 transitions, 14413 flow, removed 318 selfloop flow, removed 4 redundant places.
[2023-10-27 12:35:18,869 INFO  L231             Difference]: Finished difference. Result has 143 places, 1023 transitions, 11838 flow
[2023-10-27 12:35:18,870 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-27 12:35:18,870 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places.
[2023-10-27 12:35:18,870 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 1023 transitions, 11838 flow
[2023-10-27 12:35:18,871 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-27 12:35:18,871 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:35:18,871 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:35:18,885 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-27 12:35:19,075 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-27 12:35:19,076 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-27 12:35:19,076 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:35:19,076 INFO  L85        PathProgramCache]: Analyzing trace with hash -972504981, now seen corresponding path program 2 times
[2023-10-27 12:35:19,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:35:19,076 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868390793]
[2023-10-27 12:35:19,077 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:35:19,077 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:35:19,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:35:19,612 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-27 12:35:19,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:35:19,612 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868390793]
[2023-10-27 12:35:19,612 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868390793] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:35:19,612 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768465104]
[2023-10-27 12:35:19,612 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:35:19,613 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:35:19,613 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:35:19,616 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-27 12:35:19,657 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-27 12:35:19,799 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:35:19,799 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:35:19,811 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-10-27 12:35:19,813 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:35:19,820 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-27 12:35:19,846 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:35:19,846 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-27 12:35:20,044 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-27 12:35:20,113 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-27 12:35:20,181 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-27 12:35:20,312 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-27 12:35:20,332 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-27 12:35:20,400 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-27 12:35:20,450 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-27 12:35:20,450 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:35:20,621 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-27 12:35:20,622 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [768465104] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:35:20,622 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:35:20,622 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20
[2023-10-27 12:35:20,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356655256]
[2023-10-27 12:35:20,624 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:35:20,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2023-10-27 12:35:20,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:35:20,625 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2023-10-27 12:35:20,625 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462
[2023-10-27 12:35:22,137 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-10-27 12:35:22,138 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-27 12:35:22,138 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:35:22,138 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-10-27 12:35:22,138 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:35:26,938 INFO  L130       PetriNetUnfolder]: 9057/15823 cut-off events.
[2023-10-27 12:35:26,939 INFO  L131       PetriNetUnfolder]: For 80875/82329 co-relation queries the response was YES.
[2023-10-27 12:35:26,984 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-27 12:35:27,163 INFO  L137   encePairwiseOnDemand]: 171/192 looper letters, 1149 selfloop transitions, 376 changer transitions 16/1571 dead transitions.
[2023-10-27 12:35:27,163 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1571 transitions, 20634 flow
[2023-10-27 12:35:27,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-27 12:35:27,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-27 12:35:27,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1834 transitions.
[2023-10-27 12:35:27,182 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4548611111111111
[2023-10-27 12:35:27,182 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1834 transitions.
[2023-10-27 12:35:27,182 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1834 transitions.
[2023-10-27 12:35:27,183 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:35:27,183 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1834 transitions.
[2023-10-27 12:35:27,187 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-27 12:35:27,192 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-27 12:35:27,206 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-27 12:35:27,206 INFO  L175             Difference]: Start difference. First operand has 143 places, 1023 transitions, 11838 flow. Second operand 21 states and 1834 transitions.
[2023-10-27 12:35:27,207 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1571 transitions, 20634 flow
[2023-10-27 12:35:29,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 1571 transitions, 20199 flow, removed 205 selfloop flow, removed 5 redundant places.
[2023-10-27 12:35:29,180 INFO  L231             Difference]: Finished difference. Result has 166 places, 1174 transitions, 14603 flow
[2023-10-27 12:35:29,181 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-27 12:35:29,181 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 109 predicate places.
[2023-10-27 12:35:29,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 1174 transitions, 14603 flow
[2023-10-27 12:35:29,182 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-27 12:35:29,182 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:35:29,182 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:35:29,189 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-27 12:35:29,387 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-27 12:35:29,387 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-27 12:35:29,400 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:35:29,400 INFO  L85        PathProgramCache]: Analyzing trace with hash 2049850436, now seen corresponding path program 2 times
[2023-10-27 12:35:29,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:35:29,401 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837680010]
[2023-10-27 12:35:29,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:35:29,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:35:29,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:35:29,866 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-27 12:35:29,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:35:29,867 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837680010]
[2023-10-27 12:35:29,867 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837680010] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:35:29,867 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176487769]
[2023-10-27 12:35:29,867 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:35:29,867 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:35:29,867 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:35:29,868 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-27 12:35:29,917 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-27 12:35:30,059 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:35:30,060 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:35:30,061 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-10-27 12:35:30,065 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:35:30,076 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-27 12:35:30,122 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:35:30,123 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-27 12:35:30,284 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-27 12:35:30,345 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-27 12:35:30,398 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-27 12:35:30,445 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-27 12:35:30,492 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-27 12:35:30,526 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-27 12:35:30,526 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:35:30,554 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-27 12:35:30,585 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-27 12:35:30,671 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-27 12:35:30,672 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176487769] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:35:30,672 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:35:30,672 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21
[2023-10-27 12:35:30,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347591318]
[2023-10-27 12:35:30,672 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:35:30,673 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2023-10-27 12:35:30,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:35:30,673 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2023-10-27 12:35:30,674 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=349, Unknown=2, NotChecked=78, Total=506
[2023-10-27 12:35:30,781 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-27 12:35:30,782 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-27 12:35:30,782 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:35:30,782 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-27 12:35:30,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:35:37,723 INFO  L130       PetriNetUnfolder]: 11708/19508 cut-off events.
[2023-10-27 12:35:37,725 INFO  L131       PetriNetUnfolder]: For 124723/124729 co-relation queries the response was YES.
[2023-10-27 12:35:37,781 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-27 12:35:37,864 INFO  L137   encePairwiseOnDemand]: 167/192 looper letters, 1349 selfloop transitions, 732 changer transitions 2/2087 dead transitions.
[2023-10-27 12:35:37,865 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 2087 transitions, 29755 flow
[2023-10-27 12:35:37,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-10-27 12:35:37,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-10-27 12:35:37,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1530 transitions.
[2023-10-27 12:35:37,891 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34646739130434784
[2023-10-27 12:35:37,891 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1530 transitions.
[2023-10-27 12:35:37,891 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1530 transitions.
[2023-10-27 12:35:37,892 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:35:37,892 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1530 transitions.
[2023-10-27 12:35:37,896 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-27 12:35:37,901 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-27 12:35:37,914 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-27 12:35:37,914 INFO  L175             Difference]: Start difference. First operand has 166 places, 1174 transitions, 14603 flow. Second operand 23 states and 1530 transitions.
[2023-10-27 12:35:37,915 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 2087 transitions, 29755 flow
[2023-10-27 12:35:41,116 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 2087 transitions, 29052 flow, removed 136 selfloop flow, removed 7 redundant places.
[2023-10-27 12:35:41,152 INFO  L231             Difference]: Finished difference. Result has 195 places, 1597 transitions, 22944 flow
[2023-10-27 12:35:41,153 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-27 12:35:41,154 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 138 predicate places.
[2023-10-27 12:35:41,154 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 1597 transitions, 22944 flow
[2023-10-27 12:35:41,155 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-27 12:35:41,155 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:35:41,155 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:35:41,161 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-27 12:35:41,360 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-27 12:35:41,360 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-27 12:35:41,361 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:35:41,361 INFO  L85        PathProgramCache]: Analyzing trace with hash -862277107, now seen corresponding path program 3 times
[2023-10-27 12:35:41,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:35:41,362 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620732506]
[2023-10-27 12:35:41,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:35:41,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:35:41,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:35:41,834 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-27 12:35:41,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:35:41,835 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620732506]
[2023-10-27 12:35:41,835 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620732506] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:35:41,835 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418826703]
[2023-10-27 12:35:41,835 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-27 12:35:41,836 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:35:41,836 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:35:41,837 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-27 12:35:41,881 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-27 12:35:42,060 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-27 12:35:42,060 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:35:42,061 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-10-27 12:35:42,064 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:35:42,070 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-27 12:35:42,096 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:35:42,099 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-27 12:35:42,251 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-27 12:35:42,295 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-27 12:35:42,391 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-27 12:35:42,441 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-27 12:35:42,473 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-27 12:35:42,534 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:35:42,580 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-27 12:35:42,580 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:35:42,616 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-27 12:35:42,630 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-27 12:35:42,647 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-27 12:35:42,681 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-27 12:35:42,697 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-27 12:35:42,785 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-27 12:35:42,786 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418826703] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:35:42,786 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:35:42,786 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25
[2023-10-27 12:35:42,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232360512]
[2023-10-27 12:35:42,786 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:35:42,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-27 12:35:42,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:35:42,787 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-27 12:35:42,787 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=393, Unknown=5, NotChecked=220, Total=702
[2023-10-27 12:35:43,022 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-27 12:35:43,023 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-27 12:35:43,023 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:35:43,023 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-27 12:35:43,023 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:35:51,204 INFO  L130       PetriNetUnfolder]: 11553/19268 cut-off events.
[2023-10-27 12:35:51,205 INFO  L131       PetriNetUnfolder]: For 185351/185357 co-relation queries the response was YES.
[2023-10-27 12:35:51,276 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-27 12:35:51,354 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 1574 selfloop transitions, 601 changer transitions 2/2181 dead transitions.
[2023-10-27 12:35:51,354 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 2181 transitions, 34403 flow
[2023-10-27 12:35:51,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-27 12:35:51,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-27 12:35:51,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1635 transitions.
[2023-10-27 12:35:51,362 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.340625
[2023-10-27 12:35:51,363 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1635 transitions.
[2023-10-27 12:35:51,363 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1635 transitions.
[2023-10-27 12:35:51,363 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:35:51,363 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1635 transitions.
[2023-10-27 12:35:51,366 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-27 12:35:51,393 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-27 12:35:51,410 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-27 12:35:51,410 INFO  L175             Difference]: Start difference. First operand has 195 places, 1597 transitions, 22944 flow. Second operand 25 states and 1635 transitions.
[2023-10-27 12:35:51,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 2181 transitions, 34403 flow
[2023-10-27 12:35:55,722 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2181 transitions, 31812 flow, removed 1089 selfloop flow, removed 6 redundant places.
[2023-10-27 12:35:55,748 INFO  L231             Difference]: Finished difference. Result has 223 places, 1767 transitions, 25279 flow
[2023-10-27 12:35:55,749 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-27 12:35:55,751 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 166 predicate places.
[2023-10-27 12:35:55,751 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 1767 transitions, 25279 flow
[2023-10-27 12:35:55,759 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-27 12:35:55,760 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:35:55,760 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-27 12:35:55,766 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-27 12:35:55,964 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-27 12:35:55,965 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-27 12:35:55,965 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:35:55,966 INFO  L85        PathProgramCache]: Analyzing trace with hash 329382834, now seen corresponding path program 1 times
[2023-10-27 12:35:55,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:35:55,966 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516275389]
[2023-10-27 12:35:55,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:35:55,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:35:56,014 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:35:56,385 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-27 12:35:56,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:35:56,386 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516275389]
[2023-10-27 12:35:56,386 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516275389] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:35:56,386 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14471078]
[2023-10-27 12:35:56,386 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:35:56,386 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:35:56,386 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:35:56,387 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-27 12:35:56,425 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-27 12:35:56,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:35:56,570 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-10-27 12:35:56,575 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:35:56,577 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-27 12:35:56,583 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:35:56,583 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-27 12:35:56,598 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-27 12:35:56,613 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-27 12:35:56,628 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:35:56,628 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-27 12:35:56,653 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:35:56,654 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-27 12:35:56,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 43 treesize of output 39
[2023-10-27 12:35:56,672 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-27 12:35:56,673 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:35:56,697 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-27 12:35:56,806 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-27 12:35:56,834 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-27 12:35:56,883 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:35:56,884 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-27 12:35:56,891 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:35:56,891 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-27 12:35:56,900 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-10-27 12:35:56,913 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-27 12:35:56,918 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-10-27 12:35:56,918 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-27 12:35:56,924 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-10-27 12:35:56,925 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-27 12:35:56,963 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-27 12:35:56,963 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [14471078] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:35:56,964 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:35:56,964 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14
[2023-10-27 12:35:56,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611214705]
[2023-10-27 12:35:56,964 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:35:56,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-10-27 12:35:56,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:35:56,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-10-27 12:35:56,965 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=114, Unknown=9, NotChecked=72, Total=240
[2023-10-27 12:35:57,039 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 192
[2023-10-27 12:35:57,040 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-27 12:35:57,040 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:35:57,040 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 192
[2023-10-27 12:35:57,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:36:05,327 INFO  L130       PetriNetUnfolder]: 12234/20378 cut-off events.
[2023-10-27 12:36:05,328 INFO  L131       PetriNetUnfolder]: For 217902/217910 co-relation queries the response was YES.
[2023-10-27 12:36:05,411 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-27 12:36:05,498 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 1019 selfloop transitions, 1404 changer transitions 10/2437 dead transitions.
[2023-10-27 12:36:05,502 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 2437 transitions, 38878 flow
[2023-10-27 12:36:05,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-10-27 12:36:05,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-10-27 12:36:05,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1533 transitions.
[2023-10-27 12:36:05,509 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4435763888888889
[2023-10-27 12:36:05,509 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1533 transitions.
[2023-10-27 12:36:05,509 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1533 transitions.
[2023-10-27 12:36:05,509 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:36:05,509 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1533 transitions.
[2023-10-27 12:36:05,511 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-27 12:36:05,513 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-27 12:36:05,513 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-27 12:36:05,513 INFO  L175             Difference]: Start difference. First operand has 223 places, 1767 transitions, 25279 flow. Second operand 18 states and 1533 transitions.
[2023-10-27 12:36:05,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 2437 transitions, 38878 flow
[2023-10-27 12:36:10,964 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2437 transitions, 37334 flow, removed 671 selfloop flow, removed 8 redundant places.
[2023-10-27 12:36:11,023 INFO  L231             Difference]: Finished difference. Result has 236 places, 1973 transitions, 30792 flow
[2023-10-27 12:36:11,025 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-27 12:36:11,025 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 179 predicate places.
[2023-10-27 12:36:11,040 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 1973 transitions, 30792 flow
[2023-10-27 12:36:11,041 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-27 12:36:11,041 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:36:11,041 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-27 12:36:11,047 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-27 12:36:11,245 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-27 12:36:11,246 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-27 12:36:11,246 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:36:11,246 INFO  L85        PathProgramCache]: Analyzing trace with hash -1883145753, now seen corresponding path program 1 times
[2023-10-27 12:36:11,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:36:11,247 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285644474]
[2023-10-27 12:36:11,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:36:11,247 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:36:11,265 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:36:11,676 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-27 12:36:11,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:36:11,677 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285644474]
[2023-10-27 12:36:11,677 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285644474] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:36:11,677 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917565847]
[2023-10-27 12:36:11,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:36:11,678 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:36:11,678 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:36:11,679 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-27 12:36:11,717 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-27 12:36:11,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:36:11,856 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 40 conjunts are in the unsatisfiable core
[2023-10-27 12:36:11,870 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:36:11,885 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-27 12:36:11,920 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:36:11,920 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-27 12:36:12,041 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-27 12:36:12,088 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-27 12:36:12,149 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-27 12:36:12,207 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-27 12:36:12,277 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-27 12:36:12,319 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-27 12:36:12,319 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:36:12,609 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-27 12:36:12,632 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-27 12:36:12,659 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:36:12,659 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-27 12:36:12,687 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:36:12,688 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-27 12:36:12,690 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-27 12:36:12,696 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-27 12:36:12,697 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-27 12:36:12,700 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-27 12:36:12,701 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2023-10-27 12:36:12,749 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-27 12:36:12,749 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917565847] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:36:12,750 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:36:12,750 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2023-10-27 12:36:12,751 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447874527]
[2023-10-27 12:36:12,751 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:36:12,751 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-27 12:36:12,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:36:12,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-27 12:36:12,753 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=433, Unknown=19, NotChecked=90, Total=650
[2023-10-27 12:36:12,942 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-27 12:36:12,943 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-27 12:36:12,943 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:36:12,943 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-27 12:36:12,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:36:28,928 INFO  L130       PetriNetUnfolder]: 21940/36688 cut-off events.
[2023-10-27 12:36:28,928 INFO  L131       PetriNetUnfolder]: For 426823/426905 co-relation queries the response was YES.
[2023-10-27 12:36:29,198 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-27 12:36:29,383 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2770 selfloop transitions, 1147 changer transitions 2/3923 dead transitions.
[2023-10-27 12:36:29,384 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 3923 transitions, 65680 flow
[2023-10-27 12:36:29,384 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2023-10-27 12:36:29,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2023-10-27 12:36:29,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1986 transitions.
[2023-10-27 12:36:29,407 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34479166666666666
[2023-10-27 12:36:29,408 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1986 transitions.
[2023-10-27 12:36:29,408 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1986 transitions.
[2023-10-27 12:36:29,408 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:36:29,409 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1986 transitions.
[2023-10-27 12:36:29,411 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-27 12:36:29,420 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-27 12:36:29,421 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-27 12:36:29,437 INFO  L175             Difference]: Start difference. First operand has 236 places, 1973 transitions, 30792 flow. Second operand 30 states and 1986 transitions.
[2023-10-27 12:36:29,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 3923 transitions, 65680 flow
[2023-10-27 12:36:55,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 3923 transitions, 61915 flow, removed 686 selfloop flow, removed 10 redundant places.
[2023-10-27 12:36:55,715 INFO  L231             Difference]: Finished difference. Result has 277 places, 3020 transitions, 49672 flow
[2023-10-27 12:36:55,717 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-27 12:36:55,717 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 220 predicate places.
[2023-10-27 12:36:55,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 3020 transitions, 49672 flow
[2023-10-27 12:36:55,718 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-27 12:36:55,718 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:36:55,721 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-27 12:36:55,727 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-27 12:36:55,925 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-27 12:36:55,926 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-27 12:36:55,926 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:36:55,927 INFO  L85        PathProgramCache]: Analyzing trace with hash -201168629, now seen corresponding path program 2 times
[2023-10-27 12:36:55,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:36:55,927 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265028031]
[2023-10-27 12:36:55,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:36:55,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:36:55,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:36:56,406 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-27 12:36:56,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:36:56,406 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265028031]
[2023-10-27 12:36:56,406 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265028031] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:36:56,406 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827859309]
[2023-10-27 12:36:56,406 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:36:56,406 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:36:56,407 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:36:56,408 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-27 12:36:56,444 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-27 12:36:56,615 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:36:56,616 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:36:56,628 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-27 12:36:56,630 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:36:56,633 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-27 12:36:56,652 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:36:56,652 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-27 12:36:56,754 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-27 12:36:56,798 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-27 12:36:56,844 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-27 12:36:56,946 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-27 12:36:56,957 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-27 12:36:57,016 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-27 12:36:57,062 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-27 12:36:57,062 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:36:57,094 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-27 12:36:57,257 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-27 12:36:57,272 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-27 12:36:57,378 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-27 12:36:57,378 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [827859309] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:36:57,378 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:36:57,378 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2023-10-27 12:36:57,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188087511]
[2023-10-27 12:36:57,378 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:36:57,379 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-27 12:36:57,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:36:57,379 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-27 12:36:57,379 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=416, Unknown=9, NotChecked=132, Total=650
[2023-10-27 12:36:57,469 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-10-27 12:36:57,470 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-27 12:36:57,470 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:36:57,470 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-10-27 12:36:57,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:37:21,683 INFO  L130       PetriNetUnfolder]: 25276/42687 cut-off events.
[2023-10-27 12:37:21,683 INFO  L131       PetriNetUnfolder]: For 780172/780244 co-relation queries the response was YES.
[2023-10-27 12:37:22,063 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-27 12:37:22,374 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2885 selfloop transitions, 1072 changer transitions 0/3961 dead transitions.
[2023-10-27 12:37:22,374 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 3961 transitions, 72942 flow
[2023-10-27 12:37:22,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-10-27 12:37:22,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-10-27 12:37:22,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1822 transitions.
[2023-10-27 12:37:22,377 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36498397435897434
[2023-10-27 12:37:22,377 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1822 transitions.
[2023-10-27 12:37:22,377 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1822 transitions.
[2023-10-27 12:37:22,377 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:37:22,377 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1822 transitions.
[2023-10-27 12:37:22,394 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-27 12:37:22,399 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-27 12:37:22,411 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-27 12:37:22,412 INFO  L175             Difference]: Start difference. First operand has 277 places, 3020 transitions, 49672 flow. Second operand 26 states and 1822 transitions.
[2023-10-27 12:37:22,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 3961 transitions, 72942 flow
[2023-10-27 12:38:07,112 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 3961 transitions, 68771 flow, removed 2083 selfloop flow, removed 3 redundant places.
[2023-10-27 12:38:07,163 INFO  L231             Difference]: Finished difference. Result has 317 places, 3492 transitions, 58992 flow
[2023-10-27 12:38:07,165 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-27 12:38:07,165 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 260 predicate places.
[2023-10-27 12:38:07,165 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 3492 transitions, 58992 flow
[2023-10-27 12:38:07,166 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-27 12:38:07,166 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:38:07,166 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-27 12:38:07,172 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-27 12:38:07,371 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-27 12:38:07,372 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-27 12:38:07,372 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:38:07,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -530869613, now seen corresponding path program 3 times
[2023-10-27 12:38:07,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:38:07,373 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268939769]
[2023-10-27 12:38:07,374 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:38:07,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:38:07,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:38:07,795 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:38:07,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:38:07,796 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268939769]
[2023-10-27 12:38:07,796 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268939769] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:38:07,796 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562947447]
[2023-10-27 12:38:07,796 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-27 12:38:07,796 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:38:07,797 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:38:07,797 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-27 12:38:07,823 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-27 12:38:07,967 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-27 12:38:07,967 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:38:07,968 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-27 12:38:07,972 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:38:07,983 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-27 12:38:08,014 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:38:08,015 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-27 12:38:08,156 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-27 12:38:08,180 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-27 12:38:08,229 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-27 12:38:08,288 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-27 12:38:08,320 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-27 12:38:08,376 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-27 12:38:08,419 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-27 12:38:08,420 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:38:08,438 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-27 12:38:08,469 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-27 12:38:08,486 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-27 12:38:08,601 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-27 12:38:08,602 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562947447] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:38:08,602 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:38:08,602 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23
[2023-10-27 12:38:08,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972976704]
[2023-10-27 12:38:08,602 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:38:08,602 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2023-10-27 12:38:08,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:38:08,602 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-10-27 12:38:08,603 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=378, Unknown=3, NotChecked=126, Total=600
[2023-10-27 12:38:08,726 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-10-27 12:38:08,727 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-27 12:38:08,727 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:38:08,727 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-10-27 12:38:08,727 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:38:35,613 INFO  L130       PetriNetUnfolder]: 26170/44205 cut-off events.
[2023-10-27 12:38:35,614 INFO  L131       PetriNetUnfolder]: For 1031411/1031425 co-relation queries the response was YES.
[2023-10-27 12:38:36,135 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-27 12:38:36,371 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2780 selfloop transitions, 1750 changer transitions 2/4536 dead transitions.
[2023-10-27 12:38:36,371 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 4536 transitions, 85690 flow
[2023-10-27 12:38:36,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-27 12:38:36,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-27 12:38:36,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1765 transitions.
[2023-10-27 12:38:36,375 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36770833333333336
[2023-10-27 12:38:36,376 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1765 transitions.
[2023-10-27 12:38:36,389 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1765 transitions.
[2023-10-27 12:38:36,390 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:38:36,390 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1765 transitions.
[2023-10-27 12:38:36,392 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-27 12:38:36,407 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-27 12:38:36,408 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-27 12:38:36,408 INFO  L175             Difference]: Start difference. First operand has 317 places, 3492 transitions, 58992 flow. Second operand 25 states and 1765 transitions.
[2023-10-27 12:38:36,408 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 4536 transitions, 85690 flow
[2023-10-27 12:39:26,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 4536 transitions, 83793 flow, removed 946 selfloop flow, removed 3 redundant places.
[2023-10-27 12:39:26,926 INFO  L231             Difference]: Finished difference. Result has 345 places, 3971 transitions, 71320 flow
[2023-10-27 12:39:26,943 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-27 12:39:26,944 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 288 predicate places.
[2023-10-27 12:39:26,944 INFO  L495      AbstractCegarLoop]: Abstraction has has 345 places, 3971 transitions, 71320 flow
[2023-10-27 12:39:26,945 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-27 12:39:26,945 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:39:26,945 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:39:26,952 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-27 12:39:27,149 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-27 12:39:27,150 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-27 12:39:27,150 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:39:27,150 INFO  L85        PathProgramCache]: Analyzing trace with hash -85817847, now seen corresponding path program 1 times
[2023-10-27 12:39:27,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:39:27,151 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813442505]
[2023-10-27 12:39:27,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:39:27,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:39:27,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:39:27,623 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-27 12:39:27,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:39:27,624 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813442505]
[2023-10-27 12:39:27,624 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813442505] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:39:27,624 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890612669]
[2023-10-27 12:39:27,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:39:27,624 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:39:27,624 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:39:27,638 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-27 12:39:27,678 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-27 12:39:27,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:39:27,847 INFO  L263         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-27 12:39:27,849 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:39:27,852 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-27 12:39:27,879 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:39:27,880 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-27 12:39:27,900 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-27 12:39:27,930 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-27 12:39:27,938 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-27 12:39:27,960 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:39:27,961 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-27 12:39:27,986 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:39:27,987 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-27 12:39:28,013 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:39:28,027 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:39:28,052 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-27 12:39:28,052 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:39:28,070 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-27 12:39:28,208 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-27 12:39:28,224 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-27 12:39:28,318 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-27 12:39:28,318 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [890612669] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:39:28,318 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:39:28,318 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14
[2023-10-27 12:39:28,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221677751]
[2023-10-27 12:39:28,318 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:39:28,318 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-10-27 12:39:28,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:39:28,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-10-27 12:39:28,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=9, NotChecked=72, Total=240
[2023-10-27 12:39:28,413 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-27 12:39:28,413 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-27 12:39:28,413 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:39:28,413 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-27 12:39:28,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:39:57,609 INFO  L130       PetriNetUnfolder]: 26160/44175 cut-off events.
[2023-10-27 12:39:57,609 INFO  L131       PetriNetUnfolder]: For 1231998/1232042 co-relation queries the response was YES.
[2023-10-27 12:39:58,060 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-27 12:39:58,413 INFO  L137   encePairwiseOnDemand]: 168/192 looper letters, 3174 selfloop transitions, 1041 changer transitions 0/4219 dead transitions.
[2023-10-27 12:39:58,414 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 4219 transitions, 84045 flow
[2023-10-27 12:39:58,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-27 12:39:58,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-27 12:39:58,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 819 transitions.
[2023-10-27 12:39:58,421 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35546875
[2023-10-27 12:39:58,421 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 819 transitions.
[2023-10-27 12:39:58,421 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 819 transitions.
[2023-10-27 12:39:58,423 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:39:58,423 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 819 transitions.
[2023-10-27 12:39:58,427 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-27 12:39:58,428 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-27 12:39:58,428 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-27 12:39:58,428 INFO  L175             Difference]: Start difference. First operand has 345 places, 3971 transitions, 71320 flow. Second operand 12 states and 819 transitions.
[2023-10-27 12:39:58,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 4219 transitions, 84045 flow
[2023-10-27 12:40:48,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4219 transitions, 82234 flow, removed 856 selfloop flow, removed 9 redundant places.
[2023-10-27 12:40:49,038 INFO  L231             Difference]: Finished difference. Result has 349 places, 4037 transitions, 72965 flow
[2023-10-27 12:40:49,041 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-27 12:40:49,041 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 292 predicate places.
[2023-10-27 12:40:49,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 349 places, 4037 transitions, 72965 flow
[2023-10-27 12:40:49,042 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-27 12:40:49,042 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:40:49,042 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-27 12:40:49,049 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-27 12:40:49,246 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-27 12:40:49,247 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-27 12:40:49,248 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:40:49,248 INFO  L85        PathProgramCache]: Analyzing trace with hash 92273895, now seen corresponding path program 4 times
[2023-10-27 12:40:49,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:40:49,249 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064213205]
[2023-10-27 12:40:49,249 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:40:49,249 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:40:49,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:40:49,661 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-27 12:40:49,662 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:40:49,662 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064213205]
[2023-10-27 12:40:49,662 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064213205] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:40:49,662 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168386199]
[2023-10-27 12:40:49,662 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-27 12:40:49,662 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:40:49,662 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:40:49,663 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-27 12:40:49,696 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-27 12:40:49,894 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-27 12:40:49,894 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:40:49,895 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core
[2023-10-27 12:40:49,897 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:40:49,902 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-27 12:40:49,909 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:40:49,910 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-27 12:40:49,944 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-27 12:40:49,951 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-27 12:40:49,966 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-27 12:40:49,980 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:40:49,980 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-27 12:40:49,995 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:40:50,000 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-27 12:40:50,022 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-27 12:40:50,032 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-27 12:40:50,032 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:40:50,049 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-27 12:40:50,170 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-27 12:40:50,197 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-27 12:40:50,211 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-27 12:40:50,264 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-27 12:40:50,264 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168386199] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:40:50,264 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:40:50,264 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 15
[2023-10-27 12:40:50,264 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708909570]
[2023-10-27 12:40:50,264 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:40:50,264 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2023-10-27 12:40:50,265 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:40:50,265 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2023-10-27 12:40:50,265 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=10, NotChecked=100, Total=272
[2023-10-27 12:40:50,307 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-10-27 12:40:50,307 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-27 12:40:50,307 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:40:50,307 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-10-27 12:40:50,307 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:41:26,229 INFO  L130       PetriNetUnfolder]: 29823/50776 cut-off events.
[2023-10-27 12:41:26,229 INFO  L131       PetriNetUnfolder]: For 1471610/1471630 co-relation queries the response was YES.
[2023-10-27 12:41:26,773 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-27 12:41:27,222 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 3395 selfloop transitions, 1642 changer transitions 0/5041 dead transitions.
[2023-10-27 12:41:27,222 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 5041 transitions, 102378 flow
[2023-10-27 12:41:27,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-10-27 12:41:27,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2023-10-27 12:41:27,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1702 transitions.
[2023-10-27 12:41:27,224 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3693576388888889
[2023-10-27 12:41:27,225 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1702 transitions.
[2023-10-27 12:41:27,225 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1702 transitions.
[2023-10-27 12:41:27,225 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:41:27,225 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1702 transitions.
[2023-10-27 12:41:27,227 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-27 12:41:27,233 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-27 12:41:27,234 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-27 12:41:27,234 INFO  L175             Difference]: Start difference. First operand has 349 places, 4037 transitions, 72965 flow. Second operand 24 states and 1702 transitions.
[2023-10-27 12:41:27,234 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 5041 transitions, 102378 flow
[2023-10-27 12:42:20,781 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 5041 transitions, 100501 flow, removed 117 selfloop flow, removed 7 redundant places.
[2023-10-27 12:42:20,880 INFO  L231             Difference]: Finished difference. Result has 385 places, 4635 transitions, 91290 flow
[2023-10-27 12:42:20,883 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-27 12:42:20,888 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 328 predicate places.
[2023-10-27 12:42:20,888 INFO  L495      AbstractCegarLoop]: Abstraction has has 385 places, 4635 transitions, 91290 flow
[2023-10-27 12:42:20,888 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-27 12:42:20,888 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:42:20,888 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-27 12:42:20,895 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-27 12:42:21,093 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-27 12:42:21,093 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-27 12:42:21,094 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:42:21,094 INFO  L85        PathProgramCache]: Analyzing trace with hash -1956895420, now seen corresponding path program 1 times
[2023-10-27 12:42:21,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:42:21,096 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835960589]
[2023-10-27 12:42:21,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:42:21,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:42:21,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:42:21,506 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-27 12:42:21,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:42:21,506 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835960589]
[2023-10-27 12:42:21,506 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835960589] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:42:21,506 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413614483]
[2023-10-27 12:42:21,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:42:21,507 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:42:21,507 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:42:21,516 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-27 12:42:21,544 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-27 12:42:21,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:42:21,659 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-10-27 12:42:21,663 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:42:21,671 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-27 12:42:21,714 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:42:21,714 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-27 12:42:21,809 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-27 12:42:21,835 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-27 12:42:21,871 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-27 12:42:21,919 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-27 12:42:21,982 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-27 12:42:22,039 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-27 12:42:22,039 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:42:22,056 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-27 12:42:22,175 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-27 12:42:22,186 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-27 12:42:22,197 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:42:22,197 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-27 12:42:22,202 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:42:22,202 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-27 12:42:22,205 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-27 12:42:22,212 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-27 12:42:22,212 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-27 12:42:22,218 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-27 12:42:22,218 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-27 12:42:22,290 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-27 12:42:22,290 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [413614483] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:42:22,291 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:42:22,291 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2023-10-27 12:42:22,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31513201]
[2023-10-27 12:42:22,291 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:42:22,291 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-27 12:42:22,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:42:22,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-27 12:42:22,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=404, Unknown=14, NotChecked=132, Total=650
[2023-10-27 12:42:22,549 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-27 12:42:22,550 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-27 12:42:22,550 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:42:22,550 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-27 12:42:22,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:43:03,907 INFO  L130       PetriNetUnfolder]: 30142/51413 cut-off events.
[2023-10-27 12:43:03,907 INFO  L131       PetriNetUnfolder]: For 1854577/1854615 co-relation queries the response was YES.
[2023-10-27 12:43:04,514 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-27 12:43:04,831 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 3219 selfloop transitions, 2253 changer transitions 4/5480 dead transitions.
[2023-10-27 12:43:04,831 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 5480 transitions, 118395 flow
[2023-10-27 12:43:04,831 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2023-10-27 12:43:04,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2023-10-27 12:43:04,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2123 transitions.
[2023-10-27 12:43:04,850 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3252144607843137
[2023-10-27 12:43:04,850 INFO  L72            ComplementDD]: Start complementDD. Operand 34 states and 2123 transitions.
[2023-10-27 12:43:04,850 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 34 states and 2123 transitions.
[2023-10-27 12:43:04,851 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:43:04,851 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2123 transitions.
[2023-10-27 12:43:04,853 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-27 12:43:04,858 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-27 12:43:04,859 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-27 12:43:04,859 INFO  L175             Difference]: Start difference. First operand has 385 places, 4635 transitions, 91290 flow. Second operand 34 states and 2123 transitions.
[2023-10-27 12:43:04,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 5480 transitions, 118395 flow
[2023-10-27 12:44:12,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 5480 transitions, 115212 flow, removed 1585 selfloop flow, removed 4 redundant places.
[2023-10-27 12:44:12,420 INFO  L231             Difference]: Finished difference. Result has 422 places, 4840 transitions, 99613 flow
[2023-10-27 12:44:12,423 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-27 12:44:12,424 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 365 predicate places.
[2023-10-27 12:44:12,424 INFO  L495      AbstractCegarLoop]: Abstraction has has 422 places, 4840 transitions, 99613 flow
[2023-10-27 12:44:12,424 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-27 12:44:12,424 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:44:12,424 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-27 12:44:12,430 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-27 12:44:12,629 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-27 12:44:12,629 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-27 12:44:12,634 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:44:12,635 INFO  L85        PathProgramCache]: Analyzing trace with hash 736991051, now seen corresponding path program 5 times
[2023-10-27 12:44:12,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:44:12,636 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067657406]
[2023-10-27 12:44:12,636 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:44:12,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:44:12,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:44:13,071 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-27 12:44:13,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:44:13,071 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067657406]
[2023-10-27 12:44:13,071 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067657406] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:44:13,071 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113379715]
[2023-10-27 12:44:13,071 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-27 12:44:13,071 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:44:13,071 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:44:13,072 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-27 12:44:13,107 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-27 12:44:13,289 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:44:13,289 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:44:13,306 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 42 conjunts are in the unsatisfiable core
[2023-10-27 12:44:13,308 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:44:13,315 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-27 12:44:13,339 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:44:13,340 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-27 12:44:13,437 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-27 12:44:13,507 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-27 12:44:13,519 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-27 12:44:13,569 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-27 12:44:13,615 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-27 12:44:13,677 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-27 12:44:13,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:44:13,727 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:44:13,757 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-27 12:44:13,957 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-27 12:44:13,971 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-27 12:44:14,065 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-27 12:44:14,065 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113379715] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:44:14,065 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:44:14,065 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2023-10-27 12:44:14,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574955701]
[2023-10-27 12:44:14,065 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:44:14,065 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-27 12:44:14,066 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:44:14,066 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-27 12:44:14,066 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=414, Unknown=13, NotChecked=132, Total=650
[2023-10-27 12:44:14,208 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-27 12:44:14,209 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-27 12:44:14,209 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:44:14,209 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-27 12:44:14,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:45:01,298 INFO  L130       PetriNetUnfolder]: 33457/57317 cut-off events.
[2023-10-27 12:45:01,298 INFO  L131       PetriNetUnfolder]: For 2928608/2928634 co-relation queries the response was YES.
[2023-10-27 12:45:02,039 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-27 12:45:02,389 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 3860 selfloop transitions, 2116 changer transitions 0/5980 dead transitions.
[2023-10-27 12:45:02,389 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 5980 transitions, 136763 flow
[2023-10-27 12:45:02,390 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-27 12:45:02,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-27 12:45:02,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1588 transitions.
[2023-10-27 12:45:02,391 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3308333333333333
[2023-10-27 12:45:02,391 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1588 transitions.
[2023-10-27 12:45:02,391 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1588 transitions.
[2023-10-27 12:45:02,392 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:45:02,392 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1588 transitions.
[2023-10-27 12:45:02,417 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-27 12:45:02,419 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-27 12:45:02,420 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-27 12:45:02,420 INFO  L175             Difference]: Start difference. First operand has 422 places, 4840 transitions, 99613 flow. Second operand 25 states and 1588 transitions.
[2023-10-27 12:45:02,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 5980 transitions, 136763 flow
[2023-10-27 12:46:36,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 5980 transitions, 134508 flow, removed 720 selfloop flow, removed 13 redundant places.
[2023-10-27 12:46:36,330 INFO  L231             Difference]: Finished difference. Result has 451 places, 5469 transitions, 123099 flow
[2023-10-27 12:46:36,348 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-27 12:46:36,349 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 394 predicate places.
[2023-10-27 12:46:36,349 INFO  L495      AbstractCegarLoop]: Abstraction has has 451 places, 5469 transitions, 123099 flow
[2023-10-27 12:46:36,349 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-27 12:46:36,349 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:46:36,349 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:46:36,356 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-27 12:46:36,553 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-27 12:46:36,554 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-27 12:46:36,554 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:46:36,554 INFO  L85        PathProgramCache]: Analyzing trace with hash -159175320, now seen corresponding path program 1 times
[2023-10-27 12:46:36,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:46:36,555 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474339087]
[2023-10-27 12:46:36,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:46:36,555 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:46:36,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:46:36,968 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-27 12:46:36,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:46:36,968 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474339087]
[2023-10-27 12:46:36,968 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474339087] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:46:36,968 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398793468]
[2023-10-27 12:46:36,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:46:36,969 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:46:36,969 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:46:36,969 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-27 12:46:36,999 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-27 12:46:37,121 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:46:37,122 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-27 12:46:37,124 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:46:37,126 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-27 12:46:37,138 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:46:37,138 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-27 12:46:37,170 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-27 12:46:37,189 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-27 12:46:37,196 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-27 12:46:37,211 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-27 12:46:37,217 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-27 12:46:37,227 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:46:37,227 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-27 12:46:37,242 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:46:37,242 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-27 12:46:37,258 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-27 12:46:37,265 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-27 12:46:37,265 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:46:37,305 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-27 12:46:37,444 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-27 12:46:37,454 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-27 12:46:37,547 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-27 12:46:37,547 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398793468] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:46:37,547 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:46:37,547 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14
[2023-10-27 12:46:37,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141664922]
[2023-10-27 12:46:37,547 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:46:37,548 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-10-27 12:46:37,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:46:37,548 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-10-27 12:46:37,548 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=9, NotChecked=72, Total=240
[2023-10-27 12:46:37,639 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-27 12:46:37,640 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-27 12:46:37,640 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:46:37,640 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-27 12:46:37,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
