./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f 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_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8 --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 eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc --- 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-e04fb08 [2022-11-16 12:40:28,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:40:28,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:40:29,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:40:29,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:40:29,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:40:29,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:40:29,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:40:29,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:40:29,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:40:29,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:40:29,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:40:29,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:40:29,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:40:29,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:40:29,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:40:29,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:40:29,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:40:29,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:40:29,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:40:29,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:40:29,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:40:29,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:40:29,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:40:29,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:40:29,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:40:29,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:40:29,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:40:29,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:40:29,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:40:29,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:40:29,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:40:29,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:40:29,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:40:29,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:40:29,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:40:29,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:40:29,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:40:29,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:40:29,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:40:29,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:40:29,041 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 12:40:29,064 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:40:29,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:40:29,065 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:40:29,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:40:29,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:40:29,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:40:29,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:40:29,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:40:29,067 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:40:29,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:40:29,068 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:40:29,068 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:40:29,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:40:29,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:40:29,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:40:29,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:40:29,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:40:29,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:40:29,076 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 12:40:29,076 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:40:29,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:40:29,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:40:29,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:40:29,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:40:29,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:40:29,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:40:29,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:40:29,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:40:29,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:40:29,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:40:29,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:40:29,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:40:29,079 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:40:29,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:40:29,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:40:29,080 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_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/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_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8 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 -> eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc [2022-11-16 12:40:29,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:40:29,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:40:29,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:40:29,392 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:40:29,394 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:40:29,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2022-11-16 12:40:29,481 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/data/89382e2dd/1df39bfb11dc44a5b0cc21701019a5c3/FLAG94391db05 [2022-11-16 12:40:30,070 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:40:30,071 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2022-11-16 12:40:30,078 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/data/89382e2dd/1df39bfb11dc44a5b0cc21701019a5c3/FLAG94391db05 [2022-11-16 12:40:30,491 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/data/89382e2dd/1df39bfb11dc44a5b0cc21701019a5c3 [2022-11-16 12:40:30,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:40:30,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:40:30,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:40:30,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:40:30,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:40:30,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:30,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a307cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30, skipping insertion in model container [2022-11-16 12:40:30,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:30,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:40:30,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:40:30,850 WARN L229 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_5d5de7c5-9d73-406c-8344-6434e3d890bd/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-11-16 12:40:30,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:40:30,875 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:40:30,923 WARN L229 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_5d5de7c5-9d73-406c-8344-6434e3d890bd/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-11-16 12:40:30,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:40:30,957 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:40:30,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30 WrapperNode [2022-11-16 12:40:30,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:40:30,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:40:30,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:40:30,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:40:30,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:30,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:31,034 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 172 [2022-11-16 12:40:31,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:40:31,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:40:31,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:40:31,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:40:31,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:31,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:31,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:31,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:31,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:31,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:31,081 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:31,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:31,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:40:31,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:40:31,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:40:31,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:40:31,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (1/1) ... [2022-11-16 12:40:31,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:40:31,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:40:31,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:40:31,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5de7c5-9d73-406c-8344-6434e3d890bd/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:40:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:40:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:40:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:40:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:40:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 12:40:31,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 12:40:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 12:40:31,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 12:40:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 12:40:31,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 12:40:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:40:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:40:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:40:31,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:40:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:40:31,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:40:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:40:31,192 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:40:31,354 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:40:31,356 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:40:31,927 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:40:32,117 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:40:32,118 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-16 12:40:32,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:32 BoogieIcfgContainer [2022-11-16 12:40:32,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:40:32,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:40:32,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:40:32,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:40:32,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:40:30" (1/3) ... [2022-11-16 12:40:32,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a71b208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:32, skipping insertion in model container [2022-11-16 12:40:32,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:30" (2/3) ... [2022-11-16 12:40:32,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a71b208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:32, skipping insertion in model container [2022-11-16 12:40:32,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:32" (3/3) ... [2022-11-16 12:40:32,143 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2022-11-16 12:40:32,153 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:40:32,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:40:32,164 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-16 12:40:32,164 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:40:32,300 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 12:40:32,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 279 places, 285 transitions, 594 flow [2022-11-16 12:40:32,517 INFO L130 PetriNetUnfolder]: 16/282 cut-off events. [2022-11-16 12:40:32,518 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 12:40:32,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 282 events. 16/282 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 207. Up to 3 conditions per place. [2022-11-16 12:40:32,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 285 transitions, 594 flow [2022-11-16 12:40:32,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 262 transitions, 542 flow [2022-11-16 12:40:32,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:40:32,553 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;@4780390e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:40:32,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-16 12:40:32,563 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-16 12:40:32,563 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:40:32,563 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:32,564 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] [2022-11-16 12:40:32,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:32,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash -984514962, now seen corresponding path program 1 times [2022-11-16 12:40:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:32,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091285324] [2022-11-16 12:40:32,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:32,826 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-16 12:40:32,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:32,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091285324] [2022-11-16 12:40:32,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091285324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:32,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:32,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:40:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166162164] [2022-11-16 12:40:32,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:32,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:40:32,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:32,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:40:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:40:32,889 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 285 [2022-11-16 12:40:32,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 262 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 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-16 12:40:32,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:32,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 285 [2022-11-16 12:40:32,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:33,400 INFO L130 PetriNetUnfolder]: 452/1339 cut-off events. [2022-11-16 12:40:33,401 INFO L131 PetriNetUnfolder]: For 247/410 co-relation queries the response was YES. [2022-11-16 12:40:33,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 1339 events. 452/1339 cut-off events. For 247/410 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8160 event pairs, 311 based on Foata normal form. 6/1038 useless extension candidates. Maximal degree in co-relation 1813. Up to 643 conditions per place. [2022-11-16 12:40:33,423 INFO L137 encePairwiseOnDemand]: 263/285 looper letters, 30 selfloop transitions, 2 changer transitions 4/242 dead transitions. [2022-11-16 12:40:33,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 242 transitions, 566 flow [2022-11-16 12:40:33,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:40:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:40:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2022-11-16 12:40:33,447 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8678362573099415 [2022-11-16 12:40:33,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 742 transitions. [2022-11-16 12:40:33,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 742 transitions. [2022-11-16 12:40:33,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:33,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 742 transitions. [2022-11-16 12:40:33,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:33,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:33,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:33,473 INFO L175 Difference]: Start difference. First operand has 257 places, 262 transitions, 542 flow. Second operand 3 states and 742 transitions. [2022-11-16 12:40:33,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 242 transitions, 566 flow [2022-11-16 12:40:33,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 242 transitions, 554 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-16 12:40:33,493 INFO L231 Difference]: Finished difference. Result has 242 places, 238 transitions, 486 flow [2022-11-16 12:40:33,495 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=242, PETRI_TRANSITIONS=238} [2022-11-16 12:40:33,501 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -15 predicate places. [2022-11-16 12:40:33,501 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 238 transitions, 486 flow [2022-11-16 12:40:33,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 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-16 12:40:33,502 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:33,503 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] [2022-11-16 12:40:33,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:40:33,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1413197212, now seen corresponding path program 1 times [2022-11-16 12:40:33,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:33,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342625058] [2022-11-16 12:40:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:33,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:33,583 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-16 12:40:33,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:33,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342625058] [2022-11-16 12:40:33,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342625058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:33,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:33,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:40:33,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860619006] [2022-11-16 12:40:33,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:33,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:40:33,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:40:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:40:33,589 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 285 [2022-11-16 12:40:33,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 238 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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-16 12:40:33,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:33,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 285 [2022-11-16 12:40:33,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:33,868 INFO L130 PetriNetUnfolder]: 262/950 cut-off events. [2022-11-16 12:40:33,869 INFO L131 PetriNetUnfolder]: For 32/121 co-relation queries the response was YES. [2022-11-16 12:40:33,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 950 events. 262/950 cut-off events. For 32/121 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5198 event pairs, 164 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 1306. Up to 365 conditions per place. [2022-11-16 12:40:33,879 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 21 selfloop transitions, 1 changer transitions 2/232 dead transitions. [2022-11-16 12:40:33,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 232 transitions, 520 flow [2022-11-16 12:40:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:40:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:40:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2022-11-16 12:40:33,882 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8514619883040936 [2022-11-16 12:40:33,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 728 transitions. [2022-11-16 12:40:33,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 728 transitions. [2022-11-16 12:40:33,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:33,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 728 transitions. [2022-11-16 12:40:33,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 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-16 12:40:33,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:33,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:33,889 INFO L175 Difference]: Start difference. First operand has 242 places, 238 transitions, 486 flow. Second operand 3 states and 728 transitions. [2022-11-16 12:40:33,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 232 transitions, 520 flow [2022-11-16 12:40:33,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 232 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:40:33,901 INFO L231 Difference]: Finished difference. Result has 232 places, 230 transitions, 468 flow [2022-11-16 12:40:33,902 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=232, PETRI_TRANSITIONS=230} [2022-11-16 12:40:33,904 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -25 predicate places. [2022-11-16 12:40:33,904 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 230 transitions, 468 flow [2022-11-16 12:40:33,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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-16 12:40:33,905 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:33,906 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] [2022-11-16 12:40:33,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:40:33,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1967607761, now seen corresponding path program 1 times [2022-11-16 12:40:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:33,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336182971] [2022-11-16 12:40:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:33,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:34,058 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-16 12:40:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:34,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336182971] [2022-11-16 12:40:34,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336182971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:34,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:34,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:40:34,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799116537] [2022-11-16 12:40:34,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:34,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:40:34,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:34,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:40:34,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:40:34,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 285 [2022-11-16 12:40:34,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 230 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 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-16 12:40:34,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:34,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 285 [2022-11-16 12:40:34,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:34,263 INFO L130 PetriNetUnfolder]: 133/746 cut-off events. [2022-11-16 12:40:34,264 INFO L131 PetriNetUnfolder]: For 26/30 co-relation queries the response was YES. [2022-11-16 12:40:34,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 746 events. 133/746 cut-off events. For 26/30 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3906 event pairs, 74 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 923. Up to 189 conditions per place. [2022-11-16 12:40:34,272 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 16 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2022-11-16 12:40:34,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 229 transitions, 502 flow [2022-11-16 12:40:34,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:40:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:40:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2022-11-16 12:40:34,276 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8818713450292398 [2022-11-16 12:40:34,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 754 transitions. [2022-11-16 12:40:34,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 754 transitions. [2022-11-16 12:40:34,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:34,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 754 transitions. [2022-11-16 12:40:34,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 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-16 12:40:34,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:34,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:34,282 INFO L175 Difference]: Start difference. First operand has 232 places, 230 transitions, 468 flow. Second operand 3 states and 754 transitions. [2022-11-16 12:40:34,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 229 transitions, 502 flow [2022-11-16 12:40:34,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 229 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:40:34,287 INFO L231 Difference]: Finished difference. Result has 230 places, 229 transitions, 469 flow [2022-11-16 12:40:34,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=230, PETRI_TRANSITIONS=229} [2022-11-16 12:40:34,290 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -27 predicate places. [2022-11-16 12:40:34,290 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 229 transitions, 469 flow [2022-11-16 12:40:34,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 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-16 12:40:34,291 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:34,292 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] [2022-11-16 12:40:34,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:40:34,292 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash 489393469, now seen corresponding path program 1 times [2022-11-16 12:40:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:34,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39199154] [2022-11-16 12:40:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:34,820 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-16 12:40:34,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:34,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39199154] [2022-11-16 12:40:34,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39199154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:34,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:34,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:40:34,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948703879] [2022-11-16 12:40:34,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:34,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:40:34,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:40:34,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:40:34,825 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 285 [2022-11-16 12:40:34,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 229 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 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-16 12:40:34,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:34,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 285 [2022-11-16 12:40:34,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:35,669 INFO L130 PetriNetUnfolder]: 1300/2595 cut-off events. [2022-11-16 12:40:35,670 INFO L131 PetriNetUnfolder]: For 9/60 co-relation queries the response was YES. [2022-11-16 12:40:35,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4507 conditions, 2595 events. 1300/2595 cut-off events. For 9/60 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16683 event pairs, 1040 based on Foata normal form. 0/2224 useless extension candidates. Maximal degree in co-relation 4474. Up to 1868 conditions per place. [2022-11-16 12:40:35,699 INFO L137 encePairwiseOnDemand]: 273/285 looper letters, 56 selfloop transitions, 10 changer transitions 0/227 dead transitions. [2022-11-16 12:40:35,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 597 flow [2022-11-16 12:40:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:40:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:40:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1244 transitions. [2022-11-16 12:40:35,705 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7274853801169591 [2022-11-16 12:40:35,708 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1244 transitions. [2022-11-16 12:40:35,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1244 transitions. [2022-11-16 12:40:35,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:35,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1244 transitions. [2022-11-16 12:40:35,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 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-16 12:40:35,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 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-16 12:40:35,719 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 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-16 12:40:35,720 INFO L175 Difference]: Start difference. First operand has 230 places, 229 transitions, 469 flow. Second operand 6 states and 1244 transitions. [2022-11-16 12:40:35,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 597 flow [2022-11-16 12:40:35,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 227 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:40:35,730 INFO L231 Difference]: Finished difference. Result has 231 places, 227 transitions, 481 flow [2022-11-16 12:40:35,731 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=231, PETRI_TRANSITIONS=227} [2022-11-16 12:40:35,732 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -26 predicate places. [2022-11-16 12:40:35,733 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 227 transitions, 481 flow [2022-11-16 12:40:35,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 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-16 12:40:35,734 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:35,734 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] [2022-11-16 12:40:35,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:40:35,735 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:35,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:35,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1595837238, now seen corresponding path program 1 times [2022-11-16 12:40:35,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:35,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525609954] [2022-11-16 12:40:35,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:35,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:35,838 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-16 12:40:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:35,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525609954] [2022-11-16 12:40:35,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525609954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:35,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:35,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:40:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023985074] [2022-11-16 12:40:35,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:35,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:40:35,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:35,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:40:35,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:40:35,845 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 285 [2022-11-16 12:40:35,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 227 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 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-16 12:40:35,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:35,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 285 [2022-11-16 12:40:35,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:35,964 INFO L130 PetriNetUnfolder]: 44/356 cut-off events. [2022-11-16 12:40:35,965 INFO L131 PetriNetUnfolder]: For 17/21 co-relation queries the response was YES. [2022-11-16 12:40:35,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 356 events. 44/356 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 985 event pairs, 20 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 407. Up to 64 conditions per place. [2022-11-16 12:40:35,968 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 13 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2022-11-16 12:40:35,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 226 transitions, 509 flow [2022-11-16 12:40:35,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:40:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:40:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2022-11-16 12:40:35,971 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-11-16 12:40:35,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2022-11-16 12:40:35,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2022-11-16 12:40:35,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:35,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2022-11-16 12:40:35,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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-16 12:40:35,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:35,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:35,977 INFO L175 Difference]: Start difference. First operand has 231 places, 227 transitions, 481 flow. Second operand 3 states and 760 transitions. [2022-11-16 12:40:35,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 226 transitions, 509 flow [2022-11-16 12:40:35,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 226 transitions, 489 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 12:40:35,983 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 463 flow [2022-11-16 12:40:35,984 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2022-11-16 12:40:35,984 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -30 predicate places. [2022-11-16 12:40:35,985 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 463 flow [2022-11-16 12:40:35,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 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-16 12:40:35,986 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:35,986 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] [2022-11-16 12:40:35,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:40:35,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1734322598, now seen corresponding path program 1 times [2022-11-16 12:40:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:35,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884200647] [2022-11-16 12:40:35,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:35,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:36,065 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-16 12:40:36,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:36,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884200647] [2022-11-16 12:40:36,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884200647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:36,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:36,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:40:36,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220335366] [2022-11-16 12:40:36,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:36,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:40:36,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:36,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:40:36,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:40:36,069 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 285 [2022-11-16 12:40:36,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:36,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:36,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 285 [2022-11-16 12:40:36,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:36,261 INFO L130 PetriNetUnfolder]: 173/855 cut-off events. [2022-11-16 12:40:36,261 INFO L131 PetriNetUnfolder]: For 26/32 co-relation queries the response was YES. [2022-11-16 12:40:36,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 855 events. 173/855 cut-off events. For 26/32 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4818 event pairs, 74 based on Foata normal form. 2/759 useless extension candidates. Maximal degree in co-relation 1108. Up to 175 conditions per place. [2022-11-16 12:40:36,268 INFO L137 encePairwiseOnDemand]: 280/285 looper letters, 19 selfloop transitions, 2 changer transitions 2/230 dead transitions. [2022-11-16 12:40:36,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 230 transitions, 517 flow [2022-11-16 12:40:36,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:40:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:40:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2022-11-16 12:40:36,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.887719298245614 [2022-11-16 12:40:36,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 759 transitions. [2022-11-16 12:40:36,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 759 transitions. [2022-11-16 12:40:36,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:36,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 759 transitions. [2022-11-16 12:40:36,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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-16 12:40:36,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:36,276 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:36,276 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 463 flow. Second operand 3 states and 759 transitions. [2022-11-16 12:40:36,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 230 transitions, 517 flow [2022-11-16 12:40:36,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 230 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:40:36,281 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 455 flow [2022-11-16 12:40:36,281 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2022-11-16 12:40:36,282 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -32 predicate places. [2022-11-16 12:40:36,282 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 455 flow [2022-11-16 12:40:36,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:36,283 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:36,283 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] [2022-11-16 12:40:36,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:40:36,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash -236681188, now seen corresponding path program 1 times [2022-11-16 12:40:36,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:36,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530917527] [2022-11-16 12:40:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:36,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:36,335 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-16 12:40:36,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:36,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530917527] [2022-11-16 12:40:36,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530917527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:36,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:36,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:40:36,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598513173] [2022-11-16 12:40:36,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:36,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:40:36,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:36,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:40:36,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:40:36,339 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 285 [2022-11-16 12:40:36,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 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-16 12:40:36,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:36,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 285 [2022-11-16 12:40:36,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:36,522 INFO L130 PetriNetUnfolder]: 113/713 cut-off events. [2022-11-16 12:40:36,522 INFO L131 PetriNetUnfolder]: For 31/37 co-relation queries the response was YES. [2022-11-16 12:40:36,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 713 events. 113/713 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3489 event pairs, 12 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 878. Up to 147 conditions per place. [2022-11-16 12:40:36,527 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 21 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-11-16 12:40:36,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 230 transitions, 522 flow [2022-11-16 12:40:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:40:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:40:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2022-11-16 12:40:36,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8982456140350877 [2022-11-16 12:40:36,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 768 transitions. [2022-11-16 12:40:36,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 768 transitions. [2022-11-16 12:40:36,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:36,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 768 transitions. [2022-11-16 12:40:36,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 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-16 12:40:36,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:36,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:36,535 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 455 flow. Second operand 3 states and 768 transitions. [2022-11-16 12:40:36,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 230 transitions, 522 flow [2022-11-16 12:40:36,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 230 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:40:36,540 INFO L231 Difference]: Finished difference. Result has 223 places, 223 transitions, 463 flow [2022-11-16 12:40:36,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=223, PETRI_TRANSITIONS=223} [2022-11-16 12:40:36,541 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -34 predicate places. [2022-11-16 12:40:36,541 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 223 transitions, 463 flow [2022-11-16 12:40:36,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 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-16 12:40:36,542 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:36,542 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] [2022-11-16 12:40:36,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:40:36,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:36,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1655060736, now seen corresponding path program 1 times [2022-11-16 12:40:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:36,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389690184] [2022-11-16 12:40:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:36,712 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-16 12:40:36,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:36,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389690184] [2022-11-16 12:40:36,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389690184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:36,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:36,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:40:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889940437] [2022-11-16 12:40:36,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:36,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:40:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:36,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:40:36,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:40:36,717 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 285 [2022-11-16 12:40:36,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 223 transitions, 463 flow. Second operand has 7 states, 7 states have (on average 202.85714285714286) internal successors, (1420), 7 states have internal predecessors, (1420), 0 states have call successors, (0), 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-16 12:40:36,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:36,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 285 [2022-11-16 12:40:36,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:38,156 INFO L130 PetriNetUnfolder]: 1939/5317 cut-off events. [2022-11-16 12:40:38,156 INFO L131 PetriNetUnfolder]: For 280/386 co-relation queries the response was YES. [2022-11-16 12:40:38,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8549 conditions, 5317 events. 1939/5317 cut-off events. For 280/386 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 43605 event pairs, 1024 based on Foata normal form. 1/4346 useless extension candidates. Maximal degree in co-relation 8514. Up to 1732 conditions per place. [2022-11-16 12:40:38,197 INFO L137 encePairwiseOnDemand]: 271/285 looper letters, 148 selfloop transitions, 18 changer transitions 0/326 dead transitions. [2022-11-16 12:40:38,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 326 transitions, 1037 flow [2022-11-16 12:40:38,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:40:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 12:40:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2352 transitions. [2022-11-16 12:40:38,204 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7502392344497608 [2022-11-16 12:40:38,204 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2352 transitions. [2022-11-16 12:40:38,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2352 transitions. [2022-11-16 12:40:38,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:38,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2352 transitions. [2022-11-16 12:40:38,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 213.8181818181818) internal successors, (2352), 11 states have internal predecessors, (2352), 0 states have call successors, (0), 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-16 12:40:38,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 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-16 12:40:38,218 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 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-16 12:40:38,219 INFO L175 Difference]: Start difference. First operand has 223 places, 223 transitions, 463 flow. Second operand 11 states and 2352 transitions. [2022-11-16 12:40:38,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 326 transitions, 1037 flow [2022-11-16 12:40:38,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 326 transitions, 1037 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:40:38,229 INFO L231 Difference]: Finished difference. Result has 237 places, 233 transitions, 549 flow [2022-11-16 12:40:38,229 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=549, PETRI_PLACES=237, PETRI_TRANSITIONS=233} [2022-11-16 12:40:38,233 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -20 predicate places. [2022-11-16 12:40:38,233 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 233 transitions, 549 flow [2022-11-16 12:40:38,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 202.85714285714286) internal successors, (1420), 7 states have internal predecessors, (1420), 0 states have call successors, (0), 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-16 12:40:38,234 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:38,234 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] [2022-11-16 12:40:38,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:40:38,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:38,235 INFO L85 PathProgramCache]: Analyzing trace with hash -888091490, now seen corresponding path program 1 times [2022-11-16 12:40:38,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:38,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481997876] [2022-11-16 12:40:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:38,808 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-16 12:40:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481997876] [2022-11-16 12:40:38,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481997876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:38,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:38,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:40:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094396739] [2022-11-16 12:40:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:38,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:40:38,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:38,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:40:38,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:40:38,812 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-11-16 12:40:38,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 233 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 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-16 12:40:38,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:38,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-11-16 12:40:38,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:40,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 86#L98-6true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,588 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-16 12:40:40,588 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-16 12:40:40,588 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-16 12:40:40,588 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-16 12:40:40,730 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 66#L97-4true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,730 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-16 12:40:40,731 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-16 12:40:40,731 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-16 12:40:40,731 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-16 12:40:40,786 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, 182#L98-5true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,786 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-11-16 12:40:40,787 INFO L386 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-11-16 12:40:40,787 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-16 12:40:40,787 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-16 12:40:40,788 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 86#L98-6true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,788 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-16 12:40:40,788 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-16 12:40:40,788 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-16 12:40:40,789 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-16 12:40:40,789 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 207#L98-4true, 340#true]) [2022-11-16 12:40:40,790 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-16 12:40:40,790 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 12:40:40,790 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-16 12:40:40,790 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 12:40:40,791 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 145#L98-1true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,791 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-16 12:40:40,791 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-16 12:40:40,792 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-16 12:40:40,792 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-16 12:40:40,792 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), 94#L98-3true, Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,793 INFO L383 tUnfolder$Statistics]: this new event has 180 ancestors and is cut-off event [2022-11-16 12:40:40,793 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-16 12:40:40,793 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-16 12:40:40,793 INFO L386 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-11-16 12:40:40,794 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), Black: 326#(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|)), 211#L98-2true, 57#L61true, 265#L51-3true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,794 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-11-16 12:40:40,795 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-16 12:40:40,795 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-16 12:40:40,795 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-16 12:40:40,815 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, 57#L61true, 182#L98-5true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,815 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-16 12:40:40,816 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-16 12:40:40,816 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-16 12:40:40,816 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 12:40:40,817 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 86#L98-6true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, 57#L61true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,817 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-11-16 12:40:40,817 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-16 12:40:40,817 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-16 12:40:40,818 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-16 12:40:40,818 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-16 12:40:40,819 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 207#L98-4true, 340#true]) [2022-11-16 12:40:40,819 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-16 12:40:40,819 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-16 12:40:40,819 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-16 12:40:40,819 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-16 12:40:40,820 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 145#L98-1true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,820 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-16 12:40:40,821 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-16 12:40:40,821 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-16 12:40:40,821 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-16 12:40:40,822 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), 94#L98-3true, Black: 326#(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|)), 265#L51-3true, 57#L61true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,822 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-16 12:40:40,822 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 12:40:40,822 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-16 12:40:40,823 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-16 12:40:40,823 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, 57#L61true, 211#L98-2true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,824 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-11-16 12:40:40,824 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-16 12:40:40,824 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-16 12:40:40,824 INFO L386 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-11-16 12:40:40,849 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 86#L98-6true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, 57#L61true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,849 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-16 12:40:40,849 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-16 12:40:40,849 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-16 12:40:40,850 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-16 12:40:40,850 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, 182#L98-5true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,851 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-16 12:40:40,851 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-16 12:40:40,851 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-16 12:40:40,851 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-16 12:40:40,852 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 207#L98-4true, 340#true]) [2022-11-16 12:40:40,852 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-16 12:40:40,853 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-16 12:40:40,853 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-16 12:40:40,853 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-16 12:40:40,854 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 145#L98-1true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,854 INFO L383 tUnfolder$Statistics]: this new event has 180 ancestors and is cut-off event [2022-11-16 12:40:40,854 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-16 12:40:40,854 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-16 12:40:40,855 INFO L386 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-11-16 12:40:40,855 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), 94#L98-3true, Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,856 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-11-16 12:40:40,856 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-16 12:40:40,856 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-16 12:40:40,856 INFO L386 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-11-16 12:40:40,857 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 211#L98-2true, 57#L61true, 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,857 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-16 12:40:40,857 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 12:40:40,858 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-16 12:40:40,858 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 12:40:40,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 66#L97-4true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, 57#L61true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), 271#L75true, Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,875 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-16 12:40:40,875 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-16 12:40:40,875 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-16 12:40:40,876 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 12:40:40,912 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 66#L97-4true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 57#L61true, 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 340#true]) [2022-11-16 12:40:40,912 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-16 12:40:40,913 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 12:40:40,913 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-16 12:40:40,913 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-16 12:40:40,994 INFO L130 PetriNetUnfolder]: 3007/7208 cut-off events. [2022-11-16 12:40:40,994 INFO L131 PetriNetUnfolder]: For 994/1039 co-relation queries the response was YES. [2022-11-16 12:40:41,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12995 conditions, 7208 events. 3007/7208 cut-off events. For 994/1039 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 59375 event pairs, 899 based on Foata normal form. 36/6530 useless extension candidates. Maximal degree in co-relation 12953. Up to 2638 conditions per place. [2022-11-16 12:40:41,081 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 99 selfloop transitions, 13 changer transitions 0/296 dead transitions. [2022-11-16 12:40:41,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 296 transitions, 922 flow [2022-11-16 12:40:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:40:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:40:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1380 transitions. [2022-11-16 12:40:41,086 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8070175438596491 [2022-11-16 12:40:41,086 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1380 transitions. [2022-11-16 12:40:41,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1380 transitions. [2022-11-16 12:40:41,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:41,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1380 transitions. [2022-11-16 12:40:41,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 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-16 12:40:41,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 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-16 12:40:41,097 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 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-16 12:40:41,097 INFO L175 Difference]: Start difference. First operand has 237 places, 233 transitions, 549 flow. Second operand 6 states and 1380 transitions. [2022-11-16 12:40:41,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 296 transitions, 922 flow [2022-11-16 12:40:41,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 296 transitions, 917 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:40:41,110 INFO L231 Difference]: Finished difference. Result has 245 places, 245 transitions, 654 flow [2022-11-16 12:40:41,110 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=654, PETRI_PLACES=245, PETRI_TRANSITIONS=245} [2022-11-16 12:40:41,111 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -12 predicate places. [2022-11-16 12:40:41,112 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 245 transitions, 654 flow [2022-11-16 12:40:41,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 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-16 12:40:41,113 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:41,113 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] [2022-11-16 12:40:41,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:40:41,113 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1593248629, now seen corresponding path program 1 times [2022-11-16 12:40:41,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:41,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939301237] [2022-11-16 12:40:41,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:41,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:41,438 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-16 12:40:41,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:41,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939301237] [2022-11-16 12:40:41,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939301237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:41,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:41,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:40:41,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823761051] [2022-11-16 12:40:41,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:41,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:40:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:41,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:40:41,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:40:41,442 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 285 [2022-11-16 12:40:41,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 245 transitions, 654 flow. Second operand has 7 states, 7 states have (on average 209.42857142857142) internal successors, (1466), 7 states have internal predecessors, (1466), 0 states have call successors, (0), 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-16 12:40:41,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:41,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 285 [2022-11-16 12:40:41,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:43,015 INFO L130 PetriNetUnfolder]: 2622/5781 cut-off events. [2022-11-16 12:40:43,016 INFO L131 PetriNetUnfolder]: For 3467/4069 co-relation queries the response was YES. [2022-11-16 12:40:43,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11676 conditions, 5781 events. 2622/5781 cut-off events. For 3467/4069 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 44493 event pairs, 1283 based on Foata normal form. 40/4693 useless extension candidates. Maximal degree in co-relation 11632. Up to 3250 conditions per place. [2022-11-16 12:40:43,070 INFO L137 encePairwiseOnDemand]: 271/285 looper letters, 133 selfloop transitions, 18 changer transitions 0/324 dead transitions. [2022-11-16 12:40:43,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 324 transitions, 1138 flow [2022-11-16 12:40:43,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:40:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 12:40:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2410 transitions. [2022-11-16 12:40:43,076 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7687400318979266 [2022-11-16 12:40:43,076 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2410 transitions. [2022-11-16 12:40:43,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2410 transitions. [2022-11-16 12:40:43,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:43,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2410 transitions. [2022-11-16 12:40:43,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 219.0909090909091) internal successors, (2410), 11 states have internal predecessors, (2410), 0 states have call successors, (0), 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-16 12:40:43,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 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-16 12:40:43,092 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 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-16 12:40:43,092 INFO L175 Difference]: Start difference. First operand has 245 places, 245 transitions, 654 flow. Second operand 11 states and 2410 transitions. [2022-11-16 12:40:43,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 324 transitions, 1138 flow [2022-11-16 12:40:43,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 324 transitions, 1138 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:40:43,103 INFO L231 Difference]: Finished difference. Result has 257 places, 247 transitions, 702 flow [2022-11-16 12:40:43,104 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=702, PETRI_PLACES=257, PETRI_TRANSITIONS=247} [2022-11-16 12:40:43,105 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 0 predicate places. [2022-11-16 12:40:43,106 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 247 transitions, 702 flow [2022-11-16 12:40:43,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 209.42857142857142) internal successors, (1466), 7 states have internal predecessors, (1466), 0 states have call successors, (0), 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-16 12:40:43,115 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:43,115 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] [2022-11-16 12:40:43,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:40:43,116 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:43,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash 783794879, now seen corresponding path program 1 times [2022-11-16 12:40:43,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:43,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726814938] [2022-11-16 12:40:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:43,628 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-16 12:40:43,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:43,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726814938] [2022-11-16 12:40:43,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726814938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:43,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:43,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:40:43,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212996886] [2022-11-16 12:40:43,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:43,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:40:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:43,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:40:43,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:40:43,634 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-11-16 12:40:43,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 247 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:43,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:43,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-11-16 12:40:43,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:45,934 INFO L130 PetriNetUnfolder]: 2201/6871 cut-off events. [2022-11-16 12:40:45,935 INFO L131 PetriNetUnfolder]: For 3758/3788 co-relation queries the response was YES. [2022-11-16 12:40:45,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13361 conditions, 6871 events. 2201/6871 cut-off events. For 3758/3788 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 66720 event pairs, 1289 based on Foata normal form. 24/6560 useless extension candidates. Maximal degree in co-relation 13312. Up to 2846 conditions per place. [2022-11-16 12:40:46,024 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 80 selfloop transitions, 17 changer transitions 0/283 dead transitions. [2022-11-16 12:40:46,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 283 transitions, 1038 flow [2022-11-16 12:40:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:40:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:40:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1349 transitions. [2022-11-16 12:40:46,031 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2022-11-16 12:40:46,032 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1349 transitions. [2022-11-16 12:40:46,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1349 transitions. [2022-11-16 12:40:46,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:46,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1349 transitions. [2022-11-16 12:40:46,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 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-16 12:40:46,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 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-16 12:40:46,044 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 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-16 12:40:46,045 INFO L175 Difference]: Start difference. First operand has 257 places, 247 transitions, 702 flow. Second operand 6 states and 1349 transitions. [2022-11-16 12:40:46,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 283 transitions, 1038 flow [2022-11-16 12:40:46,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 283 transitions, 1021 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 12:40:46,096 INFO L231 Difference]: Finished difference. Result has 262 places, 263 transitions, 869 flow [2022-11-16 12:40:46,097 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=262, PETRI_TRANSITIONS=263} [2022-11-16 12:40:46,098 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 5 predicate places. [2022-11-16 12:40:46,098 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 263 transitions, 869 flow [2022-11-16 12:40:46,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:46,099 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:46,100 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] [2022-11-16 12:40:46,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:40:46,100 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:46,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1385488953, now seen corresponding path program 1 times [2022-11-16 12:40:46,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:46,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740231157] [2022-11-16 12:40:46,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:46,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:40:46,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:46,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740231157] [2022-11-16 12:40:46,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740231157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:46,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:46,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:40:46,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799248777] [2022-11-16 12:40:46,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:46,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:40:46,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:46,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:40:46,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:40:46,875 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 285 [2022-11-16 12:40:46,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 263 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 0 states have call successors, (0), 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-16 12:40:46,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:46,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 285 [2022-11-16 12:40:46,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:50,462 INFO L130 PetriNetUnfolder]: 4882/12923 cut-off events. [2022-11-16 12:40:50,463 INFO L131 PetriNetUnfolder]: For 11447/11447 co-relation queries the response was YES. [2022-11-16 12:40:50,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28061 conditions, 12923 events. 4882/12923 cut-off events. For 11447/11447 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 131777 event pairs, 1972 based on Foata normal form. 0/12545 useless extension candidates. Maximal degree in co-relation 28011. Up to 5365 conditions per place. [2022-11-16 12:40:50,591 INFO L137 encePairwiseOnDemand]: 277/285 looper letters, 143 selfloop transitions, 26 changer transitions 0/349 dead transitions. [2022-11-16 12:40:50,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 349 transitions, 1635 flow [2022-11-16 12:40:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:40:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:40:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1367 transitions. [2022-11-16 12:40:50,596 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7994152046783626 [2022-11-16 12:40:50,596 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1367 transitions. [2022-11-16 12:40:50,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1367 transitions. [2022-11-16 12:40:50,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:50,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1367 transitions. [2022-11-16 12:40:50,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 227.83333333333334) internal successors, (1367), 6 states have internal predecessors, (1367), 0 states have call successors, (0), 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-16 12:40:50,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 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-16 12:40:50,606 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 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-16 12:40:50,606 INFO L175 Difference]: Start difference. First operand has 262 places, 263 transitions, 869 flow. Second operand 6 states and 1367 transitions. [2022-11-16 12:40:50,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 349 transitions, 1635 flow [2022-11-16 12:40:50,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 349 transitions, 1635 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:40:50,726 INFO L231 Difference]: Finished difference. Result has 272 places, 288 transitions, 1173 flow [2022-11-16 12:40:50,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1173, PETRI_PLACES=272, PETRI_TRANSITIONS=288} [2022-11-16 12:40:50,728 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 15 predicate places. [2022-11-16 12:40:50,728 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 288 transitions, 1173 flow [2022-11-16 12:40:50,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 0 states have call successors, (0), 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-16 12:40:50,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:50,729 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] [2022-11-16 12:40:50,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:40:50,730 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:50,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1575322812, now seen corresponding path program 1 times [2022-11-16 12:40:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:50,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786134514] [2022-11-16 12:40:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:40:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:50,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786134514] [2022-11-16 12:40:50,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786134514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:50,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:50,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:40:50,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850650419] [2022-11-16 12:40:50,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:50,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:40:50,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:50,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:40:50,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:40:50,821 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 285 [2022-11-16 12:40:50,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 288 transitions, 1173 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:50,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:50,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 285 [2022-11-16 12:40:50,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:52,612 INFO L130 PetriNetUnfolder]: 2145/6631 cut-off events. [2022-11-16 12:40:52,612 INFO L131 PetriNetUnfolder]: For 17835/18181 co-relation queries the response was YES. [2022-11-16 12:40:52,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16542 conditions, 6631 events. 2145/6631 cut-off events. For 17835/18181 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 64027 event pairs, 664 based on Foata normal form. 0/6368 useless extension candidates. Maximal degree in co-relation 16488. Up to 2137 conditions per place. [2022-11-16 12:40:52,799 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 70 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-11-16 12:40:52,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 302 transitions, 1441 flow [2022-11-16 12:40:52,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:40:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:40:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2022-11-16 12:40:52,806 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.87953216374269 [2022-11-16 12:40:52,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2022-11-16 12:40:52,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2022-11-16 12:40:52,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:52,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2022-11-16 12:40:52,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 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-16 12:40:52,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:52,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 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-16 12:40:52,821 INFO L175 Difference]: Start difference. First operand has 272 places, 288 transitions, 1173 flow. Second operand 3 states and 752 transitions. [2022-11-16 12:40:52,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 302 transitions, 1441 flow [2022-11-16 12:40:52,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 302 transitions, 1371 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-11-16 12:40:52,892 INFO L231 Difference]: Finished difference. Result has 273 places, 287 transitions, 1119 flow [2022-11-16 12:40:52,893 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1119, PETRI_PLACES=273, PETRI_TRANSITIONS=287} [2022-11-16 12:40:52,895 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 16 predicate places. [2022-11-16 12:40:52,895 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 287 transitions, 1119 flow [2022-11-16 12:40:52,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:40:52,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:52,896 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] [2022-11-16 12:40:52,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:40:52,896 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:52,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:52,897 INFO L85 PathProgramCache]: Analyzing trace with hash 810540329, now seen corresponding path program 1 times [2022-11-16 12:40:52,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:52,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868366143] [2022-11-16 12:40:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:53,495 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-16 12:40:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:53,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868366143] [2022-11-16 12:40:53,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868366143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:53,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:53,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:40:53,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639628207] [2022-11-16 12:40:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:53,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:40:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:40:53,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:40:53,500 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-11-16 12:40:53,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 287 transitions, 1119 flow. Second operand has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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-16 12:40:53,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:53,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-11-16 12:40:53,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:40:56,227 INFO L130 PetriNetUnfolder]: 3208/9688 cut-off events. [2022-11-16 12:40:56,227 INFO L131 PetriNetUnfolder]: For 11422/12194 co-relation queries the response was YES. [2022-11-16 12:40:56,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22046 conditions, 9688 events. 3208/9688 cut-off events. For 11422/12194 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 101172 event pairs, 1752 based on Foata normal form. 0/9526 useless extension candidates. Maximal degree in co-relation 21989. Up to 4485 conditions per place. [2022-11-16 12:40:56,325 INFO L137 encePairwiseOnDemand]: 280/285 looper letters, 104 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2022-11-16 12:40:56,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 294 transitions, 1349 flow [2022-11-16 12:40:56,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:40:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:40:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1328 transitions. [2022-11-16 12:40:56,329 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.776608187134503 [2022-11-16 12:40:56,330 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1328 transitions. [2022-11-16 12:40:56,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1328 transitions. [2022-11-16 12:40:56,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:40:56,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1328 transitions. [2022-11-16 12:40:56,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 221.33333333333334) internal successors, (1328), 6 states have internal predecessors, (1328), 0 states have call successors, (0), 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-16 12:40:56,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 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-16 12:40:56,341 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 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-16 12:40:56,341 INFO L175 Difference]: Start difference. First operand has 273 places, 287 transitions, 1119 flow. Second operand 6 states and 1328 transitions. [2022-11-16 12:40:56,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 294 transitions, 1349 flow [2022-11-16 12:40:56,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 294 transitions, 1345 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:40:56,400 INFO L231 Difference]: Finished difference. Result has 275 places, 286 transitions, 1121 flow [2022-11-16 12:40:56,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1121, PETRI_PLACES=275, PETRI_TRANSITIONS=286} [2022-11-16 12:40:56,402 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 18 predicate places. [2022-11-16 12:40:56,402 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 286 transitions, 1121 flow [2022-11-16 12:40:56,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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-16 12:40:56,403 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:40:56,404 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] [2022-11-16 12:40:56,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:40:56,404 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:40:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:40:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash -897111884, now seen corresponding path program 1 times [2022-11-16 12:40:56,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:40:56,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270489590] [2022-11-16 12:40:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:40:56,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:40:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:40:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:40:57,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:40:57,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270489590] [2022-11-16 12:40:57,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270489590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:40:57,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:40:57,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 12:40:57,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389079952] [2022-11-16 12:40:57,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:40:57,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:40:57,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:40:57,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:40:57,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:40:57,968 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 285 [2022-11-16 12:40:57,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 286 transitions, 1121 flow. Second operand has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 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-16 12:40:57,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:40:57,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 285 [2022-11-16 12:40:57,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:41:15,529 INFO L130 PetriNetUnfolder]: 40337/70492 cut-off events. [2022-11-16 12:41:15,529 INFO L131 PetriNetUnfolder]: For 59806/59845 co-relation queries the response was YES. [2022-11-16 12:41:15,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180425 conditions, 70492 events. 40337/70492 cut-off events. For 59806/59845 co-relation queries the response was YES. Maximal size of possible extension queue 2339. Compared 669566 event pairs, 11295 based on Foata normal form. 333/69584 useless extension candidates. Maximal degree in co-relation 180361. Up to 15605 conditions per place. [2022-11-16 12:41:16,683 INFO L137 encePairwiseOnDemand]: 262/285 looper letters, 393 selfloop transitions, 70 changer transitions 0/607 dead transitions. [2022-11-16 12:41:16,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 607 transitions, 4099 flow [2022-11-16 12:41:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:41:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-16 12:41:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4272 transitions. [2022-11-16 12:41:16,695 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6517162471395881 [2022-11-16 12:41:16,695 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4272 transitions. [2022-11-16 12:41:16,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4272 transitions. [2022-11-16 12:41:16,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:41:16,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4272 transitions. [2022-11-16 12:41:16,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 185.7391304347826) internal successors, (4272), 23 states have internal predecessors, (4272), 0 states have call successors, (0), 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-16 12:41:16,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 285.0) internal successors, (6840), 24 states have internal predecessors, (6840), 0 states have call successors, (0), 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-16 12:41:16,728 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 285.0) internal successors, (6840), 24 states have internal predecessors, (6840), 0 states have call successors, (0), 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-16 12:41:16,728 INFO L175 Difference]: Start difference. First operand has 275 places, 286 transitions, 1121 flow. Second operand 23 states and 4272 transitions. [2022-11-16 12:41:16,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 607 transitions, 4099 flow [2022-11-16 12:41:17,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 607 transitions, 4071 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:41:17,568 INFO L231 Difference]: Finished difference. Result has 298 places, 335 transitions, 1856 flow [2022-11-16 12:41:17,569 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1856, PETRI_PLACES=298, PETRI_TRANSITIONS=335} [2022-11-16 12:41:17,569 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 41 predicate places. [2022-11-16 12:41:17,570 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 335 transitions, 1856 flow [2022-11-16 12:41:17,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 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-16 12:41:17,571 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:41:17,571 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] [2022-11-16 12:41:17,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:41:17,572 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-16 12:41:17,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:41:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1849444076, now seen corresponding path program 2 times [2022-11-16 12:41:17,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:41:17,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652809084] [2022-11-16 12:41:17,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:41:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:41:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:41:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:41:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:41:19,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652809084] [2022-11-16 12:41:19,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652809084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:41:19,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:41:19,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 12:41:19,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837565264] [2022-11-16 12:41:19,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:41:19,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:41:19,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:41:19,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:41:19,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:41:19,111 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 285 [2022-11-16 12:41:19,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 335 transitions, 1856 flow. Second operand has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 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-16 12:41:19,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:41:19,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 285 [2022-11-16 12:41:19,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand