./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 908fbcc4d3742ed9abcae99df082df11caf0d6bd4e74389f515555cf6e492354 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:49:12,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:49:12,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:49:13,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:49:13,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:49:13,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:49:13,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:49:13,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:49:13,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:49:13,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:49:13,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:49:13,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:49:13,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:49:13,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:49:13,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:49:13,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:49:13,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:49:13,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:49:13,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:49:13,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:49:13,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:49:13,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:49:13,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:49:13,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:49:13,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:49:13,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:49:13,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:49:13,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:49:13,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:49:13,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:49:13,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:49:13,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:49:13,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:49:13,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:49:13,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:49:13,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:49:13,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:49:13,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:49:13,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:49:13,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:49:13,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:49:13,102 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 10:49:13,144 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:49:13,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:49:13,146 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:49:13,146 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:49:13,147 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:49:13,147 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:49:13,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:49:13,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:49:13,149 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:49:13,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:49:13,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:49:13,151 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:49:13,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:49:13,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:49:13,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:49:13,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:49:13,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:49:13,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:49:13,153 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 10:49:13,154 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:49:13,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:49:13,154 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:49:13,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:49:13,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:49:13,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:49:13,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:49:13,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:49:13,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:49:13,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:49:13,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:49:13,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:49:13,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:49:13,159 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:49:13,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:49:13,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:49:13,160 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_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 908fbcc4d3742ed9abcae99df082df11caf0d6bd4e74389f515555cf6e492354 [2022-11-20 10:49:13,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:49:13,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:49:13,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:49:13,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:49:13,466 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:49:13,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2022-11-20 10:49:16,585 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:49:16,860 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:49:16,860 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2022-11-20 10:49:16,868 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/data/748c7e10a/404249d32b234b9aa25fa6e299b68b1f/FLAG072664869 [2022-11-20 10:49:16,888 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/data/748c7e10a/404249d32b234b9aa25fa6e299b68b1f [2022-11-20 10:49:16,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:49:16,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:49:16,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:49:16,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:49:16,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:49:16,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:49:16" (1/1) ... [2022-11-20 10:49:16,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617713e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:16, skipping insertion in model container [2022-11-20 10:49:16,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:49:16" (1/1) ... [2022-11-20 10:49:16,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:49:16,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:49:17,132 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c[3856,3869] [2022-11-20 10:49:17,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:49:17,152 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:49:17,190 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c[3856,3869] [2022-11-20 10:49:17,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:49:17,233 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:49:17,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17 WrapperNode [2022-11-20 10:49:17,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:49:17,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:49:17,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:49:17,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:49:17,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,315 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 593 [2022-11-20 10:49:17,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:49:17,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:49:17,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:49:17,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:49:17,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,354 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:49:17,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:49:17,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:49:17,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:49:17,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (1/1) ... [2022-11-20 10:49:17,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:49:17,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:17,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:49:17,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:49:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:49:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:49:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:49:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:49:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 10:49:17,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 10:49:17,479 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 10:49:17,479 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 10:49:17,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:49:17,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:49:17,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:49:17,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:49:17,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:49:17,482 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:49:17,650 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:49:17,652 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:49:18,616 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:49:18,704 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:49:18,704 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 10:49:18,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:49:18 BoogieIcfgContainer [2022-11-20 10:49:18,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:49:18,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:49:18,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:49:18,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:49:18,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:49:16" (1/3) ... [2022-11-20 10:49:18,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca2b7f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:49:18, skipping insertion in model container [2022-11-20 10:49:18,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:49:17" (2/3) ... [2022-11-20 10:49:18,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca2b7f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:49:18, skipping insertion in model container [2022-11-20 10:49:18,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:49:18" (3/3) ... [2022-11-20 10:49:18,739 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2022-11-20 10:49:18,760 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:49:18,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:49:18,787 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2022-11-20 10:49:18,787 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:49:19,012 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 10:49:19,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 743 places, 777 transitions, 1570 flow [2022-11-20 10:49:19,610 INFO L130 PetriNetUnfolder]: 41/775 cut-off events. [2022-11-20 10:49:19,611 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 10:49:19,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 775 events. 41/775 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2070 event pairs, 0 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 567. Up to 2 conditions per place. [2022-11-20 10:49:19,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 743 places, 777 transitions, 1570 flow [2022-11-20 10:49:19,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 720 places, 752 transitions, 1516 flow [2022-11-20 10:49:19,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:49:19,669 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;@64d0b5c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:49:19,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 192 error locations. [2022-11-20 10:49:19,673 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-11-20 10:49:19,674 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:49:19,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:19,675 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] [2022-11-20 10:49:19,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1787891610, now seen corresponding path program 1 times [2022-11-20 10:49:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:19,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079045535] [2022-11-20 10:49:19,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:19,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:19,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079045535] [2022-11-20 10:49:19,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079045535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:19,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:19,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865111657] [2022-11-20 10:49:19,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:19,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:19,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:19,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:19,981 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 777 [2022-11-20 10:49:19,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 752 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:19,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:19,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 777 [2022-11-20 10:49:19,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:22,129 INFO L130 PetriNetUnfolder]: 616/7316 cut-off events. [2022-11-20 10:49:22,129 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-11-20 10:49:22,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7989 conditions, 7316 events. 616/7316 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 62295 event pairs, 255 based on Foata normal form. 172/5837 useless extension candidates. Maximal degree in co-relation 7420. Up to 604 conditions per place. [2022-11-20 10:49:22,235 INFO L137 encePairwiseOnDemand]: 761/777 looper letters, 37 selfloop transitions, 2 changer transitions 2/738 dead transitions. [2022-11-20 10:49:22,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 738 transitions, 1566 flow [2022-11-20 10:49:22,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2219 transitions. [2022-11-20 10:49:22,264 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9519519519519519 [2022-11-20 10:49:22,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2219 transitions. [2022-11-20 10:49:22,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2219 transitions. [2022-11-20 10:49:22,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:22,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2219 transitions. [2022-11-20 10:49:22,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:22,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:22,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:22,300 INFO L175 Difference]: Start difference. First operand has 720 places, 752 transitions, 1516 flow. Second operand 3 states and 2219 transitions. [2022-11-20 10:49:22,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 738 transitions, 1566 flow [2022-11-20 10:49:22,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 738 transitions, 1558 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:49:22,363 INFO L231 Difference]: Finished difference. Result has 717 places, 736 transitions, 1480 flow [2022-11-20 10:49:22,366 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=717, PETRI_TRANSITIONS=736} [2022-11-20 10:49:22,370 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -3 predicate places. [2022-11-20 10:49:22,370 INFO L495 AbstractCegarLoop]: Abstraction has has 717 places, 736 transitions, 1480 flow [2022-11-20 10:49:22,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:22,374 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:22,374 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] [2022-11-20 10:49:22,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:49:22,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:22,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash 761723413, now seen corresponding path program 1 times [2022-11-20 10:49:22,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:22,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591437448] [2022-11-20 10:49:22,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:22,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591437448] [2022-11-20 10:49:22,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591437448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:22,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:22,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:22,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908066429] [2022-11-20 10:49:22,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:22,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:22,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:22,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:22,509 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 777 [2022-11-20 10:49:22,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 736 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:22,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:22,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 777 [2022-11-20 10:49:22,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:24,301 INFO L130 PetriNetUnfolder]: 617/7344 cut-off events. [2022-11-20 10:49:24,301 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-20 10:49:24,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7970 conditions, 7344 events. 617/7344 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 63263 event pairs, 255 based on Foata normal form. 0/5686 useless extension candidates. Maximal degree in co-relation 7931. Up to 603 conditions per place. [2022-11-20 10:49:24,374 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 37 selfloop transitions, 2 changer transitions 0/735 dead transitions. [2022-11-20 10:49:24,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 716 places, 735 transitions, 1556 flow [2022-11-20 10:49:24,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2206 transitions. [2022-11-20 10:49:24,381 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9463749463749463 [2022-11-20 10:49:24,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2206 transitions. [2022-11-20 10:49:24,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2206 transitions. [2022-11-20 10:49:24,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:24,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2206 transitions. [2022-11-20 10:49:24,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:24,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:24,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:24,396 INFO L175 Difference]: Start difference. First operand has 717 places, 736 transitions, 1480 flow. Second operand 3 states and 2206 transitions. [2022-11-20 10:49:24,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 716 places, 735 transitions, 1556 flow [2022-11-20 10:49:24,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 714 places, 735 transitions, 1552 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:24,410 INFO L231 Difference]: Finished difference. Result has 714 places, 735 transitions, 1478 flow [2022-11-20 10:49:24,411 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=712, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=714, PETRI_TRANSITIONS=735} [2022-11-20 10:49:24,412 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -6 predicate places. [2022-11-20 10:49:24,412 INFO L495 AbstractCegarLoop]: Abstraction has has 714 places, 735 transitions, 1478 flow [2022-11-20 10:49:24,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:24,414 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:24,414 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] [2022-11-20 10:49:24,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:49:24,415 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash 11427718, now seen corresponding path program 1 times [2022-11-20 10:49:24,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:24,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267302983] [2022-11-20 10:49:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:24,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:24,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:24,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267302983] [2022-11-20 10:49:24,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267302983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:24,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:24,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:24,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855252242] [2022-11-20 10:49:24,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:24,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:24,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:24,485 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 777 [2022-11-20 10:49:24,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 735 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:24,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:24,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 777 [2022-11-20 10:49:24,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:24,908 INFO L130 PetriNetUnfolder]: 86/1563 cut-off events. [2022-11-20 10:49:24,908 INFO L131 PetriNetUnfolder]: For 2/17 co-relation queries the response was YES. [2022-11-20 10:49:24,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1682 conditions, 1563 events. 86/1563 cut-off events. For 2/17 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8243 event pairs, 24 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1636. Up to 87 conditions per place. [2022-11-20 10:49:24,938 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 37 selfloop transitions, 2 changer transitions 0/734 dead transitions. [2022-11-20 10:49:24,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 734 transitions, 1554 flow [2022-11-20 10:49:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2206 transitions. [2022-11-20 10:49:24,944 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9463749463749463 [2022-11-20 10:49:24,944 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2206 transitions. [2022-11-20 10:49:24,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2206 transitions. [2022-11-20 10:49:24,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:24,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2206 transitions. [2022-11-20 10:49:24,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:24,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:24,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:24,959 INFO L175 Difference]: Start difference. First operand has 714 places, 735 transitions, 1478 flow. Second operand 3 states and 2206 transitions. [2022-11-20 10:49:24,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 734 transitions, 1554 flow [2022-11-20 10:49:24,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 734 transitions, 1550 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:24,972 INFO L231 Difference]: Finished difference. Result has 713 places, 734 transitions, 1476 flow [2022-11-20 10:49:24,973 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=713, PETRI_TRANSITIONS=734} [2022-11-20 10:49:24,974 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -7 predicate places. [2022-11-20 10:49:24,974 INFO L495 AbstractCegarLoop]: Abstraction has has 713 places, 734 transitions, 1476 flow [2022-11-20 10:49:24,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:24,976 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:24,976 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] [2022-11-20 10:49:24,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:49:24,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:24,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:24,977 INFO L85 PathProgramCache]: Analyzing trace with hash -847044289, now seen corresponding path program 1 times [2022-11-20 10:49:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:24,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273810074] [2022-11-20 10:49:24,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:25,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:25,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273810074] [2022-11-20 10:49:25,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273810074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:25,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:25,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:25,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527231550] [2022-11-20 10:49:25,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:25,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:25,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:25,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:25,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,037 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 777 [2022-11-20 10:49:25,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 734 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:25,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:25,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 777 [2022-11-20 10:49:25,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:25,417 INFO L130 PetriNetUnfolder]: 56/1018 cut-off events. [2022-11-20 10:49:25,418 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 10:49:25,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 1018 events. 56/1018 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4109 event pairs, 18 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1053. Up to 62 conditions per place. [2022-11-20 10:49:25,449 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 25 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2022-11-20 10:49:25,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 733 transitions, 1528 flow [2022-11-20 10:49:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2022-11-20 10:49:25,455 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9566709566709567 [2022-11-20 10:49:25,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2022-11-20 10:49:25,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2022-11-20 10:49:25,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:25,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2022-11-20 10:49:25,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:25,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:25,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:25,478 INFO L175 Difference]: Start difference. First operand has 713 places, 734 transitions, 1476 flow. Second operand 3 states and 2230 transitions. [2022-11-20 10:49:25,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 733 transitions, 1528 flow [2022-11-20 10:49:25,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 733 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:25,494 INFO L231 Difference]: Finished difference. Result has 712 places, 733 transitions, 1474 flow [2022-11-20 10:49:25,496 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=712, PETRI_TRANSITIONS=733} [2022-11-20 10:49:25,499 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -8 predicate places. [2022-11-20 10:49:25,499 INFO L495 AbstractCegarLoop]: Abstraction has has 712 places, 733 transitions, 1474 flow [2022-11-20 10:49:25,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:25,501 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:25,501 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-20 10:49:25,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:49:25,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:25,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1522263722, now seen corresponding path program 1 times [2022-11-20 10:49:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:25,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472250815] [2022-11-20 10:49:25,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:25,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:25,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:25,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472250815] [2022-11-20 10:49:25,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472250815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:25,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:25,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:25,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588186484] [2022-11-20 10:49:25,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:25,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:25,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:25,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:25,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:25,625 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 777 [2022-11-20 10:49:25,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 733 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:25,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:25,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 777 [2022-11-20 10:49:25,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:26,089 INFO L130 PetriNetUnfolder]: 64/1244 cut-off events. [2022-11-20 10:49:26,090 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-11-20 10:49:26,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1244 events. 64/1244 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4930 event pairs, 15 based on Foata normal form. 0/1004 useless extension candidates. Maximal degree in co-relation 1262. Up to 55 conditions per place. [2022-11-20 10:49:26,120 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 22 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2022-11-20 10:49:26,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 732 transitions, 1520 flow [2022-11-20 10:49:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2022-11-20 10:49:26,127 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9592449592449592 [2022-11-20 10:49:26,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2236 transitions. [2022-11-20 10:49:26,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2236 transitions. [2022-11-20 10:49:26,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:26,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2236 transitions. [2022-11-20 10:49:26,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:26,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:26,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:26,146 INFO L175 Difference]: Start difference. First operand has 712 places, 733 transitions, 1474 flow. Second operand 3 states and 2236 transitions. [2022-11-20 10:49:26,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 732 transitions, 1520 flow [2022-11-20 10:49:26,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 732 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:26,162 INFO L231 Difference]: Finished difference. Result has 711 places, 732 transitions, 1472 flow [2022-11-20 10:49:26,164 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=711, PETRI_TRANSITIONS=732} [2022-11-20 10:49:26,164 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -9 predicate places. [2022-11-20 10:49:26,165 INFO L495 AbstractCegarLoop]: Abstraction has has 711 places, 732 transitions, 1472 flow [2022-11-20 10:49:26,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:26,167 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:26,168 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] [2022-11-20 10:49:26,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:49:26,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:26,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash -636441757, now seen corresponding path program 1 times [2022-11-20 10:49:26,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:26,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829582649] [2022-11-20 10:49:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:26,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:26,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829582649] [2022-11-20 10:49:26,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829582649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:26,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:26,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:26,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843430765] [2022-11-20 10:49:26,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:26,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:26,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:26,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,223 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 777 [2022-11-20 10:49:26,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 732 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:26,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:26,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 777 [2022-11-20 10:49:26,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:26,693 INFO L130 PetriNetUnfolder]: 86/1306 cut-off events. [2022-11-20 10:49:26,693 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 10:49:26,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 1306 events. 86/1306 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6409 event pairs, 36 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 1399. Up to 116 conditions per place. [2022-11-20 10:49:26,724 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 43 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2022-11-20 10:49:26,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 731 transitions, 1560 flow [2022-11-20 10:49:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2194 transitions. [2022-11-20 10:49:26,731 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9412269412269412 [2022-11-20 10:49:26,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2194 transitions. [2022-11-20 10:49:26,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2194 transitions. [2022-11-20 10:49:26,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:26,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2194 transitions. [2022-11-20 10:49:26,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 731.3333333333334) internal successors, (2194), 3 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:26,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:26,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:26,746 INFO L175 Difference]: Start difference. First operand has 711 places, 732 transitions, 1472 flow. Second operand 3 states and 2194 transitions. [2022-11-20 10:49:26,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 731 transitions, 1560 flow [2022-11-20 10:49:26,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 731 transitions, 1556 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:26,799 INFO L231 Difference]: Finished difference. Result has 710 places, 731 transitions, 1470 flow [2022-11-20 10:49:26,800 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=710, PETRI_TRANSITIONS=731} [2022-11-20 10:49:26,801 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -10 predicate places. [2022-11-20 10:49:26,801 INFO L495 AbstractCegarLoop]: Abstraction has has 710 places, 731 transitions, 1470 flow [2022-11-20 10:49:26,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:26,802 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:26,802 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] [2022-11-20 10:49:26,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:49:26,802 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1709122749, now seen corresponding path program 1 times [2022-11-20 10:49:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:26,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178140882] [2022-11-20 10:49:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:26,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:26,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:26,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178140882] [2022-11-20 10:49:26,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178140882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:26,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:26,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:26,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947795441] [2022-11-20 10:49:26,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:26,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:26,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:26,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:26,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:26,850 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 777 [2022-11-20 10:49:26,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 731 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:26,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:26,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 777 [2022-11-20 10:49:26,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:27,152 INFO L130 PetriNetUnfolder]: 62/1003 cut-off events. [2022-11-20 10:49:27,152 INFO L131 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2022-11-20 10:49:27,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 1003 events. 62/1003 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4973 event pairs, 24 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 1023. Up to 86 conditions per place. [2022-11-20 10:49:27,176 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 36 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2022-11-20 10:49:27,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 730 transitions, 1544 flow [2022-11-20 10:49:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2205 transitions. [2022-11-20 10:49:27,181 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2022-11-20 10:49:27,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2205 transitions. [2022-11-20 10:49:27,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2205 transitions. [2022-11-20 10:49:27,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:27,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2205 transitions. [2022-11-20 10:49:27,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 735.0) internal successors, (2205), 3 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,193 INFO L175 Difference]: Start difference. First operand has 710 places, 731 transitions, 1470 flow. Second operand 3 states and 2205 transitions. [2022-11-20 10:49:27,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 730 transitions, 1544 flow [2022-11-20 10:49:27,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 730 transitions, 1540 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:27,207 INFO L231 Difference]: Finished difference. Result has 709 places, 730 transitions, 1468 flow [2022-11-20 10:49:27,208 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=709, PETRI_TRANSITIONS=730} [2022-11-20 10:49:27,209 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -11 predicate places. [2022-11-20 10:49:27,209 INFO L495 AbstractCegarLoop]: Abstraction has has 709 places, 730 transitions, 1468 flow [2022-11-20 10:49:27,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 723.3333333333334) internal successors, (2170), 3 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,210 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:27,210 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] [2022-11-20 10:49:27,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:49:27,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:27,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:27,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1778956224, now seen corresponding path program 1 times [2022-11-20 10:49:27,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:27,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339994771] [2022-11-20 10:49:27,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:27,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:27,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:27,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339994771] [2022-11-20 10:49:27,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339994771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:27,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:27,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:27,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853543540] [2022-11-20 10:49:27,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:27,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:27,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:27,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:27,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:27,260 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 777 [2022-11-20 10:49:27,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 730 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:27,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 777 [2022-11-20 10:49:27,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:27,556 INFO L130 PetriNetUnfolder]: 56/1014 cut-off events. [2022-11-20 10:49:27,556 INFO L131 PetriNetUnfolder]: For 20/21 co-relation queries the response was YES. [2022-11-20 10:49:27,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 1014 events. 56/1014 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4697 event pairs, 18 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 1003. Up to 62 conditions per place. [2022-11-20 10:49:27,580 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 25 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2022-11-20 10:49:27,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 729 transitions, 1520 flow [2022-11-20 10:49:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2022-11-20 10:49:27,585 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9566709566709567 [2022-11-20 10:49:27,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2230 transitions. [2022-11-20 10:49:27,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2230 transitions. [2022-11-20 10:49:27,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:27,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2230 transitions. [2022-11-20 10:49:27,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,597 INFO L175 Difference]: Start difference. First operand has 709 places, 730 transitions, 1468 flow. Second operand 3 states and 2230 transitions. [2022-11-20 10:49:27,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 729 transitions, 1520 flow [2022-11-20 10:49:27,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 729 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:27,609 INFO L231 Difference]: Finished difference. Result has 708 places, 729 transitions, 1466 flow [2022-11-20 10:49:27,611 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=708, PETRI_TRANSITIONS=729} [2022-11-20 10:49:27,611 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -12 predicate places. [2022-11-20 10:49:27,611 INFO L495 AbstractCegarLoop]: Abstraction has has 708 places, 729 transitions, 1466 flow [2022-11-20 10:49:27,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 735.3333333333334) internal successors, (2206), 3 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,612 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:27,613 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] [2022-11-20 10:49:27,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:49:27,613 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1690013827, now seen corresponding path program 1 times [2022-11-20 10:49:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:27,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212974218] [2022-11-20 10:49:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:27,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:27,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212974218] [2022-11-20 10:49:27,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212974218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:27,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:27,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:27,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464182851] [2022-11-20 10:49:27,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:27,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:27,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:27,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:27,660 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 777 [2022-11-20 10:49:27,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 729 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:27,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 777 [2022-11-20 10:49:27,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:27,927 INFO L130 PetriNetUnfolder]: 52/970 cut-off events. [2022-11-20 10:49:27,927 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-11-20 10:49:27,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 970 events. 52/970 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3800 event pairs, 15 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 945. Up to 55 conditions per place. [2022-11-20 10:49:27,950 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 22 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2022-11-20 10:49:27,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 728 transitions, 1512 flow [2022-11-20 10:49:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2022-11-20 10:49:27,956 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9592449592449592 [2022-11-20 10:49:27,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2236 transitions. [2022-11-20 10:49:27,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2236 transitions. [2022-11-20 10:49:27,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:27,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2236 transitions. [2022-11-20 10:49:27,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,967 INFO L175 Difference]: Start difference. First operand has 708 places, 729 transitions, 1466 flow. Second operand 3 states and 2236 transitions. [2022-11-20 10:49:27,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 728 transitions, 1512 flow [2022-11-20 10:49:27,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 728 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:27,980 INFO L231 Difference]: Finished difference. Result has 707 places, 728 transitions, 1464 flow [2022-11-20 10:49:27,981 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=728} [2022-11-20 10:49:27,982 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -13 predicate places. [2022-11-20 10:49:27,982 INFO L495 AbstractCegarLoop]: Abstraction has has 707 places, 728 transitions, 1464 flow [2022-11-20 10:49:27,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:27,983 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:27,984 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:27,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:49:27,984 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash -695507324, now seen corresponding path program 1 times [2022-11-20 10:49:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:27,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262837517] [2022-11-20 10:49:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:28,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262837517] [2022-11-20 10:49:28,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262837517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:28,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:28,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:28,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846568765] [2022-11-20 10:49:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:28,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:28,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:28,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:28,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:28,032 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 777 [2022-11-20 10:49:28,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 728 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:28,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:28,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 777 [2022-11-20 10:49:28,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:28,363 INFO L130 PetriNetUnfolder]: 74/1024 cut-off events. [2022-11-20 10:49:28,364 INFO L131 PetriNetUnfolder]: For 38/39 co-relation queries the response was YES. [2022-11-20 10:49:28,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 1024 events. 74/1024 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5558 event pairs, 36 based on Foata normal form. 0/821 useless extension candidates. Maximal degree in co-relation 1053. Up to 116 conditions per place. [2022-11-20 10:49:28,383 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 43 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2022-11-20 10:49:28,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 727 transitions, 1552 flow [2022-11-20 10:49:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2194 transitions. [2022-11-20 10:49:28,388 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9412269412269412 [2022-11-20 10:49:28,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2194 transitions. [2022-11-20 10:49:28,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2194 transitions. [2022-11-20 10:49:28,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:28,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2194 transitions. [2022-11-20 10:49:28,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 731.3333333333334) internal successors, (2194), 3 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:28,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:28,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:28,399 INFO L175 Difference]: Start difference. First operand has 707 places, 728 transitions, 1464 flow. Second operand 3 states and 2194 transitions. [2022-11-20 10:49:28,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 727 transitions, 1552 flow [2022-11-20 10:49:28,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 727 transitions, 1548 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:28,411 INFO L231 Difference]: Finished difference. Result has 706 places, 727 transitions, 1462 flow [2022-11-20 10:49:28,413 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=727} [2022-11-20 10:49:28,415 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -14 predicate places. [2022-11-20 10:49:28,416 INFO L495 AbstractCegarLoop]: Abstraction has has 706 places, 727 transitions, 1462 flow [2022-11-20 10:49:28,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 717.3333333333334) internal successors, (2152), 3 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:28,417 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:28,417 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] [2022-11-20 10:49:28,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:49:28,420 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:28,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash 606463638, now seen corresponding path program 1 times [2022-11-20 10:49:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:28,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858079398] [2022-11-20 10:49:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:28,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:28,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:28,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858079398] [2022-11-20 10:49:28,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858079398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:28,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:28,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023460577] [2022-11-20 10:49:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:28,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:28,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:28,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:28,524 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 777 [2022-11-20 10:49:28,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 727 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:28,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:28,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 777 [2022-11-20 10:49:28,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:29,032 INFO L130 PetriNetUnfolder]: 110/2113 cut-off events. [2022-11-20 10:49:29,033 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-11-20 10:49:29,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180 conditions, 2113 events. 110/2113 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 11108 event pairs, 15 based on Foata normal form. 0/1680 useless extension candidates. Maximal degree in co-relation 2078. Up to 56 conditions per place. [2022-11-20 10:49:29,068 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 13 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2022-11-20 10:49:29,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 726 transitions, 1490 flow [2022-11-20 10:49:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2254 transitions. [2022-11-20 10:49:29,073 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9669669669669669 [2022-11-20 10:49:29,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2254 transitions. [2022-11-20 10:49:29,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2254 transitions. [2022-11-20 10:49:29,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:29,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2254 transitions. [2022-11-20 10:49:29,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:29,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:29,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:29,085 INFO L175 Difference]: Start difference. First operand has 706 places, 727 transitions, 1462 flow. Second operand 3 states and 2254 transitions. [2022-11-20 10:49:29,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 726 transitions, 1490 flow [2022-11-20 10:49:29,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 726 transitions, 1486 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:29,097 INFO L231 Difference]: Finished difference. Result has 705 places, 726 transitions, 1460 flow [2022-11-20 10:49:29,098 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=705, PETRI_TRANSITIONS=726} [2022-11-20 10:49:29,098 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -15 predicate places. [2022-11-20 10:49:29,099 INFO L495 AbstractCegarLoop]: Abstraction has has 705 places, 726 transitions, 1460 flow [2022-11-20 10:49:29,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:29,100 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:29,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] [2022-11-20 10:49:29,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:49:29,100 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:29,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash -495739275, now seen corresponding path program 1 times [2022-11-20 10:49:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:29,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150248860] [2022-11-20 10:49:29,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:29,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:29,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:29,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150248860] [2022-11-20 10:49:29,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150248860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:29,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:29,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:49:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500311140] [2022-11-20 10:49:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:29,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:49:29,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:49:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:49:29,603 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-20 10:49:29,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 726 transitions, 1460 flow. Second operand has 6 states, 6 states have (on average 718.8333333333334) internal successors, (4313), 6 states have internal predecessors, (4313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:29,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:29,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-20 10:49:29,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:33,271 INFO L130 PetriNetUnfolder]: 1304/15363 cut-off events. [2022-11-20 10:49:33,271 INFO L131 PetriNetUnfolder]: For 14/29 co-relation queries the response was YES. [2022-11-20 10:49:33,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16491 conditions, 15363 events. 1304/15363 cut-off events. For 14/29 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 175049 event pairs, 588 based on Foata normal form. 0/12021 useless extension candidates. Maximal degree in co-relation 16329. Up to 1111 conditions per place. [2022-11-20 10:49:33,491 INFO L137 encePairwiseOnDemand]: 771/777 looper letters, 39 selfloop transitions, 5 changer transitions 0/725 dead transitions. [2022-11-20 10:49:33,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 725 transitions, 1546 flow [2022-11-20 10:49:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:49:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:49:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4347 transitions. [2022-11-20 10:49:33,501 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9324324324324325 [2022-11-20 10:49:33,501 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4347 transitions. [2022-11-20 10:49:33,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4347 transitions. [2022-11-20 10:49:33,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:33,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4347 transitions. [2022-11-20 10:49:33,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 724.5) internal successors, (4347), 6 states have internal predecessors, (4347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:33,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 777.0) internal successors, (5439), 7 states have internal predecessors, (5439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:33,526 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 777.0) internal successors, (5439), 7 states have internal predecessors, (5439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:33,527 INFO L175 Difference]: Start difference. First operand has 705 places, 726 transitions, 1460 flow. Second operand 6 states and 4347 transitions. [2022-11-20 10:49:33,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 725 transitions, 1546 flow [2022-11-20 10:49:33,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 725 transitions, 1542 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:33,542 INFO L231 Difference]: Finished difference. Result has 707 places, 725 transitions, 1464 flow [2022-11-20 10:49:33,544 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=725} [2022-11-20 10:49:33,545 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -13 predicate places. [2022-11-20 10:49:33,545 INFO L495 AbstractCegarLoop]: Abstraction has has 707 places, 725 transitions, 1464 flow [2022-11-20 10:49:33,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 718.8333333333334) internal successors, (4313), 6 states have internal predecessors, (4313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:33,547 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:33,547 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] [2022-11-20 10:49:33,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:49:33,547 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash 448717555, now seen corresponding path program 1 times [2022-11-20 10:49:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:33,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103407428] [2022-11-20 10:49:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:33,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:33,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103407428] [2022-11-20 10:49:33,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103407428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:33,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:33,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505774069] [2022-11-20 10:49:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:33,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:33,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:33,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:33,629 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 777 [2022-11-20 10:49:33,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 725 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:33,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:33,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 777 [2022-11-20 10:49:33,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:34,119 INFO L130 PetriNetUnfolder]: 69/1288 cut-off events. [2022-11-20 10:49:34,120 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 10:49:34,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 1288 events. 69/1288 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6186 event pairs, 2 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1362. Up to 58 conditions per place. [2022-11-20 10:49:34,138 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 24 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2022-11-20 10:49:34,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 725 transitions, 1517 flow [2022-11-20 10:49:34,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2232 transitions. [2022-11-20 10:49:34,143 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9575289575289575 [2022-11-20 10:49:34,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2232 transitions. [2022-11-20 10:49:34,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2232 transitions. [2022-11-20 10:49:34,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:34,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2232 transitions. [2022-11-20 10:49:34,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:34,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:34,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:34,160 INFO L175 Difference]: Start difference. First operand has 707 places, 725 transitions, 1464 flow. Second operand 3 states and 2232 transitions. [2022-11-20 10:49:34,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 725 transitions, 1517 flow [2022-11-20 10:49:34,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 725 transitions, 1507 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 10:49:34,172 INFO L231 Difference]: Finished difference. Result has 703 places, 724 transitions, 1456 flow [2022-11-20 10:49:34,173 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=703, PETRI_TRANSITIONS=724} [2022-11-20 10:49:34,174 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -17 predicate places. [2022-11-20 10:49:34,175 INFO L495 AbstractCegarLoop]: Abstraction has has 703 places, 724 transitions, 1456 flow [2022-11-20 10:49:34,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.0) internal successors, (2211), 3 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:34,176 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:34,176 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] [2022-11-20 10:49:34,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:49:34,176 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:34,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1780934451, now seen corresponding path program 1 times [2022-11-20 10:49:34,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:34,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594506503] [2022-11-20 10:49:34,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:34,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:34,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:34,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594506503] [2022-11-20 10:49:34,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594506503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:34,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:34,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726429961] [2022-11-20 10:49:34,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:34,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:34,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:34,230 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-20 10:49:34,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 724 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 719.0) internal successors, (2157), 3 states have internal predecessors, (2157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:34,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:34,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-20 10:49:34,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:34,560 INFO L130 PetriNetUnfolder]: 87/1299 cut-off events. [2022-11-20 10:49:34,560 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 10:49:34,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 1299 events. 87/1299 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6437 event pairs, 35 based on Foata normal form. 0/1059 useless extension candidates. Maximal degree in co-relation 1301. Up to 112 conditions per place. [2022-11-20 10:49:34,585 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 42 selfloop transitions, 2 changer transitions 0/724 dead transitions. [2022-11-20 10:49:34,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 724 transitions, 1545 flow [2022-11-20 10:49:34,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2196 transitions. [2022-11-20 10:49:34,615 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9420849420849421 [2022-11-20 10:49:34,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2196 transitions. [2022-11-20 10:49:34,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2196 transitions. [2022-11-20 10:49:34,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:34,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2196 transitions. [2022-11-20 10:49:34,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:34,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:34,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:34,625 INFO L175 Difference]: Start difference. First operand has 703 places, 724 transitions, 1456 flow. Second operand 3 states and 2196 transitions. [2022-11-20 10:49:34,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 724 transitions, 1545 flow [2022-11-20 10:49:34,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 724 transitions, 1541 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:34,637 INFO L231 Difference]: Finished difference. Result has 702 places, 723 transitions, 1454 flow [2022-11-20 10:49:34,638 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=702, PETRI_TRANSITIONS=723} [2022-11-20 10:49:34,639 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -18 predicate places. [2022-11-20 10:49:34,639 INFO L495 AbstractCegarLoop]: Abstraction has has 702 places, 723 transitions, 1454 flow [2022-11-20 10:49:34,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 719.0) internal successors, (2157), 3 states have internal predecessors, (2157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:34,640 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:34,641 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:34,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:49:34,641 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:34,642 INFO L85 PathProgramCache]: Analyzing trace with hash 115297316, now seen corresponding path program 1 times [2022-11-20 10:49:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:34,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710059070] [2022-11-20 10:49:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:34,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:34,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710059070] [2022-11-20 10:49:34,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710059070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:34,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:34,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:34,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048094517] [2022-11-20 10:49:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:34,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:34,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:34,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:34,699 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 777 [2022-11-20 10:49:34,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 723 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:34,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:34,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 777 [2022-11-20 10:49:34,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:34,993 INFO L130 PetriNetUnfolder]: 57/1016 cut-off events. [2022-11-20 10:49:34,993 INFO L131 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-11-20 10:49:35,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 1016 events. 57/1016 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4752 event pairs, 2 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 922. Up to 58 conditions per place. [2022-11-20 10:49:35,010 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 24 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2022-11-20 10:49:35,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 723 transitions, 1507 flow [2022-11-20 10:49:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2232 transitions. [2022-11-20 10:49:35,015 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9575289575289575 [2022-11-20 10:49:35,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2232 transitions. [2022-11-20 10:49:35,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2232 transitions. [2022-11-20 10:49:35,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:35,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2232 transitions. [2022-11-20 10:49:35,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.0) internal successors, (2232), 3 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:35,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:35,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:35,025 INFO L175 Difference]: Start difference. First operand has 702 places, 723 transitions, 1454 flow. Second operand 3 states and 2232 transitions. [2022-11-20 10:49:35,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 723 transitions, 1507 flow [2022-11-20 10:49:35,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 723 transitions, 1503 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:35,036 INFO L231 Difference]: Finished difference. Result has 701 places, 722 transitions, 1452 flow [2022-11-20 10:49:35,037 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=701, PETRI_TRANSITIONS=722} [2022-11-20 10:49:35,037 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -19 predicate places. [2022-11-20 10:49:35,038 INFO L495 AbstractCegarLoop]: Abstraction has has 701 places, 722 transitions, 1452 flow [2022-11-20 10:49:35,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:35,039 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:35,039 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] [2022-11-20 10:49:35,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:49:35,039 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:35,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash -85471560, now seen corresponding path program 1 times [2022-11-20 10:49:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:35,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641034416] [2022-11-20 10:49:35,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:35,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:35,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:35,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641034416] [2022-11-20 10:49:35,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641034416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:35,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:35,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:35,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651052815] [2022-11-20 10:49:35,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:35,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:35,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:35,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:35,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:35,091 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 777 [2022-11-20 10:49:35,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 722 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:35,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:35,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 777 [2022-11-20 10:49:35,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:36,326 INFO L130 PetriNetUnfolder]: 383/5318 cut-off events. [2022-11-20 10:49:36,326 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-20 10:49:36,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 5318 events. 383/5318 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 41266 event pairs, 100 based on Foata normal form. 0/4243 useless extension candidates. Maximal degree in co-relation 5176. Up to 296 conditions per place. [2022-11-20 10:49:36,375 INFO L137 encePairwiseOnDemand]: 765/777 looper letters, 27 selfloop transitions, 2 changer transitions 0/715 dead transitions. [2022-11-20 10:49:36,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 715 transitions, 1497 flow [2022-11-20 10:49:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2214 transitions. [2022-11-20 10:49:36,379 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9498069498069498 [2022-11-20 10:49:36,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2214 transitions. [2022-11-20 10:49:36,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2214 transitions. [2022-11-20 10:49:36,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:36,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2214 transitions. [2022-11-20 10:49:36,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 738.0) internal successors, (2214), 3 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:36,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:36,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:36,390 INFO L175 Difference]: Start difference. First operand has 701 places, 722 transitions, 1452 flow. Second operand 3 states and 2214 transitions. [2022-11-20 10:49:36,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 715 transitions, 1497 flow [2022-11-20 10:49:36,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 715 transitions, 1493 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:36,403 INFO L231 Difference]: Finished difference. Result has 692 places, 714 transitions, 1442 flow [2022-11-20 10:49:36,404 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1442, PETRI_PLACES=692, PETRI_TRANSITIONS=714} [2022-11-20 10:49:36,405 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -28 predicate places. [2022-11-20 10:49:36,405 INFO L495 AbstractCegarLoop]: Abstraction has has 692 places, 714 transitions, 1442 flow [2022-11-20 10:49:36,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:36,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:36,406 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:36,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:49:36,407 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash -533733990, now seen corresponding path program 1 times [2022-11-20 10:49:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:36,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938843599] [2022-11-20 10:49:36,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:36,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:36,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938843599] [2022-11-20 10:49:36,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938843599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:36,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:36,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:36,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204622323] [2022-11-20 10:49:36,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:36,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:36,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:36,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:36,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:36,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 777 [2022-11-20 10:49:36,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 714 transitions, 1442 flow. Second operand has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:36,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:36,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 777 [2022-11-20 10:49:36,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:37,704 INFO L130 PetriNetUnfolder]: 398/5510 cut-off events. [2022-11-20 10:49:37,705 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-11-20 10:49:37,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5842 conditions, 5510 events. 398/5510 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 43475 event pairs, 100 based on Foata normal form. 0/4462 useless extension candidates. Maximal degree in co-relation 5420. Up to 304 conditions per place. [2022-11-20 10:49:37,752 INFO L137 encePairwiseOnDemand]: 765/777 looper letters, 27 selfloop transitions, 2 changer transitions 0/707 dead transitions. [2022-11-20 10:49:37,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 707 transitions, 1487 flow [2022-11-20 10:49:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2214 transitions. [2022-11-20 10:49:37,759 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9498069498069498 [2022-11-20 10:49:37,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2214 transitions. [2022-11-20 10:49:37,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2214 transitions. [2022-11-20 10:49:37,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:37,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2214 transitions. [2022-11-20 10:49:37,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 738.0) internal successors, (2214), 3 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:37,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:37,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:37,775 INFO L175 Difference]: Start difference. First operand has 692 places, 714 transitions, 1442 flow. Second operand 3 states and 2214 transitions. [2022-11-20 10:49:37,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 707 transitions, 1487 flow [2022-11-20 10:49:37,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 707 transitions, 1487 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:49:37,790 INFO L231 Difference]: Finished difference. Result has 685 places, 706 transitions, 1436 flow [2022-11-20 10:49:37,791 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=685, PETRI_TRANSITIONS=706} [2022-11-20 10:49:37,791 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -35 predicate places. [2022-11-20 10:49:37,792 INFO L495 AbstractCegarLoop]: Abstraction has has 685 places, 706 transitions, 1436 flow [2022-11-20 10:49:37,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:37,793 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:37,793 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] [2022-11-20 10:49:37,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:49:37,793 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:37,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1616997212, now seen corresponding path program 1 times [2022-11-20 10:49:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:37,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108415233] [2022-11-20 10:49:37,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:37,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:37,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:37,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108415233] [2022-11-20 10:49:37,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108415233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:37,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:37,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:49:37,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049951702] [2022-11-20 10:49:37,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:37,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:49:37,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:37,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:49:37,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:49:37,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 777 [2022-11-20 10:49:37,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 706 transitions, 1436 flow. Second operand has 5 states, 5 states have (on average 742.0) internal successors, (3710), 5 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:37,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:37,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 777 [2022-11-20 10:49:37,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:38,383 INFO L130 PetriNetUnfolder]: 52/1209 cut-off events. [2022-11-20 10:49:38,383 INFO L131 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2022-11-20 10:49:38,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 1209 events. 52/1209 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5380 event pairs, 0 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1031. Up to 19 conditions per place. [2022-11-20 10:49:38,400 INFO L137 encePairwiseOnDemand]: 772/777 looper letters, 26 selfloop transitions, 4 changer transitions 0/715 dead transitions. [2022-11-20 10:49:38,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 715 transitions, 1514 flow [2022-11-20 10:49:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:49:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:49:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3731 transitions. [2022-11-20 10:49:38,407 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9603603603603603 [2022-11-20 10:49:38,407 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3731 transitions. [2022-11-20 10:49:38,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3731 transitions. [2022-11-20 10:49:38,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:38,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3731 transitions. [2022-11-20 10:49:38,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 746.2) internal successors, (3731), 5 states have internal predecessors, (3731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:38,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 777.0) internal successors, (4662), 6 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:38,421 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 777.0) internal successors, (4662), 6 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:38,422 INFO L175 Difference]: Start difference. First operand has 685 places, 706 transitions, 1436 flow. Second operand 5 states and 3731 transitions. [2022-11-20 10:49:38,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 715 transitions, 1514 flow [2022-11-20 10:49:38,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 715 transitions, 1514 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:49:38,432 INFO L231 Difference]: Finished difference. Result has 690 places, 707 transitions, 1452 flow [2022-11-20 10:49:38,433 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1452, PETRI_PLACES=690, PETRI_TRANSITIONS=707} [2022-11-20 10:49:38,433 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -30 predicate places. [2022-11-20 10:49:38,433 INFO L495 AbstractCegarLoop]: Abstraction has has 690 places, 707 transitions, 1452 flow [2022-11-20 10:49:38,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 742.0) internal successors, (3710), 5 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:38,435 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:38,435 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:38,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:49:38,435 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:38,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:38,435 INFO L85 PathProgramCache]: Analyzing trace with hash 126730472, now seen corresponding path program 1 times [2022-11-20 10:49:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:38,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459946332] [2022-11-20 10:49:38,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:38,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:38,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:38,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459946332] [2022-11-20 10:49:38,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459946332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:38,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488162999] [2022-11-20 10:49:38,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:38,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:38,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:38,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:49:38,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:49:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:38,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:49:38,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:49:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:39,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:49:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:39,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488162999] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:49:39,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:49:39,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-20 10:49:39,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067934744] [2022-11-20 10:49:39,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:49:39,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:49:39,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:39,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:49:39,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:49:39,163 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 777 [2022-11-20 10:49:39,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 707 transitions, 1452 flow. Second operand has 14 states, 14 states have (on average 742.5714285714286) internal successors, (10396), 14 states have internal predecessors, (10396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:39,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:39,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 777 [2022-11-20 10:49:39,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:39,636 INFO L130 PetriNetUnfolder]: 52/1225 cut-off events. [2022-11-20 10:49:39,636 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-11-20 10:49:39,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 1225 events. 52/1225 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5365 event pairs, 0 based on Foata normal form. 2/1032 useless extension candidates. Maximal degree in co-relation 1140. Up to 11 conditions per place. [2022-11-20 10:49:39,651 INFO L137 encePairwiseOnDemand]: 769/777 looper letters, 32 selfloop transitions, 11 changer transitions 0/727 dead transitions. [2022-11-20 10:49:39,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 727 transitions, 1580 flow [2022-11-20 10:49:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:49:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:49:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8174 transitions. [2022-11-20 10:49:39,662 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9563589563589564 [2022-11-20 10:49:39,662 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8174 transitions. [2022-11-20 10:49:39,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8174 transitions. [2022-11-20 10:49:39,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:39,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8174 transitions. [2022-11-20 10:49:39,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 743.0909090909091) internal successors, (8174), 11 states have internal predecessors, (8174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:39,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 777.0) internal successors, (9324), 12 states have internal predecessors, (9324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:39,692 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 777.0) internal successors, (9324), 12 states have internal predecessors, (9324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:39,692 INFO L175 Difference]: Start difference. First operand has 690 places, 707 transitions, 1452 flow. Second operand 11 states and 8174 transitions. [2022-11-20 10:49:39,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 727 transitions, 1580 flow [2022-11-20 10:49:39,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 727 transitions, 1574 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 10:49:39,705 INFO L231 Difference]: Finished difference. Result has 700 places, 713 transitions, 1501 flow [2022-11-20 10:49:39,706 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1501, PETRI_PLACES=700, PETRI_TRANSITIONS=713} [2022-11-20 10:49:39,707 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -20 predicate places. [2022-11-20 10:49:39,707 INFO L495 AbstractCegarLoop]: Abstraction has has 700 places, 713 transitions, 1501 flow [2022-11-20 10:49:39,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 742.5714285714286) internal successors, (10396), 14 states have internal predecessors, (10396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:39,710 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:39,710 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:39,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:39,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_43fc6547-345b-4fea-98a4-62f73a94c44e/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:39,916 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash -441056144, now seen corresponding path program 2 times [2022-11-20 10:49:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:39,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752869764] [2022-11-20 10:49:39,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:40,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752869764] [2022-11-20 10:49:40,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752869764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:40,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:40,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:49:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949050539] [2022-11-20 10:49:40,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:40,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:49:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:40,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:49:40,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:49:40,671 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 777 [2022-11-20 10:49:40,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 713 transitions, 1501 flow. Second operand has 6 states, 6 states have (on average 724.6666666666666) internal successors, (4348), 6 states have internal predecessors, (4348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:40,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:40,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 777 [2022-11-20 10:49:40,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:43,420 INFO L130 PetriNetUnfolder]: 1261/12147 cut-off events. [2022-11-20 10:49:43,420 INFO L131 PetriNetUnfolder]: For 15/77 co-relation queries the response was YES. [2022-11-20 10:49:43,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13491 conditions, 12147 events. 1261/12147 cut-off events. For 15/77 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 126651 event pairs, 210 based on Foata normal form. 16/9866 useless extension candidates. Maximal degree in co-relation 13281. Up to 453 conditions per place. [2022-11-20 10:49:43,553 INFO L137 encePairwiseOnDemand]: 772/777 looper letters, 80 selfloop transitions, 4 changer transitions 0/760 dead transitions. [2022-11-20 10:49:43,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 760 transitions, 1763 flow [2022-11-20 10:49:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:49:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 10:49:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4417 transitions. [2022-11-20 10:49:43,563 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9474474474474475 [2022-11-20 10:49:43,563 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4417 transitions. [2022-11-20 10:49:43,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4417 transitions. [2022-11-20 10:49:43,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:43,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4417 transitions. [2022-11-20 10:49:43,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 736.1666666666666) internal successors, (4417), 6 states have internal predecessors, (4417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:43,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 777.0) internal successors, (5439), 7 states have internal predecessors, (5439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:43,579 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 777.0) internal successors, (5439), 7 states have internal predecessors, (5439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:43,579 INFO L175 Difference]: Start difference. First operand has 700 places, 713 transitions, 1501 flow. Second operand 6 states and 4417 transitions. [2022-11-20 10:49:43,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 760 transitions, 1763 flow [2022-11-20 10:49:43,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 760 transitions, 1754 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-20 10:49:43,593 INFO L231 Difference]: Finished difference. Result has 701 places, 712 transitions, 1498 flow [2022-11-20 10:49:43,594 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=696, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1498, PETRI_PLACES=701, PETRI_TRANSITIONS=712} [2022-11-20 10:49:43,595 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -19 predicate places. [2022-11-20 10:49:43,595 INFO L495 AbstractCegarLoop]: Abstraction has has 701 places, 712 transitions, 1498 flow [2022-11-20 10:49:43,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 724.6666666666666) internal successors, (4348), 6 states have internal predecessors, (4348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:43,596 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:43,597 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:43,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:49:43,597 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:43,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1251748994, now seen corresponding path program 1 times [2022-11-20 10:49:43,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:43,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387064765] [2022-11-20 10:49:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:43,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:43,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:43,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387064765] [2022-11-20 10:49:43,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387064765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:43,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:43,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834230439] [2022-11-20 10:49:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:43,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:43,667 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-20 10:49:43,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 712 transitions, 1498 flow. Second operand has 3 states, 3 states have (on average 719.3333333333334) internal successors, (2158), 3 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:43,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:43,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-20 10:49:43,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:44,089 INFO L130 PetriNetUnfolder]: 101/1519 cut-off events. [2022-11-20 10:49:44,089 INFO L131 PetriNetUnfolder]: For 43/44 co-relation queries the response was YES. [2022-11-20 10:49:44,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 1519 events. 101/1519 cut-off events. For 43/44 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9093 event pairs, 2 based on Foata normal form. 0/1263 useless extension candidates. Maximal degree in co-relation 1564. Up to 178 conditions per place. [2022-11-20 10:49:44,112 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 42 selfloop transitions, 2 changer transitions 0/712 dead transitions. [2022-11-20 10:49:44,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 712 transitions, 1587 flow [2022-11-20 10:49:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2196 transitions. [2022-11-20 10:49:44,117 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9420849420849421 [2022-11-20 10:49:44,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2196 transitions. [2022-11-20 10:49:44,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2196 transitions. [2022-11-20 10:49:44,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:44,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2196 transitions. [2022-11-20 10:49:44,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:44,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:44,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:44,123 INFO L175 Difference]: Start difference. First operand has 701 places, 712 transitions, 1498 flow. Second operand 3 states and 2196 transitions. [2022-11-20 10:49:44,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 712 transitions, 1587 flow [2022-11-20 10:49:44,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 698 places, 712 transitions, 1580 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:49:44,135 INFO L231 Difference]: Finished difference. Result has 698 places, 711 transitions, 1493 flow [2022-11-20 10:49:44,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=696, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1493, PETRI_PLACES=698, PETRI_TRANSITIONS=711} [2022-11-20 10:49:44,137 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -22 predicate places. [2022-11-20 10:49:44,137 INFO L495 AbstractCegarLoop]: Abstraction has has 698 places, 711 transitions, 1493 flow [2022-11-20 10:49:44,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 719.3333333333334) internal successors, (2158), 3 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:44,138 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:44,138 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:44,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 10:49:44,138 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:44,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2086484312, now seen corresponding path program 1 times [2022-11-20 10:49:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:44,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98134965] [2022-11-20 10:49:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:44,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:44,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98134965] [2022-11-20 10:49:44,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98134965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:44,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:44,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:44,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971077860] [2022-11-20 10:49:44,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:44,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:44,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:44,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:44,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:44,205 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 777 [2022-11-20 10:49:44,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 711 transitions, 1493 flow. Second operand has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:44,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:44,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 777 [2022-11-20 10:49:44,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:44,582 INFO L130 PetriNetUnfolder]: 96/1760 cut-off events. [2022-11-20 10:49:44,583 INFO L131 PetriNetUnfolder]: For 6/19 co-relation queries the response was YES. [2022-11-20 10:49:44,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 1760 events. 96/1760 cut-off events. For 6/19 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9926 event pairs, 12 based on Foata normal form. 1/1483 useless extension candidates. Maximal degree in co-relation 1722. Up to 51 conditions per place. [2022-11-20 10:49:44,605 INFO L137 encePairwiseOnDemand]: 762/777 looper letters, 26 selfloop transitions, 9 changer transitions 0/710 dead transitions. [2022-11-20 10:49:44,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 710 transitions, 1562 flow [2022-11-20 10:49:44,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2216 transitions. [2022-11-20 10:49:44,610 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9506649506649507 [2022-11-20 10:49:44,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2216 transitions. [2022-11-20 10:49:44,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2216 transitions. [2022-11-20 10:49:44,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:44,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2216 transitions. [2022-11-20 10:49:44,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 738.6666666666666) internal successors, (2216), 3 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:44,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:44,618 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:44,618 INFO L175 Difference]: Start difference. First operand has 698 places, 711 transitions, 1493 flow. Second operand 3 states and 2216 transitions. [2022-11-20 10:49:44,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 710 transitions, 1562 flow [2022-11-20 10:49:44,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 710 transitions, 1558 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:44,630 INFO L231 Difference]: Finished difference. Result has 693 places, 709 transitions, 1520 flow [2022-11-20 10:49:44,631 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1520, PETRI_PLACES=693, PETRI_TRANSITIONS=709} [2022-11-20 10:49:44,631 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -27 predicate places. [2022-11-20 10:49:44,632 INFO L495 AbstractCegarLoop]: Abstraction has has 693 places, 709 transitions, 1520 flow [2022-11-20 10:49:44,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 726.6666666666666) internal successors, (2180), 3 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:44,632 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:44,633 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:44,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 10:49:44,633 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:44,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1715278707, now seen corresponding path program 1 times [2022-11-20 10:49:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:44,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139192255] [2022-11-20 10:49:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:44,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139192255] [2022-11-20 10:49:44,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139192255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:44,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:44,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003928240] [2022-11-20 10:49:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:44,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:44,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:44,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:44,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:44,701 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 723 out of 777 [2022-11-20 10:49:44,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 709 transitions, 1520 flow. Second operand has 3 states, 3 states have (on average 725.0) internal successors, (2175), 3 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:44,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:44,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 723 of 777 [2022-11-20 10:49:44,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:45,111 INFO L130 PetriNetUnfolder]: 110/2026 cut-off events. [2022-11-20 10:49:45,112 INFO L131 PetriNetUnfolder]: For 46/60 co-relation queries the response was YES. [2022-11-20 10:49:45,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 2026 events. 110/2026 cut-off events. For 46/60 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 12279 event pairs, 20 based on Foata normal form. 1/1704 useless extension candidates. Maximal degree in co-relation 2028. Up to 77 conditions per place. [2022-11-20 10:49:45,133 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 33 selfloop transitions, 3 changer transitions 0/709 dead transitions. [2022-11-20 10:49:45,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 709 transitions, 1593 flow [2022-11-20 10:49:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2202 transitions. [2022-11-20 10:49:45,137 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9446589446589446 [2022-11-20 10:49:45,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2202 transitions. [2022-11-20 10:49:45,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2202 transitions. [2022-11-20 10:49:45,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:45,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2202 transitions. [2022-11-20 10:49:45,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 734.0) internal successors, (2202), 3 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:45,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:45,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:45,146 INFO L175 Difference]: Start difference. First operand has 693 places, 709 transitions, 1520 flow. Second operand 3 states and 2202 transitions. [2022-11-20 10:49:45,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 709 transitions, 1593 flow [2022-11-20 10:49:45,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 709 transitions, 1584 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:49:45,158 INFO L231 Difference]: Finished difference. Result has 693 places, 708 transitions, 1515 flow [2022-11-20 10:49:45,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1515, PETRI_PLACES=693, PETRI_TRANSITIONS=708} [2022-11-20 10:49:45,160 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -27 predicate places. [2022-11-20 10:49:45,160 INFO L495 AbstractCegarLoop]: Abstraction has has 693 places, 708 transitions, 1515 flow [2022-11-20 10:49:45,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.0) internal successors, (2175), 3 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:45,161 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:45,161 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:45,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 10:49:45,162 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1120038487, now seen corresponding path program 1 times [2022-11-20 10:49:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:45,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758482249] [2022-11-20 10:49:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:45,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:45,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758482249] [2022-11-20 10:49:45,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758482249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:45,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:45,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:45,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119606033] [2022-11-20 10:49:45,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:45,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:45,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:45,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:45,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:45,234 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 777 [2022-11-20 10:49:45,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 708 transitions, 1515 flow. Second operand has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:45,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:45,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 777 [2022-11-20 10:49:45,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:45,667 INFO L130 PetriNetUnfolder]: 84/1548 cut-off events. [2022-11-20 10:49:45,667 INFO L131 PetriNetUnfolder]: For 28/29 co-relation queries the response was YES. [2022-11-20 10:49:45,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1738 conditions, 1548 events. 84/1548 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8781 event pairs, 13 based on Foata normal form. 1/1326 useless extension candidates. Maximal degree in co-relation 1546. Up to 83 conditions per place. [2022-11-20 10:49:45,698 INFO L137 encePairwiseOnDemand]: 762/777 looper letters, 22 selfloop transitions, 8 changer transitions 14/707 dead transitions. [2022-11-20 10:49:45,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 707 transitions, 1582 flow [2022-11-20 10:49:45,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2022-11-20 10:49:45,703 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9502359502359502 [2022-11-20 10:49:45,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2215 transitions. [2022-11-20 10:49:45,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2215 transitions. [2022-11-20 10:49:45,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:45,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2215 transitions. [2022-11-20 10:49:45,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 738.3333333333334) internal successors, (2215), 3 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:45,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:45,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:45,714 INFO L175 Difference]: Start difference. First operand has 693 places, 708 transitions, 1515 flow. Second operand 3 states and 2215 transitions. [2022-11-20 10:49:45,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 707 transitions, 1582 flow [2022-11-20 10:49:45,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 707 transitions, 1576 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:45,730 INFO L231 Difference]: Finished difference. Result has 688 places, 692 transitions, 1506 flow [2022-11-20 10:49:45,731 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1506, PETRI_PLACES=688, PETRI_TRANSITIONS=692} [2022-11-20 10:49:45,731 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -32 predicate places. [2022-11-20 10:49:45,731 INFO L495 AbstractCegarLoop]: Abstraction has has 688 places, 692 transitions, 1506 flow [2022-11-20 10:49:45,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:45,732 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:45,732 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:45,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 10:49:45,733 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:45,733 INFO L85 PathProgramCache]: Analyzing trace with hash 506780862, now seen corresponding path program 1 times [2022-11-20 10:49:45,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:45,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73760432] [2022-11-20 10:49:45,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:45,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:45,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:45,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73760432] [2022-11-20 10:49:45,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73760432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:45,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:45,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075425940] [2022-11-20 10:49:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:45,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:45,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:45,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:45,836 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 723 out of 777 [2022-11-20 10:49:45,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 692 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:45,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:45,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 723 of 777 [2022-11-20 10:49:45,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:46,247 INFO L130 PetriNetUnfolder]: 85/1509 cut-off events. [2022-11-20 10:49:46,247 INFO L131 PetriNetUnfolder]: For 99/100 co-relation queries the response was YES. [2022-11-20 10:49:46,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 1509 events. 85/1509 cut-off events. For 99/100 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8521 event pairs, 5 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1573. Up to 118 conditions per place. [2022-11-20 10:49:46,264 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 28 selfloop transitions, 3 changer transitions 0/692 dead transitions. [2022-11-20 10:49:46,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 692 transitions, 1569 flow [2022-11-20 10:49:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2197 transitions. [2022-11-20 10:49:46,267 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9425139425139425 [2022-11-20 10:49:46,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2197 transitions. [2022-11-20 10:49:46,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2197 transitions. [2022-11-20 10:49:46,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:46,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2197 transitions. [2022-11-20 10:49:46,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 732.3333333333334) internal successors, (2197), 3 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:46,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:46,276 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:46,276 INFO L175 Difference]: Start difference. First operand has 688 places, 692 transitions, 1506 flow. Second operand 3 states and 2197 transitions. [2022-11-20 10:49:46,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 692 transitions, 1569 flow [2022-11-20 10:49:46,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 692 transitions, 1561 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:49:46,290 INFO L231 Difference]: Finished difference. Result has 675 places, 691 transitions, 1502 flow [2022-11-20 10:49:46,291 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=675, PETRI_TRANSITIONS=691} [2022-11-20 10:49:46,292 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -45 predicate places. [2022-11-20 10:49:46,292 INFO L495 AbstractCegarLoop]: Abstraction has has 675 places, 691 transitions, 1502 flow [2022-11-20 10:49:46,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:46,293 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:46,293 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:46,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 10:49:46,293 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash 145275696, now seen corresponding path program 1 times [2022-11-20 10:49:46,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:46,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429522543] [2022-11-20 10:49:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:46,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:46,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429522543] [2022-11-20 10:49:46,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429522543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:46,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:46,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:49:46,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731952323] [2022-11-20 10:49:46,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:46,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:46,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:46,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:46,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:46,383 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 777 [2022-11-20 10:49:46,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 691 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:46,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:46,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 777 [2022-11-20 10:49:46,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:48,247 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 237#L63-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 85#L72-5true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,247 INFO L383 tUnfolder$Statistics]: this new event has 355 ancestors and is cut-off event [2022-11-20 10:49:48,247 INFO L386 tUnfolder$Statistics]: existing Event has 262 ancestors and is cut-off event [2022-11-20 10:49:48,247 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-20 10:49:48,248 INFO L386 tUnfolder$Statistics]: existing Event has 355 ancestors and is cut-off event [2022-11-20 10:49:48,332 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 85#L72-5true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,332 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-20 10:49:48,333 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:49:48,333 INFO L386 tUnfolder$Statistics]: existing Event has 370 ancestors and is cut-off event [2022-11-20 10:49:48,333 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-20 10:49:48,390 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 85#L72-5true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,390 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-20 10:49:48,390 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:49:48,390 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-20 10:49:48,390 INFO L386 tUnfolder$Statistics]: existing Event has 367 ancestors and is cut-off event [2022-11-20 10:49:48,390 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [543#L56-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 85#L72-5true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,390 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-20 10:49:48,391 INFO L386 tUnfolder$Statistics]: existing Event has 367 ancestors and is cut-off event [2022-11-20 10:49:48,391 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:49:48,391 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-20 10:49:48,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 237#L63-9true, 586#L85-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,546 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-20 10:49:48,546 INFO L386 tUnfolder$Statistics]: existing Event has 291 ancestors and is cut-off event [2022-11-20 10:49:48,546 INFO L386 tUnfolder$Statistics]: existing Event has 295 ancestors and is cut-off event [2022-11-20 10:49:48,547 INFO L386 tUnfolder$Statistics]: existing Event has 384 ancestors and is cut-off event [2022-11-20 10:49:48,609 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 586#L85-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,609 INFO L383 tUnfolder$Statistics]: this new event has 399 ancestors and is cut-off event [2022-11-20 10:49:48,609 INFO L386 tUnfolder$Statistics]: existing Event has 399 ancestors and is cut-off event [2022-11-20 10:49:48,609 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-20 10:49:48,610 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-20 10:49:48,658 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 237#L63-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 409#L77-5true, 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,658 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-20 10:49:48,659 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-20 10:49:48,659 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-20 10:49:48,659 INFO L386 tUnfolder$Statistics]: existing Event has 396 ancestors and is cut-off event [2022-11-20 10:49:48,659 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [523#L77-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 237#L63-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,660 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-20 10:49:48,660 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-20 10:49:48,660 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-20 10:49:48,660 INFO L386 tUnfolder$Statistics]: existing Event has 396 ancestors and is cut-off event [2022-11-20 10:49:48,662 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 586#L85-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,663 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-20 10:49:48,663 INFO L386 tUnfolder$Statistics]: existing Event has 396 ancestors and is cut-off event [2022-11-20 10:49:48,663 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-20 10:49:48,663 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-20 10:49:48,664 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 543#L56-7true, Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 586#L85-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,664 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-20 10:49:48,664 INFO L386 tUnfolder$Statistics]: existing Event has 396 ancestors and is cut-off event [2022-11-20 10:49:48,664 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-20 10:49:48,664 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-20 10:49:48,751 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 409#L77-5true, 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,752 INFO L383 tUnfolder$Statistics]: this new event has 411 ancestors and is cut-off event [2022-11-20 10:49:48,752 INFO L386 tUnfolder$Statistics]: existing Event has 318 ancestors and is cut-off event [2022-11-20 10:49:48,752 INFO L386 tUnfolder$Statistics]: existing Event has 411 ancestors and is cut-off event [2022-11-20 10:49:48,752 INFO L386 tUnfolder$Statistics]: existing Event has 322 ancestors and is cut-off event [2022-11-20 10:49:48,753 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [523#L77-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,753 INFO L383 tUnfolder$Statistics]: this new event has 411 ancestors and is cut-off event [2022-11-20 10:49:48,753 INFO L386 tUnfolder$Statistics]: existing Event has 318 ancestors and is cut-off event [2022-11-20 10:49:48,753 INFO L386 tUnfolder$Statistics]: existing Event has 322 ancestors and is cut-off event [2022-11-20 10:49:48,753 INFO L386 tUnfolder$Statistics]: existing Event has 411 ancestors and is cut-off event [2022-11-20 10:49:48,794 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, 109#L78-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 237#L63-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,794 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,794 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-20 10:49:48,794 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 10:49:48,794 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,795 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1844] L63-8-->L63-9: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~name_1~0_9) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_1| v_~name_2~0_7)) InVars {~name_2~0=v_~name_2~0_7, ~name_1~0=v_~name_1~0_9} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~name_2~0=v_~name_2~0_7, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|, ~name_1~0=v_~name_1~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1][377], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 237#L63-9true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 601#L78-7true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,795 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,795 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-20 10:49:48,795 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 10:49:48,795 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,796 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 409#L77-5true, 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,796 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,796 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-20 10:49:48,796 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,796 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 10:49:48,797 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [543#L56-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 409#L77-5true, 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,797 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,797 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-20 10:49:48,797 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,797 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 10:49:48,798 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [523#L77-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,798 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,798 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 10:49:48,798 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-20 10:49:48,799 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,799 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [523#L77-7true, 543#L56-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,799 INFO L383 tUnfolder$Statistics]: this new event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,799 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 10:49:48,799 INFO L386 tUnfolder$Statistics]: existing Event has 319 ancestors and is cut-off event [2022-11-20 10:49:48,799 INFO L386 tUnfolder$Statistics]: existing Event has 408 ancestors and is cut-off event [2022-11-20 10:49:48,849 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, 109#L78-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,849 INFO L383 tUnfolder$Statistics]: this new event has 423 ancestors and is cut-off event [2022-11-20 10:49:48,849 INFO L386 tUnfolder$Statistics]: existing Event has 334 ancestors and is cut-off event [2022-11-20 10:49:48,849 INFO L386 tUnfolder$Statistics]: existing Event has 330 ancestors and is cut-off event [2022-11-20 10:49:48,849 INFO L386 tUnfolder$Statistics]: existing Event has 423 ancestors and is cut-off event [2022-11-20 10:49:48,850 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][448], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 688#L109-7true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 601#L78-7true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,850 INFO L383 tUnfolder$Statistics]: this new event has 423 ancestors and is cut-off event [2022-11-20 10:49:48,850 INFO L386 tUnfolder$Statistics]: existing Event has 334 ancestors and is cut-off event [2022-11-20 10:49:48,850 INFO L386 tUnfolder$Statistics]: existing Event has 330 ancestors and is cut-off event [2022-11-20 10:49:48,850 INFO L386 tUnfolder$Statistics]: existing Event has 423 ancestors and is cut-off event [2022-11-20 10:49:48,888 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, 109#L78-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,889 INFO L383 tUnfolder$Statistics]: this new event has 420 ancestors and is cut-off event [2022-11-20 10:49:48,889 INFO L386 tUnfolder$Statistics]: existing Event has 331 ancestors and is cut-off event [2022-11-20 10:49:48,889 INFO L386 tUnfolder$Statistics]: existing Event has 327 ancestors and is cut-off event [2022-11-20 10:49:48,889 INFO L386 tUnfolder$Statistics]: existing Event has 420 ancestors and is cut-off event [2022-11-20 10:49:48,889 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [543#L56-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, 109#L78-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,889 INFO L383 tUnfolder$Statistics]: this new event has 420 ancestors and is cut-off event [2022-11-20 10:49:48,889 INFO L386 tUnfolder$Statistics]: existing Event has 331 ancestors and is cut-off event [2022-11-20 10:49:48,889 INFO L386 tUnfolder$Statistics]: existing Event has 327 ancestors and is cut-off event [2022-11-20 10:49:48,890 INFO L386 tUnfolder$Statistics]: existing Event has 420 ancestors and is cut-off event [2022-11-20 10:49:48,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1885] L56-4-->L56-5: Formula: (= v_~name_1~0_5 v_~current_5~0_2) InVars {~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} OutVars{~current_5~0=v_~current_5~0_2, ~name_1~0=v_~name_1~0_5} AuxVars[] AssignedVars[][457], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 573#L56-5true, 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 601#L78-7true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,890 INFO L383 tUnfolder$Statistics]: this new event has 420 ancestors and is cut-off event [2022-11-20 10:49:48,891 INFO L386 tUnfolder$Statistics]: existing Event has 331 ancestors and is cut-off event [2022-11-20 10:49:48,891 INFO L386 tUnfolder$Statistics]: existing Event has 327 ancestors and is cut-off event [2022-11-20 10:49:48,891 INFO L386 tUnfolder$Statistics]: existing Event has 420 ancestors and is cut-off event [2022-11-20 10:49:48,891 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1886] L56-4-->L56-7: Formula: (not (= v_~name_1~0_6 v_~current_5~0_3)) InVars {~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} OutVars{~current_5~0=v_~current_5~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[][458], [543#L56-7true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1837#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 601#L78-7true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:49:48,891 INFO L383 tUnfolder$Statistics]: this new event has 420 ancestors and is cut-off event [2022-11-20 10:49:48,891 INFO L386 tUnfolder$Statistics]: existing Event has 331 ancestors and is cut-off event [2022-11-20 10:49:48,891 INFO L386 tUnfolder$Statistics]: existing Event has 327 ancestors and is cut-off event [2022-11-20 10:49:48,892 INFO L386 tUnfolder$Statistics]: existing Event has 420 ancestors and is cut-off event [2022-11-20 10:49:49,059 INFO L130 PetriNetUnfolder]: 755/10486 cut-off events. [2022-11-20 10:49:49,059 INFO L131 PetriNetUnfolder]: For 78/79 co-relation queries the response was YES. [2022-11-20 10:49:49,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11690 conditions, 10486 events. 755/10486 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 102899 event pairs, 130 based on Foata normal form. 0/8654 useless extension candidates. Maximal degree in co-relation 11495. Up to 415 conditions per place. [2022-11-20 10:49:49,205 INFO L137 encePairwiseOnDemand]: 769/777 looper letters, 45 selfloop transitions, 4 changer transitions 0/711 dead transitions. [2022-11-20 10:49:49,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 711 transitions, 1642 flow [2022-11-20 10:49:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2022-11-20 10:49:49,208 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9648219648219648 [2022-11-20 10:49:49,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2249 transitions. [2022-11-20 10:49:49,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2249 transitions. [2022-11-20 10:49:49,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:49,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2249 transitions. [2022-11-20 10:49:49,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:49,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:49,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:49,215 INFO L175 Difference]: Start difference. First operand has 675 places, 691 transitions, 1502 flow. Second operand 3 states and 2249 transitions. [2022-11-20 10:49:49,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 711 transitions, 1642 flow [2022-11-20 10:49:49,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 711 transitions, 1636 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:49,230 INFO L231 Difference]: Finished difference. Result has 677 places, 695 transitions, 1536 flow [2022-11-20 10:49:49,231 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1536, PETRI_PLACES=677, PETRI_TRANSITIONS=695} [2022-11-20 10:49:49,231 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -43 predicate places. [2022-11-20 10:49:49,231 INFO L495 AbstractCegarLoop]: Abstraction has has 677 places, 695 transitions, 1536 flow [2022-11-20 10:49:49,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:49,232 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:49,233 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:49,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 10:49:49,233 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:49,234 INFO L85 PathProgramCache]: Analyzing trace with hash -697739698, now seen corresponding path program 1 times [2022-11-20 10:49:49,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:49,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696839843] [2022-11-20 10:49:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:49,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:49,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:49,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696839843] [2022-11-20 10:49:49,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696839843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:49,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:49,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:49,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731385925] [2022-11-20 10:49:49,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:49,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:49,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:49,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:49,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:49,321 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 719 out of 777 [2022-11-20 10:49:49,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 695 transitions, 1536 flow. Second operand has 3 states, 3 states have (on average 721.3333333333334) internal successors, (2164), 3 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:49,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:49,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 719 of 777 [2022-11-20 10:49:49,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:50,781 INFO L130 PetriNetUnfolder]: 291/5679 cut-off events. [2022-11-20 10:49:50,782 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-20 10:49:50,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6383 conditions, 5679 events. 291/5679 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 53706 event pairs, 26 based on Foata normal form. 0/4852 useless extension candidates. Maximal degree in co-relation 6189. Up to 172 conditions per place. [2022-11-20 10:49:50,876 INFO L137 encePairwiseOnDemand]: 760/777 looper letters, 28 selfloop transitions, 9 changer transitions 0/692 dead transitions. [2022-11-20 10:49:50,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 692 transitions, 1605 flow [2022-11-20 10:49:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2202 transitions. [2022-11-20 10:49:50,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9446589446589446 [2022-11-20 10:49:50,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2202 transitions. [2022-11-20 10:49:50,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2202 transitions. [2022-11-20 10:49:50,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:50,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2202 transitions. [2022-11-20 10:49:50,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 734.0) internal successors, (2202), 3 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:50,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:50,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:50,890 INFO L175 Difference]: Start difference. First operand has 677 places, 695 transitions, 1536 flow. Second operand 3 states and 2202 transitions. [2022-11-20 10:49:50,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 671 places, 692 transitions, 1605 flow [2022-11-20 10:49:50,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 692 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 10:49:50,903 INFO L231 Difference]: Finished difference. Result has 672 places, 691 transitions, 1568 flow [2022-11-20 10:49:50,903 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=668, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1568, PETRI_PLACES=672, PETRI_TRANSITIONS=691} [2022-11-20 10:49:50,904 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -48 predicate places. [2022-11-20 10:49:50,904 INFO L495 AbstractCegarLoop]: Abstraction has has 672 places, 691 transitions, 1568 flow [2022-11-20 10:49:50,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 721.3333333333334) internal successors, (2164), 3 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:50,905 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:50,905 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:50,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 10:49:50,906 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1446602599, now seen corresponding path program 1 times [2022-11-20 10:49:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:50,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602892380] [2022-11-20 10:49:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:50,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:50,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:50,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602892380] [2022-11-20 10:49:50,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602892380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:50,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:50,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:50,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511909569] [2022-11-20 10:49:50,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:50,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:50,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:50,979 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-20 10:49:50,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 691 transitions, 1568 flow. Second operand has 3 states, 3 states have (on average 719.6666666666666) internal successors, (2159), 3 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:50,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:50,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-20 10:49:50,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:52,191 INFO L130 PetriNetUnfolder]: 293/5673 cut-off events. [2022-11-20 10:49:52,191 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-11-20 10:49:52,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 5673 events. 293/5673 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 53653 event pairs, 54 based on Foata normal form. 0/4836 useless extension candidates. Maximal degree in co-relation 6351. Up to 271 conditions per place. [2022-11-20 10:49:52,272 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 35 selfloop transitions, 3 changer transitions 0/691 dead transitions. [2022-11-20 10:49:52,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 691 transitions, 1645 flow [2022-11-20 10:49:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2186 transitions. [2022-11-20 10:49:52,275 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9377949377949378 [2022-11-20 10:49:52,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2186 transitions. [2022-11-20 10:49:52,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2186 transitions. [2022-11-20 10:49:52,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:52,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2186 transitions. [2022-11-20 10:49:52,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 728.6666666666666) internal successors, (2186), 3 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:52,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:52,278 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:52,278 INFO L175 Difference]: Start difference. First operand has 672 places, 691 transitions, 1568 flow. Second operand 3 states and 2186 transitions. [2022-11-20 10:49:52,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 691 transitions, 1645 flow [2022-11-20 10:49:52,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 691 transitions, 1627 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:52,291 INFO L231 Difference]: Finished difference. Result has 671 places, 690 transitions, 1554 flow [2022-11-20 10:49:52,292 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=671, PETRI_TRANSITIONS=690} [2022-11-20 10:49:52,292 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -49 predicate places. [2022-11-20 10:49:52,292 INFO L495 AbstractCegarLoop]: Abstraction has has 671 places, 690 transitions, 1554 flow [2022-11-20 10:49:52,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 719.6666666666666) internal successors, (2159), 3 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:52,293 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:52,293 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:52,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 10:49:52,294 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:52,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:52,294 INFO L85 PathProgramCache]: Analyzing trace with hash 177630031, now seen corresponding path program 1 times [2022-11-20 10:49:52,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:52,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471211472] [2022-11-20 10:49:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:52,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:52,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:52,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471211472] [2022-11-20 10:49:52,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471211472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:52,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:52,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857914059] [2022-11-20 10:49:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:52,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:52,363 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 719 out of 777 [2022-11-20 10:49:52,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 690 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 721.6666666666666) internal successors, (2165), 3 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:52,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:52,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 719 of 777 [2022-11-20 10:49:52,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:53,770 INFO L130 PetriNetUnfolder]: 344/5844 cut-off events. [2022-11-20 10:49:53,770 INFO L131 PetriNetUnfolder]: For 116/118 co-relation queries the response was YES. [2022-11-20 10:49:53,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 5844 events. 344/5844 cut-off events. For 116/118 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 57323 event pairs, 30 based on Foata normal form. 0/5011 useless extension candidates. Maximal degree in co-relation 6542. Up to 262 conditions per place. [2022-11-20 10:49:53,875 INFO L137 encePairwiseOnDemand]: 760/777 looper letters, 28 selfloop transitions, 9 changer transitions 0/687 dead transitions. [2022-11-20 10:49:53,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 687 transitions, 1623 flow [2022-11-20 10:49:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2202 transitions. [2022-11-20 10:49:53,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9446589446589446 [2022-11-20 10:49:53,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2202 transitions. [2022-11-20 10:49:53,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2202 transitions. [2022-11-20 10:49:53,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:53,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2202 transitions. [2022-11-20 10:49:53,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 734.0) internal successors, (2202), 3 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:53,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:53,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:53,884 INFO L175 Difference]: Start difference. First operand has 671 places, 690 transitions, 1554 flow. Second operand 3 states and 2202 transitions. [2022-11-20 10:49:53,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 665 places, 687 transitions, 1623 flow [2022-11-20 10:49:53,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 687 transitions, 1617 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:53,897 INFO L231 Difference]: Finished difference. Result has 665 places, 686 transitions, 1584 flow [2022-11-20 10:49:53,898 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=661, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=665, PETRI_TRANSITIONS=686} [2022-11-20 10:49:53,899 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -55 predicate places. [2022-11-20 10:49:53,899 INFO L495 AbstractCegarLoop]: Abstraction has has 665 places, 686 transitions, 1584 flow [2022-11-20 10:49:53,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 721.6666666666666) internal successors, (2165), 3 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:53,900 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:53,900 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:53,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-20 10:49:53,900 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:53,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2006597985, now seen corresponding path program 1 times [2022-11-20 10:49:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:53,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121371783] [2022-11-20 10:49:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:53,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:53,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:53,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121371783] [2022-11-20 10:49:53,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121371783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:53,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:53,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:53,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261688878] [2022-11-20 10:49:53,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:53,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:53,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:53,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:53,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:53,968 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 777 [2022-11-20 10:49:53,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 686 transitions, 1584 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:53,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:53,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 777 [2022-11-20 10:49:53,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:55,313 INFO L130 PetriNetUnfolder]: 268/5737 cut-off events. [2022-11-20 10:49:55,313 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-11-20 10:49:55,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6565 conditions, 5737 events. 268/5737 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 55105 event pairs, 14 based on Foata normal form. 0/4983 useless extension candidates. Maximal degree in co-relation 6369. Up to 106 conditions per place. [2022-11-20 10:49:55,437 INFO L137 encePairwiseOnDemand]: 770/777 looper letters, 16 selfloop transitions, 3 changer transitions 0/683 dead transitions. [2022-11-20 10:49:55,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 683 transitions, 1617 flow [2022-11-20 10:49:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2022-11-20 10:49:55,440 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9583869583869584 [2022-11-20 10:49:55,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2234 transitions. [2022-11-20 10:49:55,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2234 transitions. [2022-11-20 10:49:55,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:55,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2234 transitions. [2022-11-20 10:49:55,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.6666666666666) internal successors, (2234), 3 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:55,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:55,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:55,446 INFO L175 Difference]: Start difference. First operand has 665 places, 686 transitions, 1584 flow. Second operand 3 states and 2234 transitions. [2022-11-20 10:49:55,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 683 transitions, 1617 flow [2022-11-20 10:49:55,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 683 transitions, 1599 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:55,461 INFO L231 Difference]: Finished difference. Result has 661 places, 682 transitions, 1564 flow [2022-11-20 10:49:55,462 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1564, PETRI_PLACES=661, PETRI_TRANSITIONS=682} [2022-11-20 10:49:55,463 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -59 predicate places. [2022-11-20 10:49:55,463 INFO L495 AbstractCegarLoop]: Abstraction has has 661 places, 682 transitions, 1564 flow [2022-11-20 10:49:55,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:55,464 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:55,464 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:55,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-20 10:49:55,465 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:55,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:55,465 INFO L85 PathProgramCache]: Analyzing trace with hash -79944502, now seen corresponding path program 1 times [2022-11-20 10:49:55,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:55,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343905605] [2022-11-20 10:49:55,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:55,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:55,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343905605] [2022-11-20 10:49:55,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343905605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:55,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:55,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280917052] [2022-11-20 10:49:55,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:55,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:55,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:55,566 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-20 10:49:55,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 682 transitions, 1564 flow. Second operand has 3 states, 3 states have (on average 720.0) internal successors, (2160), 3 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:55,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:55,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-20 10:49:55,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:56,933 INFO L130 PetriNetUnfolder]: 348/5806 cut-off events. [2022-11-20 10:49:56,934 INFO L131 PetriNetUnfolder]: For 239/241 co-relation queries the response was YES. [2022-11-20 10:49:57,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6861 conditions, 5806 events. 348/5806 cut-off events. For 239/241 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 57062 event pairs, 61 based on Foata normal form. 0/5013 useless extension candidates. Maximal degree in co-relation 6665. Up to 424 conditions per place. [2022-11-20 10:49:57,044 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 35 selfloop transitions, 3 changer transitions 0/682 dead transitions. [2022-11-20 10:49:57,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 682 transitions, 1641 flow [2022-11-20 10:49:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2186 transitions. [2022-11-20 10:49:57,047 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9377949377949378 [2022-11-20 10:49:57,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2186 transitions. [2022-11-20 10:49:57,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2186 transitions. [2022-11-20 10:49:57,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:57,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2186 transitions. [2022-11-20 10:49:57,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 728.6666666666666) internal successors, (2186), 3 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:57,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:57,054 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:57,054 INFO L175 Difference]: Start difference. First operand has 661 places, 682 transitions, 1564 flow. Second operand 3 states and 2186 transitions. [2022-11-20 10:49:57,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 682 transitions, 1641 flow [2022-11-20 10:49:57,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 682 transitions, 1635 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:57,068 INFO L231 Difference]: Finished difference. Result has 660 places, 681 transitions, 1562 flow [2022-11-20 10:49:57,069 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1562, PETRI_PLACES=660, PETRI_TRANSITIONS=681} [2022-11-20 10:49:57,069 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -60 predicate places. [2022-11-20 10:49:57,070 INFO L495 AbstractCegarLoop]: Abstraction has has 660 places, 681 transitions, 1562 flow [2022-11-20 10:49:57,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 720.0) internal successors, (2160), 3 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:57,070 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:57,071 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:57,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 10:49:57,071 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:57,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash 149805970, now seen corresponding path program 1 times [2022-11-20 10:49:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:57,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030292495] [2022-11-20 10:49:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:57,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:57,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030292495] [2022-11-20 10:49:57,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030292495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:57,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:57,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:57,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392896377] [2022-11-20 10:49:57,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:57,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:57,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:57,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:57,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:57,186 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 777 [2022-11-20 10:49:57,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 681 transitions, 1562 flow. Second operand has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:57,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:57,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 777 [2022-11-20 10:49:57,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:49:58,386 INFO L130 PetriNetUnfolder]: 301/5704 cut-off events. [2022-11-20 10:49:58,386 INFO L131 PetriNetUnfolder]: For 78/80 co-relation queries the response was YES. [2022-11-20 10:49:58,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6537 conditions, 5704 events. 301/5704 cut-off events. For 78/80 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 54104 event pairs, 18 based on Foata normal form. 0/4989 useless extension candidates. Maximal degree in co-relation 6341. Up to 162 conditions per place. [2022-11-20 10:49:58,471 INFO L137 encePairwiseOnDemand]: 770/777 looper letters, 16 selfloop transitions, 3 changer transitions 0/678 dead transitions. [2022-11-20 10:49:58,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 678 transitions, 1595 flow [2022-11-20 10:49:58,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:49:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:49:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2022-11-20 10:49:58,473 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9583869583869584 [2022-11-20 10:49:58,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2234 transitions. [2022-11-20 10:49:58,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2234 transitions. [2022-11-20 10:49:58,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:49:58,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2234 transitions. [2022-11-20 10:49:58,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 744.6666666666666) internal successors, (2234), 3 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:58,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:58,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:58,479 INFO L175 Difference]: Start difference. First operand has 660 places, 681 transitions, 1562 flow. Second operand 3 states and 2234 transitions. [2022-11-20 10:49:58,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 678 transitions, 1595 flow [2022-11-20 10:49:58,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 678 transitions, 1589 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:49:58,491 INFO L231 Difference]: Finished difference. Result has 656 places, 677 transitions, 1554 flow [2022-11-20 10:49:58,492 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1554, PETRI_PLACES=656, PETRI_TRANSITIONS=677} [2022-11-20 10:49:58,492 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -64 predicate places. [2022-11-20 10:49:58,493 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 677 transitions, 1554 flow [2022-11-20 10:49:58,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:58,493 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:49:58,494 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:58,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-20 10:49:58,494 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:49:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash 245192492, now seen corresponding path program 1 times [2022-11-20 10:49:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:58,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850853391] [2022-11-20 10:49:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:49:58,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:58,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850853391] [2022-11-20 10:49:58,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850853391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:58,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:49:58,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:49:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128530687] [2022-11-20 10:49:58,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:58,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:49:58,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:58,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:49:58,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:49:58,564 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 777 [2022-11-20 10:49:58,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 677 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 750.6666666666666) internal successors, (2252), 3 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:49:58,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:49:58,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 777 [2022-11-20 10:49:58,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:50:00,663 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 625#L76-2true, Black: 1841#true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,664 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-20 10:50:00,664 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-20 10:50:00,664 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-20 10:50:00,664 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-20 10:50:00,665 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,665 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-20 10:50:00,665 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-20 10:50:00,665 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:00,665 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:00,671 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,671 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-20 10:50:00,672 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:00,672 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:00,672 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-20 10:50:00,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), 413#L55-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,696 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-20 10:50:00,696 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-20 10:50:00,696 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-20 10:50:00,696 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-20 10:50:00,740 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 625#L76-2true, Black: 1841#true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,741 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-20 10:50:00,741 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:00,741 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:00,741 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:00,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,741 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:00,742 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:00,742 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:00,742 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:00,743 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 625#L76-2true, Black: 1841#true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,743 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-20 10:50:00,744 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:00,744 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:00,744 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:00,744 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,744 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:00,744 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:00,745 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:00,745 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:00,750 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,750 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:00,750 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:00,750 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:00,750 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:00,753 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,753 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:00,754 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:00,754 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:00,754 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:00,771 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), 413#L55-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,771 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-20 10:50:00,771 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:00,771 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:00,772 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:00,774 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, 413#L55-2true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,774 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-20 10:50:00,774 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:00,774 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:00,774 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:00,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, 625#L76-2true, Black: 1841#true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,809 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-20 10:50:00,809 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-20 10:50:00,809 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-20 10:50:00,809 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:00,809 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,810 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-20 10:50:00,810 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:00,810 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:00,810 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:00,815 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,815 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-20 10:50:00,815 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:00,815 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:00,815 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:00,829 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, 413#L55-2true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,829 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-20 10:50:00,829 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-20 10:50:00,829 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-20 10:50:00,829 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:00,917 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][518], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1841#true, 625#L76-2true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,917 INFO L383 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2022-11-20 10:50:00,917 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-20 10:50:00,917 INFO L386 tUnfolder$Statistics]: existing Event has 303 ancestors and is cut-off event [2022-11-20 10:50:00,918 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-20 10:50:00,918 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][518], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,918 INFO L383 tUnfolder$Statistics]: this new event has 386 ancestors and is cut-off event [2022-11-20 10:50:00,918 INFO L386 tUnfolder$Statistics]: existing Event has 298 ancestors and is cut-off event [2022-11-20 10:50:00,918 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-20 10:50:00,918 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-20 10:50:00,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][518], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 625#L76-2true, Black: 1841#true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,942 INFO L383 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-11-20 10:50:00,942 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-20 10:50:00,942 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-20 10:50:00,943 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-20 10:50:00,943 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2274] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem79#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem79#1=|v_ULTIMATE.start_main_#t~mem79#1_5|} AuxVars[] AssignedVars[][518], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,943 INFO L383 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-11-20 10:50:00,943 INFO L386 tUnfolder$Statistics]: existing Event has 301 ancestors and is cut-off event [2022-11-20 10:50:00,943 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 10:50:00,943 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 10:50:00,972 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1841#true, 389#L76-1true, 1873#(= |#race~i_8~0| 0), 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,972 INFO L383 tUnfolder$Statistics]: this new event has 386 ancestors and is cut-off event [2022-11-20 10:50:00,972 INFO L386 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-11-20 10:50:00,972 INFO L386 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2022-11-20 10:50:00,973 INFO L386 tUnfolder$Statistics]: existing Event has 386 ancestors and is cut-off event [2022-11-20 10:50:00,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1857#true, 688#L109-7true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1841#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 1873#(= |#race~i_8~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:00,991 INFO L383 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2022-11-20 10:50:00,991 INFO L386 tUnfolder$Statistics]: existing Event has 393 ancestors and is cut-off event [2022-11-20 10:50:00,992 INFO L386 tUnfolder$Statistics]: existing Event has 393 ancestors and is cut-off event [2022-11-20 10:50:00,992 INFO L386 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2022-11-20 10:50:01,060 INFO L130 PetriNetUnfolder]: 565/10690 cut-off events. [2022-11-20 10:50:01,060 INFO L131 PetriNetUnfolder]: For 40/42 co-relation queries the response was YES. [2022-11-20 10:50:01,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12023 conditions, 10690 events. 565/10690 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 108517 event pairs, 22 based on Foata normal form. 0/9354 useless extension candidates. Maximal degree in co-relation 11829. Up to 298 conditions per place. [2022-11-20 10:50:01,248 INFO L137 encePairwiseOnDemand]: 773/777 looper letters, 11 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2022-11-20 10:50:01,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 679 transitions, 1586 flow [2022-11-20 10:50:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:50:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:50:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2262 transitions. [2022-11-20 10:50:01,251 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9703989703989704 [2022-11-20 10:50:01,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2262 transitions. [2022-11-20 10:50:01,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2262 transitions. [2022-11-20 10:50:01,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:50:01,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2262 transitions. [2022-11-20 10:50:01,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:01,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:01,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:01,255 INFO L175 Difference]: Start difference. First operand has 656 places, 677 transitions, 1554 flow. Second operand 3 states and 2262 transitions. [2022-11-20 10:50:01,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 679 transitions, 1586 flow [2022-11-20 10:50:01,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 679 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:50:01,268 INFO L231 Difference]: Finished difference. Result has 655 places, 677 transitions, 1558 flow [2022-11-20 10:50:01,269 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1558, PETRI_PLACES=655, PETRI_TRANSITIONS=677} [2022-11-20 10:50:01,270 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -65 predicate places. [2022-11-20 10:50:01,270 INFO L495 AbstractCegarLoop]: Abstraction has has 655 places, 677 transitions, 1558 flow [2022-11-20 10:50:01,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 750.6666666666666) internal successors, (2252), 3 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:01,271 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:50:01,271 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:50:01,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-20 10:50:01,271 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:50:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:50:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1886329524, now seen corresponding path program 1 times [2022-11-20 10:50:01,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:50:01,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747473810] [2022-11-20 10:50:01,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:50:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:50:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:50:01,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:50:01,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747473810] [2022-11-20 10:50:01,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747473810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:50:01,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:50:01,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:50:01,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682473880] [2022-11-20 10:50:01,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:50:01,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:50:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:50:01,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:50:01,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:50:01,347 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 723 out of 777 [2022-11-20 10:50:01,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 677 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 726.3333333333334) internal successors, (2179), 3 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:01,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:50:01,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 723 of 777 [2022-11-20 10:50:01,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:50:03,218 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][511], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:03,218 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-20 10:50:03,218 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:03,218 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-20 10:50:03,219 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:03,219 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][511], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:03,219 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:03,219 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:03,219 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:03,219 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:03,271 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][511], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:03,271 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:03,271 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:03,271 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:03,271 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:03,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][511], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:03,272 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-20 10:50:03,272 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:03,272 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:03,272 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:03,501 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1859#(= |#race~break_10~0| 0), 1880#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:03,501 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-20 10:50:03,501 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-20 10:50:03,502 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:03,502 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:03,531 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:03,531 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:03,531 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:03,531 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:03,531 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:03,532 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:03,532 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:03,533 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:03,533 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:03,533 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:03,564 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [620#L55-1true, 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 1880#true, Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:03,565 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-20 10:50:03,565 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:03,565 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:03,565 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:03,677 INFO L130 PetriNetUnfolder]: 505/10323 cut-off events. [2022-11-20 10:50:03,677 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-11-20 10:50:03,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11931 conditions, 10323 events. 505/10323 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 106192 event pairs, 64 based on Foata normal form. 0/9124 useless extension candidates. Maximal degree in co-relation 11735. Up to 375 conditions per place. [2022-11-20 10:50:03,853 INFO L137 encePairwiseOnDemand]: 774/777 looper letters, 27 selfloop transitions, 3 changer transitions 0/677 dead transitions. [2022-11-20 10:50:03,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 677 transitions, 1619 flow [2022-11-20 10:50:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:50:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 10:50:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2196 transitions. [2022-11-20 10:50:03,856 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9420849420849421 [2022-11-20 10:50:03,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2196 transitions. [2022-11-20 10:50:03,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2196 transitions. [2022-11-20 10:50:03,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:50:03,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2196 transitions. [2022-11-20 10:50:03,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 732.0) internal successors, (2196), 3 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:03,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:03,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 777.0) internal successors, (3108), 4 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:03,860 INFO L175 Difference]: Start difference. First operand has 655 places, 677 transitions, 1558 flow. Second operand 3 states and 2196 transitions. [2022-11-20 10:50:03,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 677 transitions, 1619 flow [2022-11-20 10:50:03,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 677 transitions, 1619 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:50:03,873 INFO L231 Difference]: Finished difference. Result has 656 places, 676 transitions, 1562 flow [2022-11-20 10:50:03,874 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1562, PETRI_PLACES=656, PETRI_TRANSITIONS=676} [2022-11-20 10:50:03,875 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -64 predicate places. [2022-11-20 10:50:03,875 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 676 transitions, 1562 flow [2022-11-20 10:50:03,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 726.3333333333334) internal successors, (2179), 3 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:03,876 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:50:03,876 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:50:03,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-20 10:50:03,876 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:50:03,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:50:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash 965451389, now seen corresponding path program 1 times [2022-11-20 10:50:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:50:03,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486088681] [2022-11-20 10:50:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:50:03,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:50:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:50:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:50:04,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486088681] [2022-11-20 10:50:04,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486088681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:50:04,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:50:04,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:50:04,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926692208] [2022-11-20 10:50:04,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:50:04,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:50:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:50:04,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:50:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:50:04,031 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 777 [2022-11-20 10:50:04,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 676 transitions, 1562 flow. Second operand has 4 states, 4 states have (on average 742.5) internal successors, (2970), 4 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:04,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:50:04,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 777 [2022-11-20 10:50:04,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:50:06,955 INFO L130 PetriNetUnfolder]: 655/13733 cut-off events. [2022-11-20 10:50:06,955 INFO L131 PetriNetUnfolder]: For 32/34 co-relation queries the response was YES. [2022-11-20 10:50:07,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15635 conditions, 13733 events. 655/13733 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 142944 event pairs, 42 based on Foata normal form. 0/12139 useless extension candidates. Maximal degree in co-relation 15438. Up to 287 conditions per place. [2022-11-20 10:50:07,175 INFO L137 encePairwiseOnDemand]: 769/777 looper letters, 33 selfloop transitions, 8 changer transitions 0/695 dead transitions. [2022-11-20 10:50:07,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 695 transitions, 1686 flow [2022-11-20 10:50:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:50:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 10:50:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3737 transitions. [2022-11-20 10:50:07,179 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9619047619047619 [2022-11-20 10:50:07,179 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3737 transitions. [2022-11-20 10:50:07,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3737 transitions. [2022-11-20 10:50:07,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:50:07,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3737 transitions. [2022-11-20 10:50:07,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 747.4) internal successors, (3737), 5 states have internal predecessors, (3737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:07,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 777.0) internal successors, (4662), 6 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:07,185 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 777.0) internal successors, (4662), 6 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:07,185 INFO L175 Difference]: Start difference. First operand has 656 places, 676 transitions, 1562 flow. Second operand 5 states and 3737 transitions. [2022-11-20 10:50:07,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 695 transitions, 1686 flow [2022-11-20 10:50:07,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 695 transitions, 1680 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 10:50:07,198 INFO L231 Difference]: Finished difference. Result has 661 places, 680 transitions, 1602 flow [2022-11-20 10:50:07,199 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=777, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1602, PETRI_PLACES=661, PETRI_TRANSITIONS=680} [2022-11-20 10:50:07,200 INFO L288 CegarLoopForPetriNet]: 720 programPoint places, -59 predicate places. [2022-11-20 10:50:07,200 INFO L495 AbstractCegarLoop]: Abstraction has has 661 places, 680 transitions, 1602 flow [2022-11-20 10:50:07,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 742.5) internal successors, (2970), 4 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:07,201 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:50:07,201 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:50:07,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-20 10:50:07,201 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2022-11-20 10:50:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:50:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash 262304863, now seen corresponding path program 1 times [2022-11-20 10:50:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:50:07,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535755080] [2022-11-20 10:50:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:50:07,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:50:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:50:07,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:50:07,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535755080] [2022-11-20 10:50:07,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535755080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:50:07,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:50:07,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:50:07,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997083223] [2022-11-20 10:50:07,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:50:07,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:50:07,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:50:07,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:50:07,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:50:07,830 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 717 out of 777 [2022-11-20 10:50:07,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 680 transitions, 1602 flow. Second operand has 6 states, 6 states have (on average 720.0) internal successors, (4320), 6 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:07,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:50:07,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 717 of 777 [2022-11-20 10:50:07,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:50:21,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:21,942 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:21,942 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:21,942 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:21,942 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:22,545 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, 506#L108-4true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:22,545 INFO L383 tUnfolder$Statistics]: this new event has 358 ancestors and is cut-off event [2022-11-20 10:50:22,546 INFO L386 tUnfolder$Statistics]: existing Event has 270 ancestors and is cut-off event [2022-11-20 10:50:22,546 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-20 10:50:22,546 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-20 10:50:22,550 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, Black: 1875#true, 444#L54-3true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:22,550 INFO L383 tUnfolder$Statistics]: this new event has 358 ancestors and is cut-off event [2022-11-20 10:50:22,550 INFO L386 tUnfolder$Statistics]: existing Event has 270 ancestors and is cut-off event [2022-11-20 10:50:22,550 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-20 10:50:22,550 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-20 10:50:22,551 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:22,551 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-20 10:50:22,551 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:22,551 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:22,551 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:22,661 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:22,662 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-20 10:50:22,662 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:22,662 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-20 10:50:22,662 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-20 10:50:23,141 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, 506#L108-4true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,142 INFO L383 tUnfolder$Statistics]: this new event has 361 ancestors and is cut-off event [2022-11-20 10:50:23,142 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-20 10:50:23,142 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-20 10:50:23,142 INFO L386 tUnfolder$Statistics]: existing Event has 273 ancestors and is cut-off event [2022-11-20 10:50:23,147 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, Black: 1875#true, 444#L54-3true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,148 INFO L383 tUnfolder$Statistics]: this new event has 361 ancestors and is cut-off event [2022-11-20 10:50:23,148 INFO L386 tUnfolder$Statistics]: existing Event has 273 ancestors and is cut-off event [2022-11-20 10:50:23,148 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-20 10:50:23,148 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-20 10:50:23,257 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 140#L62-2true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,257 INFO L383 tUnfolder$Statistics]: this new event has 362 ancestors and is cut-off event [2022-11-20 10:50:23,257 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:23,257 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-20 10:50:23,257 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:23,262 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,262 INFO L383 tUnfolder$Statistics]: this new event has 362 ancestors and is cut-off event [2022-11-20 10:50:23,262 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-20 10:50:23,262 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:23,263 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:23,263 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][533], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,263 INFO L383 tUnfolder$Statistics]: this new event has 373 ancestors and is cut-off event [2022-11-20 10:50:23,263 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-20 10:50:23,263 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:23,263 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-20 10:50:23,372 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), 548#L109-3true, Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,372 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-20 10:50:23,373 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-20 10:50:23,373 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:23,373 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:23,377 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), 548#L109-3true, Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 444#L54-3true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,378 INFO L383 tUnfolder$Statistics]: this new event has 363 ancestors and is cut-off event [2022-11-20 10:50:23,378 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-20 10:50:23,378 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:23,378 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:23,479 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 1816#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 140#L62-2true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,479 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-20 10:50:23,480 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-20 10:50:23,480 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-20 10:50:23,480 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-20 10:50:23,484 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1816#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,485 INFO L383 tUnfolder$Statistics]: this new event has 364 ancestors and is cut-off event [2022-11-20 10:50:23,485 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-20 10:50:23,485 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-20 10:50:23,485 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-20 10:50:23,595 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 371#L109-5true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,595 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-20 10:50:23,595 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:23,595 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:23,595 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-20 10:50:23,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 371#L109-5true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,600 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-20 10:50:23,600 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:23,600 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:23,600 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-20 10:50:23,656 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 140#L62-2true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,656 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-20 10:50:23,656 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:23,656 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:23,657 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-20 10:50:23,662 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1886#(= ~i_4~0 0), Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,662 INFO L383 tUnfolder$Statistics]: this new event has 365 ancestors and is cut-off event [2022-11-20 10:50:23,662 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:23,662 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:23,662 INFO L386 tUnfolder$Statistics]: existing Event has 277 ancestors and is cut-off event [2022-11-20 10:50:23,701 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,701 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:23,701 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:23,701 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:23,702 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:23,705 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,705 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:23,705 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:23,706 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:23,706 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:23,762 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), 548#L109-3true, Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,762 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:23,762 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:23,762 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:23,762 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:23,766 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), 548#L109-3true, Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,766 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:23,766 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:23,766 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:23,767 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:23,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:23,810 INFO L383 tUnfolder$Statistics]: this new event has 366 ancestors and is cut-off event [2022-11-20 10:50:23,810 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:23,810 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:23,810 INFO L386 tUnfolder$Statistics]: existing Event has 278 ancestors and is cut-off event [2022-11-20 10:50:24,044 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1816#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 140#L62-2true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:24,044 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-20 10:50:24,044 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:24,044 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:24,045 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:24,051 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 1816#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:24,051 INFO L383 tUnfolder$Statistics]: this new event has 367 ancestors and is cut-off event [2022-11-20 10:50:24,051 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:24,051 INFO L386 tUnfolder$Statistics]: existing Event has 283 ancestors and is cut-off event [2022-11-20 10:50:24,052 INFO L386 tUnfolder$Statistics]: existing Event has 279 ancestors and is cut-off event [2022-11-20 10:50:24,184 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 371#L109-5true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:24,184 INFO L383 tUnfolder$Statistics]: this new event has 368 ancestors and is cut-off event [2022-11-20 10:50:24,184 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-20 10:50:24,184 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-20 10:50:24,185 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-20 10:50:24,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 444#L54-3true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 371#L109-5true, Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:24,189 INFO L383 tUnfolder$Statistics]: this new event has 368 ancestors and is cut-off event [2022-11-20 10:50:24,189 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-20 10:50:24,189 INFO L386 tUnfolder$Statistics]: existing Event has 280 ancestors and is cut-off event [2022-11-20 10:50:24,189 INFO L386 tUnfolder$Statistics]: existing Event has 284 ancestors and is cut-off event [2022-11-20 10:50:24,313 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 140#L62-2true, Black: 1841#true, Black: 1875#true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:24,313 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-20 10:50:24,313 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:24,313 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:24,313 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:24,318 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1886#(= ~i_4~0 0), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1857#true, 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 444#L54-3true, 165#L109-6true, 1877#(= |#race~nondet_0~0| 0), Black: 1849#(= |#race~break_6~0| 0), Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:24,318 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-20 10:50:24,318 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:24,318 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:24,318 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:24,440 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 1843#(= ~name_2~0 ~name_1~0), Black: 1834#(= |#race~result_7~0| 0), Black: 809#true, Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 811#(= |#race~name_1~0| 0), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 506#L108-4true, Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:24,440 INFO L383 tUnfolder$Statistics]: this new event has 369 ancestors and is cut-off event [2022-11-20 10:50:24,440 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:24,440 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:24,440 INFO L386 tUnfolder$Statistics]: existing Event has 281 ancestors and is cut-off event [2022-11-20 10:50:24,556 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, 389#L76-1true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:24,556 INFO L383 tUnfolder$Statistics]: this new event has 370 ancestors and is cut-off event [2022-11-20 10:50:24,556 INFO L386 tUnfolder$Statistics]: existing Event has 282 ancestors and is cut-off event [2022-11-20 10:50:24,557 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-20 10:50:24,557 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-20 10:50:25,008 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2094] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][528], [620#L55-1true, 1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 389#L76-1true, 1877#(= |#race~nondet_0~0| 0), 539#L109-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:25,009 INFO L383 tUnfolder$Statistics]: this new event has 373 ancestors and is cut-off event [2022-11-20 10:50:25,009 INFO L386 tUnfolder$Statistics]: existing Event has 285 ancestors and is cut-off event [2022-11-20 10:50:25,009 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-20 10:50:25,009 INFO L386 tUnfolder$Statistics]: existing Event has 289 ancestors and is cut-off event [2022-11-20 10:50:28,001 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1859#(= |#race~break_10~0| 0), 688#L109-7true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:28,002 INFO L383 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2022-11-20 10:50:28,002 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-20 10:50:28,002 INFO L386 tUnfolder$Statistics]: existing Event has 302 ancestors and is cut-off event [2022-11-20 10:50:28,002 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-20 10:50:28,777 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 293#L110-3true, 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:28,777 INFO L383 tUnfolder$Statistics]: this new event has 394 ancestors and is cut-off event [2022-11-20 10:50:28,778 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-20 10:50:28,778 INFO L386 tUnfolder$Statistics]: existing Event has 306 ancestors and is cut-off event [2022-11-20 10:50:28,778 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-20 10:50:28,778 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 36#L110-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:28,779 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-20 10:50:28,779 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-20 10:50:28,779 INFO L386 tUnfolder$Statistics]: existing Event has 308 ancestors and is cut-off event [2022-11-20 10:50:28,779 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-20 10:50:28,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 628#ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACEtrue, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:28,780 INFO L383 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-11-20 10:50:28,780 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-20 10:50:28,780 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-20 10:50:28,780 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 10:50:28,780 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 64#L110-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:28,781 INFO L383 tUnfolder$Statistics]: this new event has 393 ancestors and is cut-off event [2022-11-20 10:50:28,781 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 10:50:28,781 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 10:50:28,781 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 10:50:28,781 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 814#true, 1894#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 391#L110-6true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:28,782 INFO L383 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-11-20 10:50:28,782 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-20 10:50:28,782 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-20 10:50:28,782 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 10:50:28,782 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1859#(= |#race~break_10~0| 0), Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 584#L110-4true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:28,783 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-20 10:50:28,783 INFO L386 tUnfolder$Statistics]: existing Event has 307 ancestors and is cut-off event [2022-11-20 10:50:28,783 INFO L386 tUnfolder$Statistics]: existing Event has 311 ancestors and is cut-off event [2022-11-20 10:50:28,783 INFO L386 tUnfolder$Statistics]: existing Event has 311 ancestors and is cut-off event [2022-11-20 10:50:28,784 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 688#L109-7true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:28,784 INFO L383 tUnfolder$Statistics]: this new event has 393 ancestors and is cut-off event [2022-11-20 10:50:28,784 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 10:50:28,784 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-20 10:50:28,784 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 10:50:29,464 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 293#L110-3true, 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:29,465 INFO L383 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2022-11-20 10:50:29,465 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-20 10:50:29,465 INFO L386 tUnfolder$Statistics]: existing Event has 313 ancestors and is cut-off event [2022-11-20 10:50:29,465 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-20 10:50:29,465 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 205#L76-5true, Black: 1825#(= |#race~result_3~0| 0), Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 36#L110-5true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:29,465 INFO L383 tUnfolder$Statistics]: this new event has 399 ancestors and is cut-off event [2022-11-20 10:50:29,465 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 10:50:29,466 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-20 10:50:29,466 INFO L386 tUnfolder$Statistics]: existing Event has 311 ancestors and is cut-off event [2022-11-20 10:50:29,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 628#ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACEtrue, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:29,466 INFO L383 tUnfolder$Statistics]: this new event has 400 ancestors and is cut-off event [2022-11-20 10:50:29,466 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-20 10:50:29,466 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-20 10:50:29,466 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-20 10:50:29,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), 64#L110-2true, Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:29,467 INFO L383 tUnfolder$Statistics]: this new event has 396 ancestors and is cut-off event [2022-11-20 10:50:29,467 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-20 10:50:29,467 INFO L386 tUnfolder$Statistics]: existing Event has 308 ancestors and is cut-off event [2022-11-20 10:50:29,467 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-20 10:50:29,467 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 391#L110-6true, Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:29,467 INFO L383 tUnfolder$Statistics]: this new event has 400 ancestors and is cut-off event [2022-11-20 10:50:29,467 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-20 10:50:29,467 INFO L386 tUnfolder$Statistics]: existing Event has 316 ancestors and is cut-off event [2022-11-20 10:50:29,468 INFO L386 tUnfolder$Statistics]: existing Event has 312 ancestors and is cut-off event [2022-11-20 10:50:29,468 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2110] L76-4-->L76-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem35#1_1| (select (select |v_#memory_int_2| v_~nondet_0~0.base_8) (+ v_~nondet_0~0.offset_8 (* v_~i_8~0_6 4)))) InVars {#memory_int=|v_#memory_int_2|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} OutVars{#memory_int=|v_#memory_int_2|, thread2Thread1of1ForFork1_#t~mem35#1=|v_thread2Thread1of1ForFork1_#t~mem35#1_1|, ~nondet_0~0.base=v_~nondet_0~0.base_8, ~nondet_0~0.offset=v_~nondet_0~0.offset_8, ~i_8~0=v_~i_8~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem35#1][373], [1886#(= ~i_4~0 0), 1793#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1825#(= |#race~result_3~0| 0), 205#L76-5true, Black: 1884#true, Black: 1889#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 1857#true, 584#L110-4true, Black: 1834#(= |#race~result_7~0| 0), 1843#(= ~name_2~0 ~name_1~0), Black: 809#true, 811#(= |#race~name_1~0| 0), Black: 1801#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1894#true, Black: 814#true, 1817#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 1807#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1841#true, Black: 1875#true, 1877#(= |#race~nondet_0~0| 0), Black: 1847#true, Black: 827#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 816#(= |#race~name_2~0| 0)]) [2022-11-20 10:50:29,468 INFO L383 tUnfolder$Statistics]: this new event has 398 ancestors and is cut-off event [2022-11-20 10:50:29,468 INFO L386 tUnfolder$Statistics]: existing Event has 310 ancestors and is cut-off event [2022-11-20 10:50:29,468 INFO L386 tUnfolder$Statistics]: existing Event has 314 ancestors and is cut-off event [2022-11-20 10:50:29,468 INFO L386 tUnfolder$Statistics]: existing Event has 314 ancestors and is cut-off event