./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN --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 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:27:19,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:19,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:19,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:19,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:19,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:19,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:19,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:19,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:19,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:19,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:19,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:19,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:19,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:19,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:19,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:19,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:19,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:19,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:19,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:19,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:19,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:19,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:19,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:19,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:19,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:19,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:19,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:19,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:19,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:19,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:19,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:19,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:19,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:19,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:19,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:19,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:19,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:19,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:19,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:19,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:19,875 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 09:27:19,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:19,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:19,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:19,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:19,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:19,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:19,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:19,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:19,917 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:19,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:19,918 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:19,918 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:27:19,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:27:19,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:19,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:19,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:27:19,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:19,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:27:19,920 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 09:27:19,920 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:19,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:27:19,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:19,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:27:19,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:19,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:19,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:19,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:19,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:19,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:19,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:27:19,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:27:19,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:27:19,923 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:27:19,924 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:27:19,924 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:27:19,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN 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 -> 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 [2022-11-20 09:27:20,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:20,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:20,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:20,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:20,233 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:20,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2022-11-20 09:27:23,403 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:23,665 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:23,666 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2022-11-20 09:27:23,674 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/data/82614d9b6/10a1f4e6ad1e4bf78e7e248172a3046a/FLAGf00f0529e [2022-11-20 09:27:23,694 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/data/82614d9b6/10a1f4e6ad1e4bf78e7e248172a3046a [2022-11-20 09:27:23,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:23,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:23,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:23,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:23,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:23,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35319480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:23, skipping insertion in model container [2022-11-20 09:27:23,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:23" (1/1) ... [2022-11-20 09:27:23,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:23,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:23,947 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-11-20 09:27:23,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:23,964 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:23,997 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-11-20 09:27:24,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:24,021 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:24,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24 WrapperNode [2022-11-20 09:27:24,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:24,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:24,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:24,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:24,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,107 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 214 [2022-11-20 09:27:24,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:24,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:24,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:24,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:24,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,197 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:24,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:24,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:24,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:24,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (1/1) ... [2022-11-20 09:27:24,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:24,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:24,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:24,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c47abdf2-4b05-47c5-95b3-8be943be2fee/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:27:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:27:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:27:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 09:27:24,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 09:27:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 09:27:24,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 09:27:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 09:27:24,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 09:27:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:27:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:27:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:27:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 09:27:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:27:24,309 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:27:24,441 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:24,442 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:25,218 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:25,331 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:25,332 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 09:27:25,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:25 BoogieIcfgContainer [2022-11-20 09:27:25,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:25,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:25,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:25,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:25,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:23" (1/3) ... [2022-11-20 09:27:25,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7ebb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:25, skipping insertion in model container [2022-11-20 09:27:25,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:24" (2/3) ... [2022-11-20 09:27:25,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7ebb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:25, skipping insertion in model container [2022-11-20 09:27:25,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:25" (3/3) ... [2022-11-20 09:27:25,344 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2022-11-20 09:27:25,353 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 09:27:25,364 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:25,365 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-20 09:27:25,365 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:27:25,469 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 09:27:25,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 352 places, 362 transitions, 748 flow [2022-11-20 09:27:25,678 INFO L130 PetriNetUnfolder]: 20/359 cut-off events. [2022-11-20 09:27:25,679 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 09:27:25,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 359 events. 20/359 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 437 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 284. Up to 3 conditions per place. [2022-11-20 09:27:25,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 352 places, 362 transitions, 748 flow [2022-11-20 09:27:25,698 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 339 transitions, 696 flow [2022-11-20 09:27:25,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:25,731 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;@f620991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:25,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-11-20 09:27:25,735 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-11-20 09:27:25,736 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:27:25,736 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:25,737 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:25,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:25,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1303378583, now seen corresponding path program 1 times [2022-11-20 09:27:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:25,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088245926] [2022-11-20 09:27:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:25,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:26,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:26,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088245926] [2022-11-20 09:27:26,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088245926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:26,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:26,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:26,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5210783] [2022-11-20 09:27:26,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:26,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:26,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:26,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:26,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:26,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 362 [2022-11-20 09:27:26,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 339 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:26,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:26,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 362 [2022-11-20 09:27:26,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:26,692 INFO L130 PetriNetUnfolder]: 380/1345 cut-off events. [2022-11-20 09:27:26,692 INFO L131 PetriNetUnfolder]: For 161/314 co-relation queries the response was YES. [2022-11-20 09:27:26,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1345 events. 380/1345 cut-off events. For 161/314 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7868 event pairs, 255 based on Foata normal form. 9/1050 useless extension candidates. Maximal degree in co-relation 1630. Up to 542 conditions per place. [2022-11-20 09:27:26,711 INFO L137 encePairwiseOnDemand]: 335/362 looper letters, 30 selfloop transitions, 2 changer transitions 6/314 dead transitions. [2022-11-20 09:27:26,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 314 transitions, 710 flow [2022-11-20 09:27:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2022-11-20 09:27:26,729 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8895027624309392 [2022-11-20 09:27:26,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 966 transitions. [2022-11-20 09:27:26,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 966 transitions. [2022-11-20 09:27:26,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:26,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 966 transitions. [2022-11-20 09:27:26,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:26,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:26,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:26,754 INFO L175 Difference]: Start difference. First operand has 330 places, 339 transitions, 696 flow. Second operand 3 states and 966 transitions. [2022-11-20 09:27:26,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 314 transitions, 710 flow [2022-11-20 09:27:26,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 314 transitions, 698 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 09:27:26,769 INFO L231 Difference]: Finished difference. Result has 313 places, 308 transitions, 626 flow [2022-11-20 09:27:26,772 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=313, PETRI_TRANSITIONS=308} [2022-11-20 09:27:26,778 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -17 predicate places. [2022-11-20 09:27:26,778 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 308 transitions, 626 flow [2022-11-20 09:27:26,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:26,780 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:26,780 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:26,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:27:26,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1481128444, now seen corresponding path program 1 times [2022-11-20 09:27:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:26,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558890369] [2022-11-20 09:27:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:26,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:26,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558890369] [2022-11-20 09:27:26,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558890369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:26,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:26,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:26,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866592988] [2022-11-20 09:27:26,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:26,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:26,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:26,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:26,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:26,900 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 362 [2022-11-20 09:27:26,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 308 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:26,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:26,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 362 [2022-11-20 09:27:26,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:27,223 INFO L130 PetriNetUnfolder]: 213/996 cut-off events. [2022-11-20 09:27:27,224 INFO L131 PetriNetUnfolder]: For 27/107 co-relation queries the response was YES. [2022-11-20 09:27:27,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 996 events. 213/996 cut-off events. For 27/107 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5246 event pairs, 128 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 1279. Up to 297 conditions per place. [2022-11-20 09:27:27,233 INFO L137 encePairwiseOnDemand]: 355/362 looper letters, 22 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2022-11-20 09:27:27,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 302 transitions, 660 flow [2022-11-20 09:27:27,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 947 transitions. [2022-11-20 09:27:27,236 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8720073664825047 [2022-11-20 09:27:27,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 947 transitions. [2022-11-20 09:27:27,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 947 transitions. [2022-11-20 09:27:27,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:27,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 947 transitions. [2022-11-20 09:27:27,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:27,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:27,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:27,242 INFO L175 Difference]: Start difference. First operand has 313 places, 308 transitions, 626 flow. Second operand 3 states and 947 transitions. [2022-11-20 09:27:27,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 302 transitions, 660 flow [2022-11-20 09:27:27,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:27:27,252 INFO L231 Difference]: Finished difference. Result has 301 places, 302 transitions, 612 flow [2022-11-20 09:27:27,252 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=301, PETRI_TRANSITIONS=302} [2022-11-20 09:27:27,253 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-11-20 09:27:27,253 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 302 transitions, 612 flow [2022-11-20 09:27:27,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:27,254 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:27,254 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:27,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:27:27,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:27,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:27,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1973439662, now seen corresponding path program 1 times [2022-11-20 09:27:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:27,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843365787] [2022-11-20 09:27:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:27,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:27,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843365787] [2022-11-20 09:27:27,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843365787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:27,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:27,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:27,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585119137] [2022-11-20 09:27:27,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:27,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:27,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:27,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:27,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:27,385 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-20 09:27:27,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 302 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:27,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:27,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-20 09:27:27,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:27,643 INFO L130 PetriNetUnfolder]: 94/832 cut-off events. [2022-11-20 09:27:27,643 INFO L131 PetriNetUnfolder]: For 20/23 co-relation queries the response was YES. [2022-11-20 09:27:27,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 832 events. 94/832 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4037 event pairs, 45 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 945. Up to 131 conditions per place. [2022-11-20 09:27:27,652 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 15 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-11-20 09:27:27,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 301 transitions, 644 flow [2022-11-20 09:27:27,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:27,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2022-11-20 09:27:27,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8950276243093923 [2022-11-20 09:27:27,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2022-11-20 09:27:27,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2022-11-20 09:27:27,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:27,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2022-11-20 09:27:27,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:27,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:27,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:27,668 INFO L175 Difference]: Start difference. First operand has 301 places, 302 transitions, 612 flow. Second operand 3 states and 972 transitions. [2022-11-20 09:27:27,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 301 transitions, 644 flow [2022-11-20 09:27:27,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 09:27:27,676 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 613 flow [2022-11-20 09:27:27,677 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2022-11-20 09:27:27,680 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-11-20 09:27:27,680 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 613 flow [2022-11-20 09:27:27,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:27,681 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:27,681 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:27,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:27:27,682 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:27,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash 245285443, now seen corresponding path program 1 times [2022-11-20 09:27:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:27,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479463438] [2022-11-20 09:27:27,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:27,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:28,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:28,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479463438] [2022-11-20 09:27:28,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479463438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:28,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:28,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850717588] [2022-11-20 09:27:28,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:28,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:28,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:28,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:28,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:28,467 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 362 [2022-11-20 09:27:28,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:28,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:28,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 362 [2022-11-20 09:27:28,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:29,758 INFO L130 PetriNetUnfolder]: 1533/3735 cut-off events. [2022-11-20 09:27:29,758 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 09:27:29,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6001 conditions, 3735 events. 1533/3735 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 26042 event pairs, 1176 based on Foata normal form. 0/3209 useless extension candidates. Maximal degree in co-relation 5966. Up to 2206 conditions per place. [2022-11-20 09:27:29,803 INFO L137 encePairwiseOnDemand]: 344/362 looper letters, 72 selfloop transitions, 15 changer transitions 0/298 dead transitions. [2022-11-20 09:27:29,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 298 transitions, 781 flow [2022-11-20 09:27:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:27:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1566 transitions. [2022-11-20 09:27:29,808 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7209944751381215 [2022-11-20 09:27:29,808 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1566 transitions. [2022-11-20 09:27:29,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1566 transitions. [2022-11-20 09:27:29,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:29,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1566 transitions. [2022-11-20 09:27:29,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:29,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:29,822 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:29,822 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 613 flow. Second operand 6 states and 1566 transitions. [2022-11-20 09:27:29,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 298 transitions, 781 flow [2022-11-20 09:27:29,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 298 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:27:29,830 INFO L231 Difference]: Finished difference. Result has 301 places, 298 transitions, 633 flow [2022-11-20 09:27:29,831 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=301, PETRI_TRANSITIONS=298} [2022-11-20 09:27:29,831 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-11-20 09:27:29,832 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 298 transitions, 633 flow [2022-11-20 09:27:29,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:29,833 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:29,833 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:29,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:27:29,834 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:29,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash 928307443, now seen corresponding path program 1 times [2022-11-20 09:27:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:29,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659427221] [2022-11-20 09:27:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:29,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:29,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:29,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659427221] [2022-11-20 09:27:29,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659427221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:29,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:29,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:29,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845627210] [2022-11-20 09:27:29,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:29,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:29,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:29,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:29,939 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-20 09:27:29,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 298 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:29,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:29,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-20 09:27:29,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:30,233 INFO L130 PetriNetUnfolder]: 94/912 cut-off events. [2022-11-20 09:27:30,233 INFO L131 PetriNetUnfolder]: For 20/23 co-relation queries the response was YES. [2022-11-20 09:27:30,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 912 events. 94/912 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4326 event pairs, 45 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1040. Up to 131 conditions per place. [2022-11-20 09:27:30,243 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 15 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2022-11-20 09:27:30,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 297 transitions, 665 flow [2022-11-20 09:27:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2022-11-20 09:27:30,246 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8950276243093923 [2022-11-20 09:27:30,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2022-11-20 09:27:30,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2022-11-20 09:27:30,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:30,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2022-11-20 09:27:30,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,254 INFO L175 Difference]: Start difference. First operand has 301 places, 298 transitions, 633 flow. Second operand 3 states and 972 transitions. [2022-11-20 09:27:30,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 297 transitions, 665 flow [2022-11-20 09:27:30,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 297 transitions, 635 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 09:27:30,260 INFO L231 Difference]: Finished difference. Result has 297 places, 297 transitions, 605 flow [2022-11-20 09:27:30,261 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=297, PETRI_TRANSITIONS=297} [2022-11-20 09:27:30,261 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -33 predicate places. [2022-11-20 09:27:30,262 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 297 transitions, 605 flow [2022-11-20 09:27:30,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:30,263 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:30,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:27:30,264 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:30,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash -986290866, now seen corresponding path program 1 times [2022-11-20 09:27:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:30,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336975656] [2022-11-20 09:27:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:30,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:30,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336975656] [2022-11-20 09:27:30,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336975656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:30,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:30,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574247467] [2022-11-20 09:27:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:30,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:30,333 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-11-20 09:27:30,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 297 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:30,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-11-20 09:27:30,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:30,502 INFO L130 PetriNetUnfolder]: 35/400 cut-off events. [2022-11-20 09:27:30,502 INFO L131 PetriNetUnfolder]: For 14/17 co-relation queries the response was YES. [2022-11-20 09:27:30,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 400 events. 35/400 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 940 event pairs, 12 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 423. Up to 48 conditions per place. [2022-11-20 09:27:30,506 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 12 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2022-11-20 09:27:30,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 296 transitions, 631 flow [2022-11-20 09:27:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2022-11-20 09:27:30,509 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9005524861878453 [2022-11-20 09:27:30,509 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 978 transitions. [2022-11-20 09:27:30,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 978 transitions. [2022-11-20 09:27:30,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:30,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 978 transitions. [2022-11-20 09:27:30,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,516 INFO L175 Difference]: Start difference. First operand has 297 places, 297 transitions, 605 flow. Second operand 3 states and 978 transitions. [2022-11-20 09:27:30,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 296 transitions, 631 flow [2022-11-20 09:27:30,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 296 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:27:30,522 INFO L231 Difference]: Finished difference. Result has 296 places, 296 transitions, 603 flow [2022-11-20 09:27:30,522 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=296, PETRI_TRANSITIONS=296} [2022-11-20 09:27:30,523 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -34 predicate places. [2022-11-20 09:27:30,523 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 296 transitions, 603 flow [2022-11-20 09:27:30,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,524 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:30,525 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:30,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:27:30,525 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:30,526 INFO L85 PathProgramCache]: Analyzing trace with hash -390066838, now seen corresponding path program 1 times [2022-11-20 09:27:30,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:30,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390437715] [2022-11-20 09:27:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:30,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:30,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390437715] [2022-11-20 09:27:30,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390437715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:30,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:30,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:30,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998272993] [2022-11-20 09:27:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:30,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:30,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:30,590 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-20 09:27:30,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 296 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 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) [2022-11-20 09:27:30,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:30,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-20 09:27:30,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:30,846 INFO L130 PetriNetUnfolder]: 119/893 cut-off events. [2022-11-20 09:27:30,847 INFO L131 PetriNetUnfolder]: For 20/25 co-relation queries the response was YES. [2022-11-20 09:27:30,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 893 events. 119/893 cut-off events. For 20/25 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4472 event pairs, 45 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 1058. Up to 120 conditions per place. [2022-11-20 09:27:30,855 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 18 selfloop transitions, 3 changer transitions 0/299 dead transitions. [2022-11-20 09:27:30,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 299 transitions, 653 flow [2022-11-20 09:27:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2022-11-20 09:27:30,859 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8996316758747698 [2022-11-20 09:27:30,859 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 977 transitions. [2022-11-20 09:27:30,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 977 transitions. [2022-11-20 09:27:30,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:30,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 977 transitions. [2022-11-20 09:27:30,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,865 INFO L175 Difference]: Start difference. First operand has 296 places, 296 transitions, 603 flow. Second operand 3 states and 977 transitions. [2022-11-20 09:27:30,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 299 transitions, 653 flow [2022-11-20 09:27:30,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 299 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:27:30,871 INFO L231 Difference]: Finished difference. Result has 294 places, 294 transitions, 601 flow [2022-11-20 09:27:30,872 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=294, PETRI_TRANSITIONS=294} [2022-11-20 09:27:30,872 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -36 predicate places. [2022-11-20 09:27:30,873 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 294 transitions, 601 flow [2022-11-20 09:27:30,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 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) [2022-11-20 09:27:30,873 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:30,874 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:30,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:27:30,874 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:30,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1192045716, now seen corresponding path program 1 times [2022-11-20 09:27:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:30,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844451696] [2022-11-20 09:27:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:30,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:30,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844451696] [2022-11-20 09:27:30,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844451696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:30,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:30,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:30,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590890935] [2022-11-20 09:27:30,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:30,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:30,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:30,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:30,945 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-11-20 09:27:30,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 294 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:30,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:30,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-11-20 09:27:30,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:31,196 INFO L130 PetriNetUnfolder]: 84/837 cut-off events. [2022-11-20 09:27:31,200 INFO L131 PetriNetUnfolder]: For 25/30 co-relation queries the response was YES. [2022-11-20 09:27:31,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 837 events. 84/837 cut-off events. For 25/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3966 event pairs, 8 based on Foata normal form. 1/749 useless extension candidates. Maximal degree in co-relation 954. Up to 102 conditions per place. [2022-11-20 09:27:31,211 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 20 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-11-20 09:27:31,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 302 transitions, 666 flow [2022-11-20 09:27:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 986 transitions. [2022-11-20 09:27:31,214 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9079189686924494 [2022-11-20 09:27:31,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 986 transitions. [2022-11-20 09:27:31,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 986 transitions. [2022-11-20 09:27:31,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:31,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 986 transitions. [2022-11-20 09:27:31,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:31,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:31,220 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:31,220 INFO L175 Difference]: Start difference. First operand has 294 places, 294 transitions, 601 flow. Second operand 3 states and 986 transitions. [2022-11-20 09:27:31,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 302 transitions, 666 flow [2022-11-20 09:27:31,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 302 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:27:31,227 INFO L231 Difference]: Finished difference. Result has 294 places, 295 transitions, 607 flow [2022-11-20 09:27:31,227 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=294, PETRI_TRANSITIONS=295} [2022-11-20 09:27:31,230 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -36 predicate places. [2022-11-20 09:27:31,230 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 295 transitions, 607 flow [2022-11-20 09:27:31,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:31,231 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:31,231 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:31,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:27:31,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:31,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2023219472, now seen corresponding path program 1 times [2022-11-20 09:27:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:31,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73935815] [2022-11-20 09:27:31,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:31,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:31,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:31,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73935815] [2022-11-20 09:27:31,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73935815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:31,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:31,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806878296] [2022-11-20 09:27:31,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:31,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:31,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:31,460 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 362 [2022-11-20 09:27:31,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 295 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:31,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:31,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 362 [2022-11-20 09:27:31,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:33,434 INFO L130 PetriNetUnfolder]: 2045/5891 cut-off events. [2022-11-20 09:27:33,434 INFO L131 PetriNetUnfolder]: For 328/417 co-relation queries the response was YES. [2022-11-20 09:27:33,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9416 conditions, 5891 events. 2045/5891 cut-off events. For 328/417 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 45758 event pairs, 968 based on Foata normal form. 2/4763 useless extension candidates. Maximal degree in co-relation 9379. Up to 2066 conditions per place. [2022-11-20 09:27:33,482 INFO L137 encePairwiseOnDemand]: 343/362 looper letters, 196 selfloop transitions, 28 changer transitions 0/433 dead transitions. [2022-11-20 09:27:33,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 433 transitions, 1367 flow [2022-11-20 09:27:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:27:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 09:27:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2949 transitions. [2022-11-20 09:27:33,489 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7405826217980914 [2022-11-20 09:27:33,490 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2949 transitions. [2022-11-20 09:27:33,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2949 transitions. [2022-11-20 09:27:33,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:33,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2949 transitions. [2022-11-20 09:27:33,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 268.09090909090907) internal successors, (2949), 11 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:33,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:33,508 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:33,508 INFO L175 Difference]: Start difference. First operand has 294 places, 295 transitions, 607 flow. Second operand 11 states and 2949 transitions. [2022-11-20 09:27:33,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 433 transitions, 1367 flow [2022-11-20 09:27:33,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 433 transitions, 1367 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 09:27:33,517 INFO L231 Difference]: Finished difference. Result has 308 places, 312 transitions, 740 flow [2022-11-20 09:27:33,518 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=740, PETRI_PLACES=308, PETRI_TRANSITIONS=312} [2022-11-20 09:27:33,518 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -22 predicate places. [2022-11-20 09:27:33,519 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 312 transitions, 740 flow [2022-11-20 09:27:33,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:33,520 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:33,520 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:33,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:27:33,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:33,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1104760021, now seen corresponding path program 1 times [2022-11-20 09:27:33,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:33,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121057381] [2022-11-20 09:27:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:34,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:34,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121057381] [2022-11-20 09:27:34,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121057381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:34,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:34,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366541005] [2022-11-20 09:27:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:34,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:34,137 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-11-20 09:27:34,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 312 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:34,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:34,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-11-20 09:27:34,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:37,181 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][230], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 273#L97-1true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,181 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-20 09:27:37,181 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-20 09:27:37,182 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-20 09:27:37,182 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-20 09:27:37,183 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][259], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 73#L97-3true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,183 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-20 09:27:37,183 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 09:27:37,183 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-20 09:27:37,183 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 09:27:37,184 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][260], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 417#true, 90#L97-4true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,184 INFO L383 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-11-20 09:27:37,185 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-20 09:27:37,185 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-20 09:27:37,185 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-20 09:27:37,186 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][261], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 155#L97-2true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,186 INFO L383 tUnfolder$Statistics]: this new event has 243 ancestors and is cut-off event [2022-11-20 09:27:37,186 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-20 09:27:37,186 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-20 09:27:37,186 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-20 09:27:37,187 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 417#true, 7#L97-6true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,187 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-20 09:27:37,188 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-20 09:27:37,188 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-20 09:27:37,188 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-20 09:27:37,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 36#L97-5true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,189 INFO L383 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-11-20 09:27:37,189 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-20 09:27:37,189 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 09:27:37,189 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 09:27:37,205 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][230], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 273#L97-1true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,206 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-20 09:27:37,206 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 09:27:37,206 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-20 09:27:37,206 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-20 09:27:37,207 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][259], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 73#L97-3true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,207 INFO L383 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-11-20 09:27:37,208 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-20 09:27:37,208 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 09:27:37,208 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-20 09:27:37,209 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][260], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 417#true, 90#L97-4true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,209 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-20 09:27:37,209 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-20 09:27:37,209 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-20 09:27:37,210 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-20 09:27:37,210 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][261], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 155#L97-2true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,211 INFO L383 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-11-20 09:27:37,211 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-20 09:27:37,211 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-20 09:27:37,211 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-20 09:27:37,212 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 36#L97-5true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,212 INFO L383 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-11-20 09:27:37,212 INFO L386 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-11-20 09:27:37,212 INFO L386 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-11-20 09:27:37,213 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-20 09:27:37,213 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 417#true, 7#L97-6true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-20 09:27:37,213 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-20 09:27:37,214 INFO L386 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-11-20 09:27:37,214 INFO L386 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-11-20 09:27:37,214 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-20 09:27:37,265 INFO L130 PetriNetUnfolder]: 2820/7139 cut-off events. [2022-11-20 09:27:37,266 INFO L131 PetriNetUnfolder]: For 1311/1341 co-relation queries the response was YES. [2022-11-20 09:27:37,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12944 conditions, 7139 events. 2820/7139 cut-off events. For 1311/1341 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 54946 event pairs, 537 based on Foata normal form. 24/6584 useless extension candidates. Maximal degree in co-relation 12900. Up to 2540 conditions per place. [2022-11-20 09:27:37,350 INFO L137 encePairwiseOnDemand]: 355/362 looper letters, 129 selfloop transitions, 13 changer transitions 0/395 dead transitions. [2022-11-20 09:27:37,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 395 transitions, 1213 flow [2022-11-20 09:27:37,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:27:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1776 transitions. [2022-11-20 09:27:37,354 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8176795580110497 [2022-11-20 09:27:37,355 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1776 transitions. [2022-11-20 09:27:37,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1776 transitions. [2022-11-20 09:27:37,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:37,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1776 transitions. [2022-11-20 09:27:37,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:37,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:37,365 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:37,365 INFO L175 Difference]: Start difference. First operand has 308 places, 312 transitions, 740 flow. Second operand 6 states and 1776 transitions. [2022-11-20 09:27:37,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 395 transitions, 1213 flow [2022-11-20 09:27:37,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 395 transitions, 1208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:27:37,379 INFO L231 Difference]: Finished difference. Result has 316 places, 324 transitions, 845 flow [2022-11-20 09:27:37,380 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=845, PETRI_PLACES=316, PETRI_TRANSITIONS=324} [2022-11-20 09:27:37,381 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -14 predicate places. [2022-11-20 09:27:37,381 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 324 transitions, 845 flow [2022-11-20 09:27:37,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:37,382 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:37,382 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:37,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:27:37,385 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425965, now seen corresponding path program 1 times [2022-11-20 09:27:37,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:37,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153937346] [2022-11-20 09:27:37,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:37,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:37,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:37,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153937346] [2022-11-20 09:27:37,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153937346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:37,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:37,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:37,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680943066] [2022-11-20 09:27:37,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:37,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:37,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:37,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:37,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:37,638 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 362 [2022-11-20 09:27:37,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 324 transitions, 845 flow. Second operand has 7 states, 7 states have (on average 266.57142857142856) internal successors, (1866), 7 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:37,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:37,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 362 [2022-11-20 09:27:37,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:39,280 INFO L130 PetriNetUnfolder]: 2324/5495 cut-off events. [2022-11-20 09:27:39,281 INFO L131 PetriNetUnfolder]: For 3502/4137 co-relation queries the response was YES. [2022-11-20 09:27:39,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10935 conditions, 5495 events. 2324/5495 cut-off events. For 3502/4137 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 39778 event pairs, 1130 based on Foata normal form. 37/4428 useless extension candidates. Maximal degree in co-relation 10889. Up to 2836 conditions per place. [2022-11-20 09:27:39,348 INFO L137 encePairwiseOnDemand]: 343/362 looper letters, 178 selfloop transitions, 28 changer transitions 0/435 dead transitions. [2022-11-20 09:27:39,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 435 transitions, 1511 flow [2022-11-20 09:27:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:27:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 09:27:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3081 transitions. [2022-11-20 09:27:39,355 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7737317930688097 [2022-11-20 09:27:39,355 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3081 transitions. [2022-11-20 09:27:39,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3081 transitions. [2022-11-20 09:27:39,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:39,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3081 transitions. [2022-11-20 09:27:39,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 280.09090909090907) internal successors, (3081), 11 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:39,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:39,372 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:39,372 INFO L175 Difference]: Start difference. First operand has 316 places, 324 transitions, 845 flow. Second operand 11 states and 3081 transitions. [2022-11-20 09:27:39,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 435 transitions, 1511 flow [2022-11-20 09:27:39,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 435 transitions, 1511 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 09:27:39,384 INFO L231 Difference]: Finished difference. Result has 328 places, 326 transitions, 913 flow [2022-11-20 09:27:39,385 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=913, PETRI_PLACES=328, PETRI_TRANSITIONS=326} [2022-11-20 09:27:39,386 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -2 predicate places. [2022-11-20 09:27:39,386 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 326 transitions, 913 flow [2022-11-20 09:27:39,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 266.57142857142856) internal successors, (1866), 7 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:39,387 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:39,387 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:39,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:27:39,387 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:39,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1726760843, now seen corresponding path program 1 times [2022-11-20 09:27:39,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:39,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865749235] [2022-11-20 09:27:39,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:39,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:39,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865749235] [2022-11-20 09:27:39,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865749235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:39,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:39,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:39,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432334796] [2022-11-20 09:27:39,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:39,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:39,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:39,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:39,993 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-11-20 09:27:39,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 326 transitions, 913 flow. Second operand has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:39,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:39,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-11-20 09:27:39,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:42,077 INFO L130 PetriNetUnfolder]: 2259/7129 cut-off events. [2022-11-20 09:27:42,077 INFO L131 PetriNetUnfolder]: For 5284/5389 co-relation queries the response was YES. [2022-11-20 09:27:42,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14516 conditions, 7129 events. 2259/7129 cut-off events. For 5284/5389 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 63375 event pairs, 1240 based on Foata normal form. 12/6638 useless extension candidates. Maximal degree in co-relation 14465. Up to 3011 conditions per place. [2022-11-20 09:27:42,168 INFO L137 encePairwiseOnDemand]: 355/362 looper letters, 86 selfloop transitions, 17 changer transitions 0/358 dead transitions. [2022-11-20 09:27:42,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 358 transitions, 1253 flow [2022-11-20 09:27:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:27:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1721 transitions. [2022-11-20 09:27:42,173 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7923572744014733 [2022-11-20 09:27:42,174 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1721 transitions. [2022-11-20 09:27:42,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1721 transitions. [2022-11-20 09:27:42,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:42,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1721 transitions. [2022-11-20 09:27:42,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.8333333333333) internal successors, (1721), 6 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:42,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:42,185 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:42,185 INFO L175 Difference]: Start difference. First operand has 328 places, 326 transitions, 913 flow. Second operand 6 states and 1721 transitions. [2022-11-20 09:27:42,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 358 transitions, 1253 flow [2022-11-20 09:27:42,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 358 transitions, 1228 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 09:27:42,216 INFO L231 Difference]: Finished difference. Result has 333 places, 342 transitions, 1072 flow [2022-11-20 09:27:42,217 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1072, PETRI_PLACES=333, PETRI_TRANSITIONS=342} [2022-11-20 09:27:42,218 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 3 predicate places. [2022-11-20 09:27:42,218 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 342 transitions, 1072 flow [2022-11-20 09:27:42,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:42,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:42,220 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:42,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:27:42,220 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:42,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:42,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1654158590, now seen corresponding path program 1 times [2022-11-20 09:27:42,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:42,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773663983] [2022-11-20 09:27:42,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:42,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:42,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:42,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773663983] [2022-11-20 09:27:42,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773663983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:42,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:42,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:42,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29328009] [2022-11-20 09:27:42,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:42,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:42,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:42,978 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-11-20 09:27:42,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 342 transitions, 1072 flow. Second operand has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:42,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:42,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-11-20 09:27:42,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:44,812 INFO L130 PetriNetUnfolder]: 2278/7172 cut-off events. [2022-11-20 09:27:44,812 INFO L131 PetriNetUnfolder]: For 7573/7714 co-relation queries the response was YES. [2022-11-20 09:27:44,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15476 conditions, 7172 events. 2278/7172 cut-off events. For 7573/7714 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 63662 event pairs, 1321 based on Foata normal form. 0/6685 useless extension candidates. Maximal degree in co-relation 15423. Up to 3204 conditions per place. [2022-11-20 09:27:44,905 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 90 selfloop transitions, 4 changer transitions 0/349 dead transitions. [2022-11-20 09:27:44,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 349 transitions, 1274 flow [2022-11-20 09:27:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:27:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1704 transitions. [2022-11-20 09:27:44,913 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7845303867403315 [2022-11-20 09:27:44,913 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1704 transitions. [2022-11-20 09:27:44,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1704 transitions. [2022-11-20 09:27:44,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:44,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1704 transitions. [2022-11-20 09:27:44,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:44,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:44,924 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:44,924 INFO L175 Difference]: Start difference. First operand has 333 places, 342 transitions, 1072 flow. Second operand 6 states and 1704 transitions. [2022-11-20 09:27:44,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 349 transitions, 1274 flow [2022-11-20 09:27:44,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 349 transitions, 1274 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 09:27:44,950 INFO L231 Difference]: Finished difference. Result has 337 places, 341 transitions, 1078 flow [2022-11-20 09:27:44,951 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1078, PETRI_PLACES=337, PETRI_TRANSITIONS=341} [2022-11-20 09:27:44,952 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 7 predicate places. [2022-11-20 09:27:44,952 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 341 transitions, 1078 flow [2022-11-20 09:27:44,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:44,953 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:44,953 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:44,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:27:44,954 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1497435077, now seen corresponding path program 1 times [2022-11-20 09:27:44,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:44,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113489160] [2022-11-20 09:27:44,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:44,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:27:45,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:45,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113489160] [2022-11-20 09:27:45,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113489160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:45,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:45,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988666260] [2022-11-20 09:27:45,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:45,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:45,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:45,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:45,773 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 362 [2022-11-20 09:27:45,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 341 transitions, 1078 flow. Second operand has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:45,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:45,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 362 [2022-11-20 09:27:45,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:48,895 INFO L130 PetriNetUnfolder]: 4571/12219 cut-off events. [2022-11-20 09:27:48,895 INFO L131 PetriNetUnfolder]: For 14795/15254 co-relation queries the response was YES. [2022-11-20 09:27:48,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28561 conditions, 12219 events. 4571/12219 cut-off events. For 14795/15254 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 113995 event pairs, 1236 based on Foata normal form. 21/11704 useless extension candidates. Maximal degree in co-relation 28508. Up to 4740 conditions per place. [2022-11-20 09:27:49,269 INFO L137 encePairwiseOnDemand]: 354/362 looper letters, 156 selfloop transitions, 26 changer transitions 0/430 dead transitions. [2022-11-20 09:27:49,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 430 transitions, 1876 flow [2022-11-20 09:27:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:27:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1740 transitions. [2022-11-20 09:27:49,280 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8011049723756906 [2022-11-20 09:27:49,280 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1740 transitions. [2022-11-20 09:27:49,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1740 transitions. [2022-11-20 09:27:49,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:49,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1740 transitions. [2022-11-20 09:27:49,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:49,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:49,303 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:49,303 INFO L175 Difference]: Start difference. First operand has 337 places, 341 transitions, 1078 flow. Second operand 6 states and 1740 transitions. [2022-11-20 09:27:49,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 430 transitions, 1876 flow [2022-11-20 09:27:49,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 430 transitions, 1869 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 09:27:49,403 INFO L231 Difference]: Finished difference. Result has 343 places, 366 transitions, 1375 flow [2022-11-20 09:27:49,404 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1375, PETRI_PLACES=343, PETRI_TRANSITIONS=366} [2022-11-20 09:27:49,405 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2022-11-20 09:27:49,405 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 366 transitions, 1375 flow [2022-11-20 09:27:49,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:49,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:49,406 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:49,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:27:49,407 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:49,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2019895496, now seen corresponding path program 1 times [2022-11-20 09:27:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:49,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319684691] [2022-11-20 09:27:49,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:27:49,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:49,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319684691] [2022-11-20 09:27:49,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319684691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:49,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:49,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:49,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080357271] [2022-11-20 09:27:49,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:49,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:49,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:49,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:49,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:49,490 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 362 [2022-11-20 09:27:49,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 366 transitions, 1375 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:49,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:49,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 362 [2022-11-20 09:27:49,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:51,170 INFO L130 PetriNetUnfolder]: 1650/5708 cut-off events. [2022-11-20 09:27:51,170 INFO L131 PetriNetUnfolder]: For 15727/15919 co-relation queries the response was YES. [2022-11-20 09:27:51,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14626 conditions, 5708 events. 1650/5708 cut-off events. For 15727/15919 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 49984 event pairs, 335 based on Foata normal form. 0/5409 useless extension candidates. Maximal degree in co-relation 14570. Up to 1509 conditions per place. [2022-11-20 09:27:51,246 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 70 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2022-11-20 09:27:51,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 379 transitions, 1641 flow [2022-11-20 09:27:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2022-11-20 09:27:51,250 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8941068139963168 [2022-11-20 09:27:51,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2022-11-20 09:27:51,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2022-11-20 09:27:51,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:51,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2022-11-20 09:27:51,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:51,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:51,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:51,259 INFO L175 Difference]: Start difference. First operand has 343 places, 366 transitions, 1375 flow. Second operand 3 states and 971 transitions. [2022-11-20 09:27:51,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 379 transitions, 1641 flow [2022-11-20 09:27:51,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 379 transitions, 1571 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-11-20 09:27:51,312 INFO L231 Difference]: Finished difference. Result has 344 places, 365 transitions, 1321 flow [2022-11-20 09:27:51,313 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=344, PETRI_TRANSITIONS=365} [2022-11-20 09:27:51,314 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 14 predicate places. [2022-11-20 09:27:51,314 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 365 transitions, 1321 flow [2022-11-20 09:27:51,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:51,315 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:51,315 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:51,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:27:51,315 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash -639229830, now seen corresponding path program 1 times [2022-11-20 09:27:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:51,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790922664] [2022-11-20 09:27:51,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:51,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:51,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790922664] [2022-11-20 09:27:51,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790922664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:51,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:51,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032228] [2022-11-20 09:27:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:51,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:51,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:51,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:51,414 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 362 [2022-11-20 09:27:51,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 365 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:51,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:51,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 362 [2022-11-20 09:27:51,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:52,380 INFO L130 PetriNetUnfolder]: 908/3585 cut-off events. [2022-11-20 09:27:52,380 INFO L131 PetriNetUnfolder]: For 7110/7214 co-relation queries the response was YES. [2022-11-20 09:27:52,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8184 conditions, 3585 events. 908/3585 cut-off events. For 7110/7214 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 28836 event pairs, 142 based on Foata normal form. 0/3243 useless extension candidates. Maximal degree in co-relation 8127. Up to 940 conditions per place. [2022-11-20 09:27:52,422 INFO L137 encePairwiseOnDemand]: 360/362 looper letters, 51 selfloop transitions, 1 changer transitions 0/364 dead transitions. [2022-11-20 09:27:52,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 364 transitions, 1423 flow [2022-11-20 09:27:52,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2022-11-20 09:27:52,427 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9060773480662984 [2022-11-20 09:27:52,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 984 transitions. [2022-11-20 09:27:52,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 984 transitions. [2022-11-20 09:27:52,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:52,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 984 transitions. [2022-11-20 09:27:52,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:52,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:52,434 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:52,434 INFO L175 Difference]: Start difference. First operand has 344 places, 365 transitions, 1321 flow. Second operand 3 states and 984 transitions. [2022-11-20 09:27:52,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 364 transitions, 1423 flow [2022-11-20 09:27:52,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 364 transitions, 1419 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:27:52,457 INFO L231 Difference]: Finished difference. Result has 343 places, 364 transitions, 1317 flow [2022-11-20 09:27:52,458 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=343, PETRI_TRANSITIONS=364} [2022-11-20 09:27:52,459 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2022-11-20 09:27:52,459 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 364 transitions, 1317 flow [2022-11-20 09:27:52,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:52,460 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:52,460 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:52,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:27:52,460 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:52,461 INFO L85 PathProgramCache]: Analyzing trace with hash -27302517, now seen corresponding path program 1 times [2022-11-20 09:27:52,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:52,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700541533] [2022-11-20 09:27:52,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:52,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:27:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:52,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700541533] [2022-11-20 09:27:52,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700541533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:52,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:52,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632400590] [2022-11-20 09:27:52,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:52,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:52,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:52,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:52,550 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-20 09:27:52,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 364 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 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) [2022-11-20 09:27:52,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:52,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-20 09:27:52,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:53,738 INFO L130 PetriNetUnfolder]: 1684/5304 cut-off events. [2022-11-20 09:27:53,738 INFO L131 PetriNetUnfolder]: For 12171/12404 co-relation queries the response was YES. [2022-11-20 09:27:53,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13120 conditions, 5304 events. 1684/5304 cut-off events. For 12171/12404 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 43265 event pairs, 302 based on Foata normal form. 6/4752 useless extension candidates. Maximal degree in co-relation 13063. Up to 1546 conditions per place. [2022-11-20 09:27:53,794 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 66 selfloop transitions, 2 changer transitions 23/376 dead transitions. [2022-11-20 09:27:53,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 376 transitions, 1563 flow [2022-11-20 09:27:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2022-11-20 09:27:53,798 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8987108655616943 [2022-11-20 09:27:53,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 976 transitions. [2022-11-20 09:27:53,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 976 transitions. [2022-11-20 09:27:53,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:53,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 976 transitions. [2022-11-20 09:27:53,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:53,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:53,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:53,804 INFO L175 Difference]: Start difference. First operand has 343 places, 364 transitions, 1317 flow. Second operand 3 states and 976 transitions. [2022-11-20 09:27:53,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 376 transitions, 1563 flow [2022-11-20 09:27:53,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 376 transitions, 1562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 09:27:53,825 INFO L231 Difference]: Finished difference. Result has 342 places, 339 transitions, 1203 flow [2022-11-20 09:27:53,826 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=342, PETRI_TRANSITIONS=339} [2022-11-20 09:27:53,826 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 12 predicate places. [2022-11-20 09:27:53,826 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 339 transitions, 1203 flow [2022-11-20 09:27:53,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 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) [2022-11-20 09:27:53,827 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:53,827 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:53,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:27:53,828 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:53,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash -467883571, now seen corresponding path program 1 times [2022-11-20 09:27:53,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:53,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551557101] [2022-11-20 09:27:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:27:53,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:53,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551557101] [2022-11-20 09:27:53,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551557101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:53,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:53,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082109804] [2022-11-20 09:27:53,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:53,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:53,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:53,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:53,906 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-11-20 09:27:53,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 339 transitions, 1203 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:53,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:53,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-11-20 09:27:53,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:27:54,452 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][331], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 494#(= |#race~bsum~0| 0), 47#L73true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, 7#L97-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 417#true, 307#L51-3true, 453#true, 388#(= |#race~A~0| 0)]) [2022-11-20 09:27:54,453 INFO L383 tUnfolder$Statistics]: this new event has 232 ancestors and is cut-off event [2022-11-20 09:27:54,453 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 09:27:54,453 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-20 09:27:54,453 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-20 09:27:54,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][331], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 494#(= |#race~bsum~0| 0), 47#L73true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, 7#L97-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 417#true, 4#L51-4true, 453#true, 388#(= |#race~A~0| 0)]) [2022-11-20 09:27:54,466 INFO L383 tUnfolder$Statistics]: this new event has 233 ancestors and is cut-off event [2022-11-20 09:27:54,466 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-20 09:27:54,466 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-20 09:27:54,466 INFO L386 tUnfolder$Statistics]: existing Event has 226 ancestors and is cut-off event [2022-11-20 09:27:54,502 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][331], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 494#(= |#race~bsum~0| 0), Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, 7#L97-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 417#true, 307#L51-3true, 453#true, 388#(= |#race~A~0| 0)]) [2022-11-20 09:27:54,503 INFO L383 tUnfolder$Statistics]: this new event has 227 ancestors and is cut-off event [2022-11-20 09:27:54,503 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-20 09:27:54,503 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-20 09:27:54,503 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-20 09:27:54,506 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][331], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 494#(= |#race~bsum~0| 0), Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, 7#L97-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 417#true, 4#L51-4true, 453#true, 388#(= |#race~A~0| 0)]) [2022-11-20 09:27:54,506 INFO L383 tUnfolder$Statistics]: this new event has 228 ancestors and is cut-off event [2022-11-20 09:27:54,506 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-20 09:27:54,506 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-20 09:27:54,506 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-20 09:27:54,631 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] thread1EXIT-->L97-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][303], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 492#true, 47#L73true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 180#L97-7true, 472#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 417#true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 453#true, 388#(= |#race~A~0| 0)]) [2022-11-20 09:27:54,631 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-20 09:27:54,632 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-20 09:27:54,632 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-20 09:27:54,632 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-20 09:27:54,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][331], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 492#true, 47#L73true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, 7#L97-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 417#true, 127#L50-10true, 453#true, 388#(= |#race~A~0| 0)]) [2022-11-20 09:27:54,634 INFO L383 tUnfolder$Statistics]: this new event has 254 ancestors and is cut-off event [2022-11-20 09:27:54,634 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-20 09:27:54,634 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-20 09:27:54,634 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-20 09:27:54,646 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] thread1EXIT-->L97-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][303], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 492#true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, 180#L97-7true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 417#true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 453#true, 388#(= |#race~A~0| 0)]) [2022-11-20 09:27:54,647 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-20 09:27:54,647 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-20 09:27:54,647 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-20 09:27:54,647 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-20 09:27:54,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][331], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 492#true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, 7#L97-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 417#true, 127#L50-10true, 453#true, 388#(= |#race~A~0| 0)]) [2022-11-20 09:27:54,650 INFO L383 tUnfolder$Statistics]: this new event has 256 ancestors and is cut-off event [2022-11-20 09:27:54,650 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 09:27:54,650 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 09:27:54,650 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-20 09:27:54,669 INFO L130 PetriNetUnfolder]: 1110/3693 cut-off events. [2022-11-20 09:27:54,670 INFO L131 PetriNetUnfolder]: For 9142/9321 co-relation queries the response was YES. [2022-11-20 09:27:54,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9389 conditions, 3693 events. 1110/3693 cut-off events. For 9142/9321 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 29161 event pairs, 70 based on Foata normal form. 0/3326 useless extension candidates. Maximal degree in co-relation 9358. Up to 1142 conditions per place. [2022-11-20 09:27:54,710 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 50 selfloop transitions, 35 changer transitions 0/370 dead transitions. [2022-11-20 09:27:54,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 370 transitions, 1633 flow [2022-11-20 09:27:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:27:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2022-11-20 09:27:54,713 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9060773480662984 [2022-11-20 09:27:54,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 984 transitions. [2022-11-20 09:27:54,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 984 transitions. [2022-11-20 09:27:54,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:27:54,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 984 transitions. [2022-11-20 09:27:54,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:54,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:54,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:54,719 INFO L175 Difference]: Start difference. First operand has 342 places, 339 transitions, 1203 flow. Second operand 3 states and 984 transitions. [2022-11-20 09:27:54,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 370 transitions, 1633 flow [2022-11-20 09:27:54,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 370 transitions, 1585 flow, removed 8 selfloop flow, removed 10 redundant places. [2022-11-20 09:27:54,741 INFO L231 Difference]: Finished difference. Result has 317 places, 364 transitions, 1556 flow [2022-11-20 09:27:54,742 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=317, PETRI_TRANSITIONS=364} [2022-11-20 09:27:54,742 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -13 predicate places. [2022-11-20 09:27:54,743 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 364 transitions, 1556 flow [2022-11-20 09:27:54,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:54,743 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:27:54,743 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:54,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 09:27:54,744 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:27:54,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash 915658543, now seen corresponding path program 1 times [2022-11-20 09:27:54,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:54,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625947541] [2022-11-20 09:27:54,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:27:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:57,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625947541] [2022-11-20 09:27:57,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625947541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:57,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:57,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 09:27:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897284536] [2022-11-20 09:27:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:57,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 09:27:57,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:57,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 09:27:57,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-11-20 09:27:57,043 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 362 [2022-11-20 09:27:57,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 364 transitions, 1556 flow. Second operand has 20 states, 20 states have (on average 227.4) internal successors, (4548), 20 states have internal predecessors, (4548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:57,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:27:57,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 362 [2022-11-20 09:27:57,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:28:18,901 INFO L130 PetriNetUnfolder]: 52327/91513 cut-off events. [2022-11-20 09:28:18,901 INFO L131 PetriNetUnfolder]: For 78329/78629 co-relation queries the response was YES. [2022-11-20 09:28:19,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223617 conditions, 91513 events. 52327/91513 cut-off events. For 78329/78629 co-relation queries the response was YES. Maximal size of possible extension queue 2166. Compared 868010 event pairs, 17181 based on Foata normal form. 293/84443 useless extension candidates. Maximal degree in co-relation 223555. Up to 23716 conditions per place. [2022-11-20 09:28:19,855 INFO L137 encePairwiseOnDemand]: 330/362 looper letters, 445 selfloop transitions, 74 changer transitions 0/700 dead transitions. [2022-11-20 09:28:19,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 700 transitions, 4957 flow [2022-11-20 09:28:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 09:28:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-11-20 09:28:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6995 transitions. [2022-11-20 09:28:19,872 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6441068139963168 [2022-11-20 09:28:19,872 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 6995 transitions. [2022-11-20 09:28:19,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 6995 transitions. [2022-11-20 09:28:19,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:28:19,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 6995 transitions. [2022-11-20 09:28:19,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 233.16666666666666) internal successors, (6995), 30 states have internal predecessors, (6995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:19,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 362.0) internal successors, (11222), 31 states have internal predecessors, (11222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:19,912 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 362.0) internal successors, (11222), 31 states have internal predecessors, (11222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:19,913 INFO L175 Difference]: Start difference. First operand has 317 places, 364 transitions, 1556 flow. Second operand 30 states and 6995 transitions. [2022-11-20 09:28:19,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 700 transitions, 4957 flow [2022-11-20 09:28:21,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 700 transitions, 4957 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 09:28:21,473 INFO L231 Difference]: Finished difference. Result has 351 places, 411 transitions, 2382 flow [2022-11-20 09:28:21,474 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2382, PETRI_PLACES=351, PETRI_TRANSITIONS=411} [2022-11-20 09:28:21,474 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 21 predicate places. [2022-11-20 09:28:21,474 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 411 transitions, 2382 flow [2022-11-20 09:28:21,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 227.4) internal successors, (4548), 20 states have internal predecessors, (4548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:21,476 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:28:21,476 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:21,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 09:28:21,477 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-20 09:28:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1297401461, now seen corresponding path program 2 times [2022-11-20 09:28:21,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:21,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189412540] [2022-11-20 09:28:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:21,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:28:23,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:23,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189412540] [2022-11-20 09:28:23,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189412540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:23,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:23,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-20 09:28:23,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501747022] [2022-11-20 09:28:23,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:23,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 09:28:23,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:23,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 09:28:23,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-11-20 09:28:23,525 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 362 [2022-11-20 09:28:23,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 411 transitions, 2382 flow. Second operand has 20 states, 20 states have (on average 227.4) internal successors, (4548), 20 states have internal predecessors, (4548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:23,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:28:23,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 362 [2022-11-20 09:28:23,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand