./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a --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 b6872adb14a2dfa535a444bb6d903bd37f60f26cf718935f2927b47d5c5a6aaa --- 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-b5237d8 [2022-11-21 17:15:48,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:15:48,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:15:48,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:15:48,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:15:48,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:15:48,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:15:48,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:15:48,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:15:48,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:15:48,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:15:48,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:15:48,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:15:48,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:15:48,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:15:48,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:15:48,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:15:48,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:15:48,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:15:48,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:15:48,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:15:48,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:15:48,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:15:48,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:15:48,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:15:48,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:15:48,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:15:48,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:15:48,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:15:48,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:15:48,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:15:48,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:15:48,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:15:48,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:15:48,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:15:48,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:15:48,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:15:48,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:15:48,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:15:48,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:15:48,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:15:48,628 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-21 17:15:48,650 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:15:48,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:15:48,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:15:48,651 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:15:48,652 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:15:48,652 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:15:48,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:15:48,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:15:48,653 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:15:48,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:15:48,654 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:15:48,654 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:15:48,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:15:48,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:15:48,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:15:48,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:15:48,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:15:48,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:15:48,656 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-21 17:15:48,656 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:15:48,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:15:48,656 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:15:48,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:15:48,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:15:48,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:15:48,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:15:48,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:15:48,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:15:48,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:15:48,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:15:48,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:15:48,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:15:48,659 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:15:48,659 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:15:48,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:15:48,659 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_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/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_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a 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 -> b6872adb14a2dfa535a444bb6d903bd37f60f26cf718935f2927b47d5c5a6aaa [2022-11-21 17:15:49,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:15:49,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:15:49,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:15:49,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:15:49,059 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:15:49,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2022-11-21 17:15:52,360 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:15:52,647 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:15:52,648 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2022-11-21 17:15:52,657 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/data/520859517/7587f2037bbd407193ee3064dde744eb/FLAG0373fb476 [2022-11-21 17:15:52,689 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/data/520859517/7587f2037bbd407193ee3064dde744eb [2022-11-21 17:15:52,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:15:52,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:15:52,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:15:52,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:15:52,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:15:52,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:15:52" (1/1) ... [2022-11-21 17:15:52,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37df9c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:52, skipping insertion in model container [2022-11-21 17:15:52,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:15:52" (1/1) ... [2022-11-21 17:15:52,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:15:52,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:15:53,042 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_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c[3042,3055] [2022-11-21 17:15:53,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:15:53,060 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:15:53,105 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_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c[3042,3055] [2022-11-21 17:15:53,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:15:53,134 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:15:53,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53 WrapperNode [2022-11-21 17:15:53,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:15:53,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:15:53,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:15:53,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:15:53,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,216 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 325 [2022-11-21 17:15:53,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:15:53,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:15:53,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:15:53,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:15:53,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,279 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:15:53,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:15:53,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:15:53,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:15:53,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (1/1) ... [2022-11-21 17:15:53,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:15:53,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:15:53,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:15:53,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:15:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:15:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:15:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:15:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:15:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-21 17:15:53,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-21 17:15:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-21 17:15:53,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-21 17:15:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-21 17:15:53,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-21 17:15:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:15:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 17:15:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 17:15:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 17:15:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:15:53,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:15:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:15:53,398 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 17:15:53,531 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:15:53,534 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:15:54,319 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:15:54,796 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:15:54,797 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 17:15:54,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:15:54 BoogieIcfgContainer [2022-11-21 17:15:54,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:15:54,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:15:54,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:15:54,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:15:54,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:15:52" (1/3) ... [2022-11-21 17:15:54,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf5e145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:15:54, skipping insertion in model container [2022-11-21 17:15:54,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:15:53" (2/3) ... [2022-11-21 17:15:54,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf5e145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:15:54, skipping insertion in model container [2022-11-21 17:15:54,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:15:54" (3/3) ... [2022-11-21 17:15:54,819 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2022-11-21 17:15:54,830 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 17:15:54,843 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:15:54,843 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2022-11-21 17:15:54,843 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 17:15:55,009 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-21 17:15:55,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 276 transitions, 576 flow [2022-11-21 17:15:55,272 INFO L130 PetriNetUnfolder]: 9/273 cut-off events. [2022-11-21 17:15:55,275 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 17:15:55,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 273 events. 9/273 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 336 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-11-21 17:15:55,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 276 transitions, 576 flow [2022-11-21 17:15:55,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 253 transitions, 524 flow [2022-11-21 17:15:55,321 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:15:55,331 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;@6ae041a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:15:55,332 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-21 17:15:55,339 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-21 17:15:55,339 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:15:55,339 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:15:55,340 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:15:55,343 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:15:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2029531585, now seen corresponding path program 1 times [2022-11-21 17:15:55,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:55,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079426694] [2022-11-21 17:15:55,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:55,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:55,727 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-21 17:15:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:55,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079426694] [2022-11-21 17:15:55,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079426694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:55,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:55,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:15:55,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068316699] [2022-11-21 17:15:55,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:55,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:15:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:15:55,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:15:55,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-11-21 17:15:55,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 253 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:55,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:15:55,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-11-21 17:15:55,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:15:56,498 INFO L130 PetriNetUnfolder]: 207/2157 cut-off events. [2022-11-21 17:15:56,499 INFO L131 PetriNetUnfolder]: For 88/122 co-relation queries the response was YES. [2022-11-21 17:15:56,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 2157 events. 207/2157 cut-off events. For 88/122 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 18849 event pairs, 167 based on Foata normal form. 3/1768 useless extension candidates. Maximal degree in co-relation 2368. Up to 337 conditions per place. [2022-11-21 17:15:56,526 INFO L137 encePairwiseOnDemand]: 245/276 looper letters, 20 selfloop transitions, 2 changer transitions 2/224 dead transitions. [2022-11-21 17:15:56,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 224 transitions, 510 flow [2022-11-21 17:15:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:15:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:15:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2022-11-21 17:15:56,553 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2022-11-21 17:15:56,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2022-11-21 17:15:56,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2022-11-21 17:15:56,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:15:56,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2022-11-21 17:15:56,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:56,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:56,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:56,581 INFO L175 Difference]: Start difference. First operand has 255 places, 253 transitions, 524 flow. Second operand 3 states and 720 transitions. [2022-11-21 17:15:56,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 224 transitions, 510 flow [2022-11-21 17:15:56,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 224 transitions, 498 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-21 17:15:56,594 INFO L231 Difference]: Finished difference. Result has 227 places, 222 transitions, 454 flow [2022-11-21 17:15:56,597 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=227, PETRI_TRANSITIONS=222} [2022-11-21 17:15:56,602 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -28 predicate places. [2022-11-21 17:15:56,603 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 222 transitions, 454 flow [2022-11-21 17:15:56,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:56,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:15:56,604 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:15:56,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:15:56,605 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:15:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash -661938477, now seen corresponding path program 1 times [2022-11-21 17:15:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:56,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200697270] [2022-11-21 17:15:56,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:56,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:56,676 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-21 17:15:56,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:56,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200697270] [2022-11-21 17:15:56,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200697270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:56,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:56,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:15:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138228574] [2022-11-21 17:15:56,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:56,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:15:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:56,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:15:56,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:15:56,681 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-21 17:15:56,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 222 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:56,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:15:56,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-21 17:15:56,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:15:56,866 INFO L130 PetriNetUnfolder]: 59/827 cut-off events. [2022-11-21 17:15:56,866 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-21 17:15:56,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 827 events. 59/827 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4463 event pairs, 38 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 909. Up to 97 conditions per place. [2022-11-21 17:15:56,874 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 14 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2022-11-21 17:15:56,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 221 transitions, 484 flow [2022-11-21 17:15:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:15:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:15:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2022-11-21 17:15:56,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2022-11-21 17:15:56,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2022-11-21 17:15:56,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2022-11-21 17:15:56,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:15:56,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2022-11-21 17:15:56,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:56,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:56,883 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:56,883 INFO L175 Difference]: Start difference. First operand has 227 places, 222 transitions, 454 flow. Second operand 3 states and 704 transitions. [2022-11-21 17:15:56,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 221 transitions, 484 flow [2022-11-21 17:15:56,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 221 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:15:56,889 INFO L231 Difference]: Finished difference. Result has 224 places, 221 transitions, 452 flow [2022-11-21 17:15:56,889 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=224, PETRI_TRANSITIONS=221} [2022-11-21 17:15:56,890 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -31 predicate places. [2022-11-21 17:15:56,890 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 221 transitions, 452 flow [2022-11-21 17:15:56,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:56,891 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:15:56,892 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] [2022-11-21 17:15:56,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:15:56,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:15:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1148521980, now seen corresponding path program 1 times [2022-11-21 17:15:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:56,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115588075] [2022-11-21 17:15:56,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:56,944 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-21 17:15:56,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:56,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115588075] [2022-11-21 17:15:56,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115588075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:56,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:56,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:15:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770725252] [2022-11-21 17:15:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:56,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:15:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:56,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:15:56,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:15:56,948 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-11-21 17:15:56,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 221 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:56,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:15:56,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-11-21 17:15:56,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:15:57,122 INFO L130 PetriNetUnfolder]: 59/826 cut-off events. [2022-11-21 17:15:57,122 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-21 17:15:57,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 826 events. 59/826 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4452 event pairs, 38 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 905. Up to 100 conditions per place. [2022-11-21 17:15:57,130 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2022-11-21 17:15:57,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 220 transitions, 488 flow [2022-11-21 17:15:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:15:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:15:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2022-11-21 17:15:57,155 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8429951690821256 [2022-11-21 17:15:57,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 698 transitions. [2022-11-21 17:15:57,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 698 transitions. [2022-11-21 17:15:57,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:15:57,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 698 transitions. [2022-11-21 17:15:57,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,161 INFO L175 Difference]: Start difference. First operand has 224 places, 221 transitions, 452 flow. Second operand 3 states and 698 transitions. [2022-11-21 17:15:57,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 220 transitions, 488 flow [2022-11-21 17:15:57,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:15:57,165 INFO L231 Difference]: Finished difference. Result has 223 places, 220 transitions, 450 flow [2022-11-21 17:15:57,166 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=223, PETRI_TRANSITIONS=220} [2022-11-21 17:15:57,167 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -32 predicate places. [2022-11-21 17:15:57,167 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 220 transitions, 450 flow [2022-11-21 17:15:57,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,168 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:15:57,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] [2022-11-21 17:15:57,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:15:57,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:15:57,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:57,169 INFO L85 PathProgramCache]: Analyzing trace with hash -250869527, now seen corresponding path program 1 times [2022-11-21 17:15:57,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:57,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470198946] [2022-11-21 17:15:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:57,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:57,221 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-21 17:15:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:57,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470198946] [2022-11-21 17:15:57,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470198946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:57,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:57,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:15:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032041166] [2022-11-21 17:15:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:57,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:15:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:15:57,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:15:57,225 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 276 [2022-11-21 17:15:57,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 220 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:15:57,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 276 [2022-11-21 17:15:57,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:15:57,450 INFO L130 PetriNetUnfolder]: 215/981 cut-off events. [2022-11-21 17:15:57,450 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-21 17:15:57,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 981 events. 215/981 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5724 event pairs, 146 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1287. Up to 334 conditions per place. [2022-11-21 17:15:57,461 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 23 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2022-11-21 17:15:57,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 219 transitions, 498 flow [2022-11-21 17:15:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:15:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:15:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2022-11-21 17:15:57,465 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8285024154589372 [2022-11-21 17:15:57,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2022-11-21 17:15:57,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2022-11-21 17:15:57,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:15:57,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2022-11-21 17:15:57,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,472 INFO L175 Difference]: Start difference. First operand has 223 places, 220 transitions, 450 flow. Second operand 3 states and 686 transitions. [2022-11-21 17:15:57,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 219 transitions, 498 flow [2022-11-21 17:15:57,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:15:57,478 INFO L231 Difference]: Finished difference. Result has 222 places, 219 transitions, 448 flow [2022-11-21 17:15:57,479 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=222, PETRI_TRANSITIONS=219} [2022-11-21 17:15:57,479 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -33 predicate places. [2022-11-21 17:15:57,480 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 448 flow [2022-11-21 17:15:57,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,481 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:15:57,481 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] [2022-11-21 17:15:57,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:15:57,482 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:15:57,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 165908282, now seen corresponding path program 1 times [2022-11-21 17:15:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:57,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779602641] [2022-11-21 17:15:57,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:57,534 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-21 17:15:57,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:57,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779602641] [2022-11-21 17:15:57,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779602641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:57,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:57,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:15:57,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772813655] [2022-11-21 17:15:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:57,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:15:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:57,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:15:57,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:15:57,538 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-11-21 17:15:57,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 219 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:15:57,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-11-21 17:15:57,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:15:57,767 INFO L130 PetriNetUnfolder]: 163/902 cut-off events. [2022-11-21 17:15:57,768 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-21 17:15:57,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 902 events. 163/902 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5043 event pairs, 110 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 1118. Up to 251 conditions per place. [2022-11-21 17:15:57,777 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 18 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2022-11-21 17:15:57,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 216 transitions, 480 flow [2022-11-21 17:15:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:15:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:15:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2022-11-21 17:15:57,780 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2022-11-21 17:15:57,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2022-11-21 17:15:57,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2022-11-21 17:15:57,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:15:57,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2022-11-21 17:15:57,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,787 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 448 flow. Second operand 3 states and 691 transitions. [2022-11-21 17:15:57,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 216 transitions, 480 flow [2022-11-21 17:15:57,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 216 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:15:57,793 INFO L231 Difference]: Finished difference. Result has 219 places, 216 transitions, 440 flow [2022-11-21 17:15:57,793 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=219, PETRI_TRANSITIONS=216} [2022-11-21 17:15:57,794 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -36 predicate places. [2022-11-21 17:15:57,795 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 216 transitions, 440 flow [2022-11-21 17:15:57,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,796 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:15:57,796 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] [2022-11-21 17:15:57,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:15:57,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:15:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1146374314, now seen corresponding path program 1 times [2022-11-21 17:15:57,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:57,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850133483] [2022-11-21 17:15:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:57,848 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-21 17:15:57,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:57,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850133483] [2022-11-21 17:15:57,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850133483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:57,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:57,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:15:57,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82121787] [2022-11-21 17:15:57,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:57,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:15:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:57,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:15:57,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:15:57,853 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-21 17:15:57,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 216 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:57,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:15:57,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-21 17:15:57,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:15:58,040 INFO L130 PetriNetUnfolder]: 59/797 cut-off events. [2022-11-21 17:15:58,040 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-21 17:15:58,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 797 events. 59/797 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4226 event pairs, 38 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 858. Up to 97 conditions per place. [2022-11-21 17:15:58,049 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 14 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-11-21 17:15:58,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 215 transitions, 470 flow [2022-11-21 17:15:58,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:15:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:15:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2022-11-21 17:15:58,052 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2022-11-21 17:15:58,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2022-11-21 17:15:58,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2022-11-21 17:15:58,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:15:58,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2022-11-21 17:15:58,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,059 INFO L175 Difference]: Start difference. First operand has 219 places, 216 transitions, 440 flow. Second operand 3 states and 704 transitions. [2022-11-21 17:15:58,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 215 transitions, 470 flow [2022-11-21 17:15:58,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 17:15:58,065 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 441 flow [2022-11-21 17:15:58,066 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2022-11-21 17:15:58,069 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -36 predicate places. [2022-11-21 17:15:58,070 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 441 flow [2022-11-21 17:15:58,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,071 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:15:58,072 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] [2022-11-21 17:15:58,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:15:58,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:15:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1941991352, now seen corresponding path program 1 times [2022-11-21 17:15:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:58,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037103799] [2022-11-21 17:15:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:58,180 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-21 17:15:58,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:58,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037103799] [2022-11-21 17:15:58,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037103799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:58,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:58,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:15:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790633902] [2022-11-21 17:15:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:58,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:15:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:58,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:15:58,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:15:58,185 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-21 17:15:58,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:15:58,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-21 17:15:58,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:15:58,354 INFO L130 PetriNetUnfolder]: 59/796 cut-off events. [2022-11-21 17:15:58,355 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-21 17:15:58,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 796 events. 59/796 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4225 event pairs, 38 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 857. Up to 95 conditions per place. [2022-11-21 17:15:58,364 INFO L137 encePairwiseOnDemand]: 274/276 looper letters, 14 selfloop transitions, 1 changer transitions 0/214 dead transitions. [2022-11-21 17:15:58,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 214 transitions, 469 flow [2022-11-21 17:15:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:15:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:15:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2022-11-21 17:15:58,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8490338164251208 [2022-11-21 17:15:58,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 703 transitions. [2022-11-21 17:15:58,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 703 transitions. [2022-11-21 17:15:58,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:15:58,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 703 transitions. [2022-11-21 17:15:58,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,374 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 441 flow. Second operand 3 states and 703 transitions. [2022-11-21 17:15:58,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 214 transitions, 469 flow [2022-11-21 17:15:58,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 214 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:15:58,380 INFO L231 Difference]: Finished difference. Result has 218 places, 214 transitions, 437 flow [2022-11-21 17:15:58,380 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=218, PETRI_TRANSITIONS=214} [2022-11-21 17:15:58,381 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -37 predicate places. [2022-11-21 17:15:58,382 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 214 transitions, 437 flow [2022-11-21 17:15:58,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,382 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:15:58,383 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] [2022-11-21 17:15:58,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:15:58,383 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:15:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash -685495310, now seen corresponding path program 1 times [2022-11-21 17:15:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:58,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982070046] [2022-11-21 17:15:58,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:58,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:58,446 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-21 17:15:58,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:58,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982070046] [2022-11-21 17:15:58,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982070046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:58,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:58,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:15:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299806434] [2022-11-21 17:15:58,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:58,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:15:58,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:58,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:15:58,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:15:58,450 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-11-21 17:15:58,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 214 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:15:58,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-11-21 17:15:58,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:15:58,725 INFO L130 PetriNetUnfolder]: 215/951 cut-off events. [2022-11-21 17:15:58,726 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-21 17:15:58,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 951 events. 215/951 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5285 event pairs, 146 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 1247. Up to 331 conditions per place. [2022-11-21 17:15:58,736 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 20 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2022-11-21 17:15:58,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 479 flow [2022-11-21 17:15:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:15:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:15:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2022-11-21 17:15:58,739 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8357487922705314 [2022-11-21 17:15:58,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 692 transitions. [2022-11-21 17:15:58,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 692 transitions. [2022-11-21 17:15:58,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:15:58,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 692 transitions. [2022-11-21 17:15:58,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,746 INFO L175 Difference]: Start difference. First operand has 218 places, 214 transitions, 437 flow. Second operand 3 states and 692 transitions. [2022-11-21 17:15:58,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 479 flow [2022-11-21 17:15:58,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 213 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 17:15:58,752 INFO L231 Difference]: Finished difference. Result has 218 places, 213 transitions, 438 flow [2022-11-21 17:15:58,753 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=218, PETRI_TRANSITIONS=213} [2022-11-21 17:15:58,753 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -37 predicate places. [2022-11-21 17:15:58,754 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 438 flow [2022-11-21 17:15:58,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:58,755 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:15:58,755 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-21 17:15:58,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:15:58,755 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:15:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:15:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1258613492, now seen corresponding path program 1 times [2022-11-21 17:15:58,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:15:58,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897958266] [2022-11-21 17:15:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:15:58,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:15:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:15:59,501 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-21 17:15:59,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:15:59,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897958266] [2022-11-21 17:15:59,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897958266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:15:59,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:15:59,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:15:59,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319577649] [2022-11-21 17:15:59,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:15:59,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:15:59,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:15:59,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:15:59,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:15:59,506 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2022-11-21 17:15:59,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 213 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:15:59,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:15:59,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2022-11-21 17:15:59,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:01,556 INFO L130 PetriNetUnfolder]: 3233/6048 cut-off events. [2022-11-21 17:16:01,556 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-21 17:16:01,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10599 conditions, 6048 events. 3233/6048 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 43402 event pairs, 2444 based on Foata normal form. 0/5384 useless extension candidates. Maximal degree in co-relation 10546. Up to 4527 conditions per place. [2022-11-21 17:16:01,631 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 52 selfloop transitions, 5 changer transitions 0/212 dead transitions. [2022-11-21 17:16:01,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 212 transitions, 550 flow [2022-11-21 17:16:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:16:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 17:16:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2022-11-21 17:16:01,647 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.716183574879227 [2022-11-21 17:16:01,648 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1186 transitions. [2022-11-21 17:16:01,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1186 transitions. [2022-11-21 17:16:01,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:01,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1186 transitions. [2022-11-21 17:16:01,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:01,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:01,658 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:01,658 INFO L175 Difference]: Start difference. First operand has 218 places, 213 transitions, 438 flow. Second operand 6 states and 1186 transitions. [2022-11-21 17:16:01,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 212 transitions, 550 flow [2022-11-21 17:16:01,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 212 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:16:01,665 INFO L231 Difference]: Finished difference. Result has 220 places, 212 transitions, 442 flow [2022-11-21 17:16:01,666 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=220, PETRI_TRANSITIONS=212} [2022-11-21 17:16:01,666 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -35 predicate places. [2022-11-21 17:16:01,667 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 212 transitions, 442 flow [2022-11-21 17:16:01,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:01,668 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:01,668 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] [2022-11-21 17:16:01,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:16:01,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:01,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:01,669 INFO L85 PathProgramCache]: Analyzing trace with hash 515061523, now seen corresponding path program 1 times [2022-11-21 17:16:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:01,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857557206] [2022-11-21 17:16:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:01,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:01,744 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-21 17:16:01,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:01,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857557206] [2022-11-21 17:16:01,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857557206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:01,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:01,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:16:01,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097758594] [2022-11-21 17:16:01,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:01,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:16:01,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:16:01,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:16:01,757 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-11-21 17:16:01,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 212 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:01,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:01,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-11-21 17:16:01,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:01,911 INFO L130 PetriNetUnfolder]: 148/591 cut-off events. [2022-11-21 17:16:01,911 INFO L131 PetriNetUnfolder]: For 13/37 co-relation queries the response was YES. [2022-11-21 17:16:01,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 591 events. 148/591 cut-off events. For 13/37 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2777 event pairs, 44 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 856. Up to 236 conditions per place. [2022-11-21 17:16:01,920 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 20 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-11-21 17:16:01,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 215 transitions, 494 flow [2022-11-21 17:16:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:16:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:16:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2022-11-21 17:16:01,924 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-11-21 17:16:01,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 702 transitions. [2022-11-21 17:16:01,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 702 transitions. [2022-11-21 17:16:01,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:01,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 702 transitions. [2022-11-21 17:16:01,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:01,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:01,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:01,930 INFO L175 Difference]: Start difference. First operand has 220 places, 212 transitions, 442 flow. Second operand 3 states and 702 transitions. [2022-11-21 17:16:01,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 215 transitions, 494 flow [2022-11-21 17:16:01,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 484 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-21 17:16:01,937 INFO L231 Difference]: Finished difference. Result has 216 places, 212 transitions, 442 flow [2022-11-21 17:16:01,938 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=216, PETRI_TRANSITIONS=212} [2022-11-21 17:16:01,939 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -39 predicate places. [2022-11-21 17:16:01,939 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 212 transitions, 442 flow [2022-11-21 17:16:01,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:01,940 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:01,940 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] [2022-11-21 17:16:01,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:16:01,941 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:01,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:01,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1453097214, now seen corresponding path program 1 times [2022-11-21 17:16:01,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:01,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841753874] [2022-11-21 17:16:01,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:01,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:01,996 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-21 17:16:01,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:01,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841753874] [2022-11-21 17:16:01,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841753874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:01,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:01,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:16:01,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352449273] [2022-11-21 17:16:01,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:01,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:16:01,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:01,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:16:02,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:16:02,001 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-11-21 17:16:02,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 212 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:02,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:02,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-11-21 17:16:02,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:02,266 INFO L130 PetriNetUnfolder]: 191/1000 cut-off events. [2022-11-21 17:16:02,266 INFO L131 PetriNetUnfolder]: For 25/37 co-relation queries the response was YES. [2022-11-21 17:16:02,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 1000 events. 191/1000 cut-off events. For 25/37 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5942 event pairs, 38 based on Foata normal form. 1/905 useless extension candidates. Maximal degree in co-relation 1272. Up to 252 conditions per place. [2022-11-21 17:16:02,278 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 22 selfloop transitions, 3 changer transitions 0/218 dead transitions. [2022-11-21 17:16:02,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 506 flow [2022-11-21 17:16:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:16:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:16:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-11-21 17:16:02,281 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2022-11-21 17:16:02,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-11-21 17:16:02,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-11-21 17:16:02,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:02,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-11-21 17:16:02,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:02,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:02,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:02,289 INFO L175 Difference]: Start difference. First operand has 216 places, 212 transitions, 442 flow. Second operand 3 states and 705 transitions. [2022-11-21 17:16:02,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 506 flow [2022-11-21 17:16:02,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 218 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 17:16:02,295 INFO L231 Difference]: Finished difference. Result has 217 places, 213 transitions, 459 flow [2022-11-21 17:16:02,296 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=217, PETRI_TRANSITIONS=213} [2022-11-21 17:16:02,297 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -38 predicate places. [2022-11-21 17:16:02,297 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 213 transitions, 459 flow [2022-11-21 17:16:02,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:02,298 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:02,299 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:16:02,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 17:16:02,299 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:02,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1543022137, now seen corresponding path program 1 times [2022-11-21 17:16:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:02,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983025462] [2022-11-21 17:16:02,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:02,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:02,961 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-21 17:16:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:02,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983025462] [2022-11-21 17:16:02,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983025462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:02,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:02,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:16:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014927829] [2022-11-21 17:16:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:02,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:16:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:02,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:16:02,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:16:02,965 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-11-21 17:16:02,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 213 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:02,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:02,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-11-21 17:16:02,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:03,823 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][173], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, 332#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 264#L105-3true, 125#L60true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:03,823 INFO L383 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-11-21 17:16:03,824 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-21 17:16:03,824 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-21 17:16:03,824 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-21 17:16:03,826 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][164], [326#(= |#race~queue~0| 0), 38#L105-2true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 331#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 125#L60true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:03,826 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is cut-off event [2022-11-21 17:16:03,826 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-21 17:16:03,826 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-21 17:16:03,827 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-21 17:16:03,828 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][183], [326#(= |#race~queue~0| 0), 170#L105-4true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 333#(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)), 125#L60true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:03,828 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-11-21 17:16:03,828 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-21 17:16:03,828 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 17:16:03,829 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 17:16:03,843 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][192], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), 334#(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)), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 223#L105-5true, 125#L60true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:03,844 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-11-21 17:16:03,844 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-21 17:16:03,844 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 17:16:03,844 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 17:16:03,904 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][192], [326#(= |#race~queue~0| 0), 9#L105-6true, Black: 319#true, 298#(= |#race~start~0| 0), 334#(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)), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 125#L60true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:03,905 INFO L383 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-11-21 17:16:03,905 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-21 17:16:03,905 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-21 17:16:03,905 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-21 17:16:04,087 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][192], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), 334#(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)), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 252#L105-7true, 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:04,088 INFO L383 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-11-21 17:16:04,088 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-21 17:16:04,088 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:04,089 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-21 17:16:04,395 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][192], [326#(= |#race~queue~0| 0), Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 54#L106-2true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:04,396 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-21 17:16:04,396 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-21 17:16:04,396 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-21 17:16:04,396 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 17:16:04,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][192], [326#(= |#race~queue~0| 0), Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 7#L106-3true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:04,453 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-21 17:16:04,454 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-21 17:16:04,454 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-21 17:16:04,454 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-21 17:16:04,519 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][192], [326#(= |#race~queue~0| 0), Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 123#L106-4true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:04,519 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-11-21 17:16:04,519 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-21 17:16:04,519 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-21 17:16:04,520 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-21 17:16:04,593 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][192], [326#(= |#race~queue~0| 0), 130#L106-5true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:04,593 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-21 17:16:04,593 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-21 17:16:04,593 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-21 17:16:04,594 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-21 17:16:04,647 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][192], [326#(= |#race~queue~0| 0), Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 50#L106-6true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:04,647 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-21 17:16:04,648 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-21 17:16:04,648 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:04,648 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:04,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][192], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), 334#(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)), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 159#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:04,650 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-21 17:16:04,650 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:04,651 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-21 17:16:04,651 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:05,257 INFO L130 PetriNetUnfolder]: 3989/6364 cut-off events. [2022-11-21 17:16:05,258 INFO L131 PetriNetUnfolder]: For 1397/1438 co-relation queries the response was YES. [2022-11-21 17:16:05,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13489 conditions, 6364 events. 3989/6364 cut-off events. For 1397/1438 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 42990 event pairs, 394 based on Foata normal form. 0/5753 useless extension candidates. Maximal degree in co-relation 13433. Up to 2515 conditions per place. [2022-11-21 17:16:05,344 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 123 selfloop transitions, 4 changer transitions 0/288 dead transitions. [2022-11-21 17:16:05,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 288 transitions, 903 flow [2022-11-21 17:16:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:16:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 17:16:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1276 transitions. [2022-11-21 17:16:05,350 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7705314009661836 [2022-11-21 17:16:05,350 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1276 transitions. [2022-11-21 17:16:05,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1276 transitions. [2022-11-21 17:16:05,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:05,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1276 transitions. [2022-11-21 17:16:05,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 212.66666666666666) internal successors, (1276), 6 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:05,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:05,361 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:05,362 INFO L175 Difference]: Start difference. First operand has 217 places, 213 transitions, 459 flow. Second operand 6 states and 1276 transitions. [2022-11-21 17:16:05,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 288 transitions, 903 flow [2022-11-21 17:16:05,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 288 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 17:16:05,371 INFO L231 Difference]: Finished difference. Result has 221 places, 212 transitions, 465 flow [2022-11-21 17:16:05,372 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=221, PETRI_TRANSITIONS=212} [2022-11-21 17:16:05,375 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-21 17:16:05,375 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 212 transitions, 465 flow [2022-11-21 17:16:05,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:05,376 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:05,377 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] [2022-11-21 17:16:05,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 17:16:05,377 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:05,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:05,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1630701092, now seen corresponding path program 1 times [2022-11-21 17:16:05,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:05,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826916612] [2022-11-21 17:16:05,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:05,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:05,938 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-21 17:16:05,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:05,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826916612] [2022-11-21 17:16:05,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826916612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:05,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:05,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:16:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115441585] [2022-11-21 17:16:05,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:05,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:16:05,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:05,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:16:05,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:16:05,948 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 276 [2022-11-21 17:16:05,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 212 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:05,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:05,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 276 [2022-11-21 17:16:05,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:06,607 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 170#L105-4true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 333#(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)), 306#(= |#race~n~0| 0), 125#L60true]) [2022-11-21 17:16:06,607 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-11-21 17:16:06,608 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 17:16:06,608 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-21 17:16:06,608 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 17:16:06,609 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, 332#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 264#L105-3true, 306#(= |#race~n~0| 0), 125#L60true]) [2022-11-21 17:16:06,609 INFO L383 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-11-21 17:16:06,609 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-21 17:16:06,610 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-21 17:16:06,610 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-21 17:16:06,611 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 223#L105-5true, 306#(= |#race~n~0| 0), 125#L60true]) [2022-11-21 17:16:06,612 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-11-21 17:16:06,612 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 17:16:06,612 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-21 17:16:06,612 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 17:16:06,627 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, 9#L105-6true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0), 125#L60true]) [2022-11-21 17:16:06,627 INFO L383 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-11-21 17:16:06,628 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-21 17:16:06,628 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-21 17:16:06,628 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-21 17:16:06,773 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 252#L105-7true, 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:06,774 INFO L383 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-11-21 17:16:06,774 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-21 17:16:06,774 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:06,774 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-21 17:16:06,946 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 54#L106-2true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:06,946 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-21 17:16:06,946 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 17:16:06,947 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-21 17:16:06,947 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-21 17:16:07,021 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 7#L106-3true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:07,022 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-21 17:16:07,022 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-21 17:16:07,022 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-21 17:16:07,022 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-21 17:16:07,094 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 123#L106-4true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:07,094 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-11-21 17:16:07,094 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-21 17:16:07,095 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-21 17:16:07,095 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-21 17:16:07,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [130#L106-5true, 326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:07,175 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-21 17:16:07,176 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-21 17:16:07,176 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-21 17:16:07,176 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-21 17:16:07,225 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 50#L106-6true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:07,226 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-21 17:16:07,226 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:07,226 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:07,226 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-21 17:16:07,228 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 159#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:07,228 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-21 17:16:07,228 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-21 17:16:07,228 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:07,229 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:07,885 INFO L130 PetriNetUnfolder]: 3758/6946 cut-off events. [2022-11-21 17:16:07,885 INFO L131 PetriNetUnfolder]: For 1955/1991 co-relation queries the response was YES. [2022-11-21 17:16:07,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14345 conditions, 6946 events. 3758/6946 cut-off events. For 1955/1991 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 51267 event pairs, 485 based on Foata normal form. 0/6336 useless extension candidates. Maximal degree in co-relation 14287. Up to 3034 conditions per place. [2022-11-21 17:16:07,950 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 141 selfloop transitions, 4 changer transitions 0/303 dead transitions. [2022-11-21 17:16:07,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 303 transitions, 993 flow [2022-11-21 17:16:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:16:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 17:16:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1296 transitions. [2022-11-21 17:16:07,955 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2022-11-21 17:16:07,955 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1296 transitions. [2022-11-21 17:16:07,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1296 transitions. [2022-11-21 17:16:07,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:07,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1296 transitions. [2022-11-21 17:16:07,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:07,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:07,963 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:07,963 INFO L175 Difference]: Start difference. First operand has 221 places, 212 transitions, 465 flow. Second operand 6 states and 1296 transitions. [2022-11-21 17:16:07,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 303 transitions, 993 flow [2022-11-21 17:16:07,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 303 transitions, 958 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 17:16:07,970 INFO L231 Difference]: Finished difference. Result has 221 places, 211 transitions, 464 flow [2022-11-21 17:16:07,971 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=221, PETRI_TRANSITIONS=211} [2022-11-21 17:16:07,972 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-21 17:16:07,972 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 211 transitions, 464 flow [2022-11-21 17:16:07,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:07,973 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:07,973 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-21 17:16:07,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 17:16:07,974 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:07,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1959845868, now seen corresponding path program 1 times [2022-11-21 17:16:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:07,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073934376] [2022-11-21 17:16:07,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:08,403 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-21 17:16:08,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:08,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073934376] [2022-11-21 17:16:08,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073934376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:08,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:08,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:16:08,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057068930] [2022-11-21 17:16:08,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:08,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:16:08,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:08,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:16:08,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:16:08,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 276 [2022-11-21 17:16:08,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 211 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:08,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:08,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 276 [2022-11-21 17:16:08,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:09,076 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0), 125#L60true, 334#(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)), 231#L86true, 223#L105-5true]) [2022-11-21 17:16:09,077 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-11-21 17:16:09,077 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-21 17:16:09,077 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 17:16:09,077 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-21 17:16:09,079 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 215#L76true, 321#(= |#race~A~0| 0), 343#true, 264#L105-3true, 306#(= |#race~n~0| 0), 125#L60true]) [2022-11-21 17:16:09,080 INFO L383 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-11-21 17:16:09,080 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-21 17:16:09,080 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-21 17:16:09,080 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-21 17:16:09,081 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0), 125#L60true, 333#(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))]) [2022-11-21 17:16:09,082 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-11-21 17:16:09,082 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 17:16:09,082 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-21 17:16:09,082 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-21 17:16:09,093 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, 9#L105-6true, Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0), 125#L60true, 334#(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)), 231#L86true]) [2022-11-21 17:16:09,094 INFO L383 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-11-21 17:16:09,094 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-21 17:16:09,094 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-21 17:16:09,095 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-21 17:16:09,248 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 252#L105-7true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:09,248 INFO L383 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-11-21 17:16:09,248 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:09,249 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-21 17:16:09,249 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-21 17:16:09,417 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 54#L106-2true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:09,417 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-21 17:16:09,417 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-21 17:16:09,417 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 17:16:09,418 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-21 17:16:09,463 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 7#L106-3true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:09,463 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-21 17:16:09,463 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-21 17:16:09,464 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-21 17:16:09,464 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-21 17:16:09,512 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 123#L106-4true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:09,513 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-11-21 17:16:09,513 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-21 17:16:09,513 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-21 17:16:09,513 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-21 17:16:09,561 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 130#L106-5true, 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 215#L76true, 321#(= |#race~A~0| 0), 343#true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:09,561 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-21 17:16:09,561 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-21 17:16:09,561 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-21 17:16:09,562 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-21 17:16:09,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 50#L106-6true, 215#L76true, 321#(= |#race~A~0| 0), 343#true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:09,600 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-21 17:16:09,600 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:09,600 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:09,601 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-21 17:16:09,602 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 159#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-21 17:16:09,602 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-21 17:16:09,602 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:09,602 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-21 17:16:09,603 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-21 17:16:10,259 INFO L130 PetriNetUnfolder]: 3515/6545 cut-off events. [2022-11-21 17:16:10,259 INFO L131 PetriNetUnfolder]: For 1432/1468 co-relation queries the response was YES. [2022-11-21 17:16:10,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13391 conditions, 6545 events. 3515/6545 cut-off events. For 1432/1468 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 47243 event pairs, 1355 based on Foata normal form. 0/6042 useless extension candidates. Maximal degree in co-relation 13333. Up to 3211 conditions per place. [2022-11-21 17:16:10,333 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 140 selfloop transitions, 4 changer transitions 0/302 dead transitions. [2022-11-21 17:16:10,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 302 transitions, 962 flow [2022-11-21 17:16:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:16:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 17:16:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2022-11-21 17:16:10,338 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7820048309178744 [2022-11-21 17:16:10,339 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1295 transitions. [2022-11-21 17:16:10,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1295 transitions. [2022-11-21 17:16:10,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:10,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1295 transitions. [2022-11-21 17:16:10,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:10,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:10,349 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:10,350 INFO L175 Difference]: Start difference. First operand has 221 places, 211 transitions, 464 flow. Second operand 6 states and 1295 transitions. [2022-11-21 17:16:10,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 302 transitions, 962 flow [2022-11-21 17:16:10,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 302 transitions, 955 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 17:16:10,359 INFO L231 Difference]: Finished difference. Result has 221 places, 210 transitions, 463 flow [2022-11-21 17:16:10,360 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=221, PETRI_TRANSITIONS=210} [2022-11-21 17:16:10,361 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-21 17:16:10,361 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 210 transitions, 463 flow [2022-11-21 17:16:10,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:10,362 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:10,363 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] [2022-11-21 17:16:10,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 17:16:10,363 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:10,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1626788087, now seen corresponding path program 1 times [2022-11-21 17:16:10,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:10,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361797745] [2022-11-21 17:16:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:10,606 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-21 17:16:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:10,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361797745] [2022-11-21 17:16:10,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361797745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:10,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:10,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:16:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618188751] [2022-11-21 17:16:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:10,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:16:10,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:10,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:16:10,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:16:10,611 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 276 [2022-11-21 17:16:10,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 210 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:10,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:10,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 276 [2022-11-21 17:16:10,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:10,914 INFO L130 PetriNetUnfolder]: 103/966 cut-off events. [2022-11-21 17:16:10,914 INFO L131 PetriNetUnfolder]: For 68/74 co-relation queries the response was YES. [2022-11-21 17:16:10,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 966 events. 103/966 cut-off events. For 68/74 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5257 event pairs, 48 based on Foata normal form. 18/925 useless extension candidates. Maximal degree in co-relation 1308. Up to 135 conditions per place. [2022-11-21 17:16:10,922 INFO L137 encePairwiseOnDemand]: 266/276 looper letters, 35 selfloop transitions, 6 changer transitions 6/225 dead transitions. [2022-11-21 17:16:10,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 225 transitions, 590 flow [2022-11-21 17:16:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:16:10,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 17:16:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1553 transitions. [2022-11-21 17:16:10,928 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8038302277432712 [2022-11-21 17:16:10,928 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1553 transitions. [2022-11-21 17:16:10,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1553 transitions. [2022-11-21 17:16:10,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:10,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1553 transitions. [2022-11-21 17:16:10,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 221.85714285714286) internal successors, (1553), 7 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:10,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:10,939 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:10,939 INFO L175 Difference]: Start difference. First operand has 221 places, 210 transitions, 463 flow. Second operand 7 states and 1553 transitions. [2022-11-21 17:16:10,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 225 transitions, 590 flow [2022-11-21 17:16:10,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 225 transitions, 583 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 17:16:10,946 INFO L231 Difference]: Finished difference. Result has 225 places, 211 transitions, 482 flow [2022-11-21 17:16:10,946 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=482, PETRI_PLACES=225, PETRI_TRANSITIONS=211} [2022-11-21 17:16:10,947 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -30 predicate places. [2022-11-21 17:16:10,947 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 211 transitions, 482 flow [2022-11-21 17:16:10,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:10,948 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:10,949 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:16:10,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 17:16:10,949 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:10,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:10,950 INFO L85 PathProgramCache]: Analyzing trace with hash -376159072, now seen corresponding path program 1 times [2022-11-21 17:16:10,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:10,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842702766] [2022-11-21 17:16:10,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:10,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:11,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:11,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842702766] [2022-11-21 17:16:11,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842702766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:11,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:11,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:16:11,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534181605] [2022-11-21 17:16:11,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:11,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:16:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:16:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:16:11,517 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-11-21 17:16:11,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 211 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:11,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:11,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-11-21 17:16:11,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:12,055 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0), 125#L60true, 365#true, 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 333#(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))]) [2022-11-21 17:16:12,056 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-21 17:16:12,056 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-21 17:16:12,056 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-21 17:16:12,057 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-21 17:16:12,058 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 125#L60true, 365#true, 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 223#L105-5true]) [2022-11-21 17:16:12,058 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-21 17:16:12,058 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 17:16:12,058 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-21 17:16:12,059 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-21 17:16:12,061 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 125#L60true, 365#true, 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 264#L105-3true]) [2022-11-21 17:16:12,062 INFO L383 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-11-21 17:16:12,062 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-21 17:16:12,062 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-21 17:16:12,062 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-21 17:16:12,075 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), 9#L105-6true, Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 306#(= |#race~n~0| 0), 125#L60true, 365#true, 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-21 17:16:12,076 INFO L383 tUnfolder$Statistics]: this new event has 147 ancestors and is cut-off event [2022-11-21 17:16:12,076 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-21 17:16:12,076 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-21 17:16:12,076 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-21 17:16:12,287 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 252#L105-7true, 306#(= |#race~n~0| 0), 365#true, 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-21 17:16:12,288 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-11-21 17:16:12,288 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-21 17:16:12,288 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-21 17:16:12,288 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-21 17:16:12,374 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, 102#L106-1true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 215#L76true, Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 306#(= |#race~n~0| 0), 365#true, 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-21 17:16:12,374 INFO L383 tUnfolder$Statistics]: this new event has 152 ancestors and is cut-off event [2022-11-21 17:16:12,374 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-21 17:16:12,374 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-21 17:16:12,374 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-21 17:16:12,419 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][182], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 54#L106-2true, 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 367#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-21 17:16:12,420 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is cut-off event [2022-11-21 17:16:12,420 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-21 17:16:12,420 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-21 17:16:12,420 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-21 17:16:12,473 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][188], [326#(= |#race~queue~0| 0), 368#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 7#L106-3true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-21 17:16:12,473 INFO L383 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-11-21 17:16:12,473 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-21 17:16:12,474 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-21 17:16:12,474 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-21 17:16:12,531 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][194], [326#(= |#race~queue~0| 0), 369#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 123#L106-4true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-21 17:16:12,531 INFO L383 tUnfolder$Statistics]: this new event has 155 ancestors and is cut-off event [2022-11-21 17:16:12,532 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-21 17:16:12,532 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-21 17:16:12,532 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-21 17:16:12,586 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][201], [326#(= |#race~queue~0| 0), 130#L106-5true, Black: 319#true, 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 215#L76true, Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-21 17:16:12,586 INFO L383 tUnfolder$Statistics]: this new event has 156 ancestors and is cut-off event [2022-11-21 17:16:12,587 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-21 17:16:12,587 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-21 17:16:12,587 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-21 17:16:12,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][201], [326#(= |#race~queue~0| 0), Black: 319#true, 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 298#(= |#race~start~0| 0), Black: 324#true, 50#L106-6true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-21 17:16:12,635 INFO L383 tUnfolder$Statistics]: this new event has 157 ancestors and is cut-off event [2022-11-21 17:16:12,635 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-21 17:16:12,635 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-21 17:16:12,635 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-21 17:16:13,173 INFO L130 PetriNetUnfolder]: 3031/5729 cut-off events. [2022-11-21 17:16:13,173 INFO L131 PetriNetUnfolder]: For 1369/1445 co-relation queries the response was YES. [2022-11-21 17:16:13,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11748 conditions, 5729 events. 3031/5729 cut-off events. For 1369/1445 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 41252 event pairs, 1424 based on Foata normal form. 0/5305 useless extension candidates. Maximal degree in co-relation 11687. Up to 3409 conditions per place. [2022-11-21 17:16:13,238 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 96 selfloop transitions, 4 changer transitions 0/262 dead transitions. [2022-11-21 17:16:13,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 262 transitions, 808 flow [2022-11-21 17:16:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:16:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 17:16:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1257 transitions. [2022-11-21 17:16:13,243 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7590579710144928 [2022-11-21 17:16:13,243 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1257 transitions. [2022-11-21 17:16:13,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1257 transitions. [2022-11-21 17:16:13,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:13,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1257 transitions. [2022-11-21 17:16:13,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:13,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:13,252 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:13,252 INFO L175 Difference]: Start difference. First operand has 225 places, 211 transitions, 482 flow. Second operand 6 states and 1257 transitions. [2022-11-21 17:16:13,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 262 transitions, 808 flow [2022-11-21 17:16:13,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 262 transitions, 798 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 17:16:13,259 INFO L231 Difference]: Finished difference. Result has 224 places, 210 transitions, 478 flow [2022-11-21 17:16:13,260 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=224, PETRI_TRANSITIONS=210} [2022-11-21 17:16:13,260 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -31 predicate places. [2022-11-21 17:16:13,261 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 210 transitions, 478 flow [2022-11-21 17:16:13,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:13,261 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:13,262 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-21 17:16:13,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 17:16:13,262 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:13,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:13,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2132503650, now seen corresponding path program 1 times [2022-11-21 17:16:13,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:13,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915060235] [2022-11-21 17:16:13,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:13,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:16:13,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:13,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915060235] [2022-11-21 17:16:13,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915060235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:13,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:13,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:16:13,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440445211] [2022-11-21 17:16:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:13,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:16:13,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:13,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:16:13,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:16:13,338 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 276 [2022-11-21 17:16:13,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 210 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:13,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:13,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 276 [2022-11-21 17:16:13,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:13,565 INFO L130 PetriNetUnfolder]: 205/965 cut-off events. [2022-11-21 17:16:13,565 INFO L131 PetriNetUnfolder]: For 167/181 co-relation queries the response was YES. [2022-11-21 17:16:13,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 965 events. 205/965 cut-off events. For 167/181 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5398 event pairs, 69 based on Foata normal form. 0/920 useless extension candidates. Maximal degree in co-relation 1469. Up to 213 conditions per place. [2022-11-21 17:16:13,575 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 23 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-11-21 17:16:13,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 215 transitions, 544 flow [2022-11-21 17:16:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:16:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:16:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-11-21 17:16:13,577 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2022-11-21 17:16:13,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-11-21 17:16:13,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-11-21 17:16:13,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:13,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-11-21 17:16:13,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:13,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:13,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:13,583 INFO L175 Difference]: Start difference. First operand has 224 places, 210 transitions, 478 flow. Second operand 3 states and 705 transitions. [2022-11-21 17:16:13,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 215 transitions, 544 flow [2022-11-21 17:16:13,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 215 transitions, 537 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 17:16:13,588 INFO L231 Difference]: Finished difference. Result has 221 places, 209 transitions, 473 flow [2022-11-21 17:16:13,589 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=221, PETRI_TRANSITIONS=209} [2022-11-21 17:16:13,589 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-21 17:16:13,589 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 209 transitions, 473 flow [2022-11-21 17:16:13,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:13,590 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:13,590 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:16:13,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 17:16:13,590 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash -90362603, now seen corresponding path program 1 times [2022-11-21 17:16:13,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:13,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049660643] [2022-11-21 17:16:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:14,312 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-21 17:16:14,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:14,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049660643] [2022-11-21 17:16:14,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049660643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:16:14,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123274336] [2022-11-21 17:16:14,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:14,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:16:14,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:14,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:16:14,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:16:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:14,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 17:16:14,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:16:15,326 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-21 17:16:15,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:16:15,861 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-21 17:16:15,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123274336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:16:15,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:16:15,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-11-21 17:16:15,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127315378] [2022-11-21 17:16:15,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:16:15,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 17:16:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:15,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 17:16:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-21 17:16:15,870 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 276 [2022-11-21 17:16:15,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 209 transitions, 473 flow. Second operand has 19 states, 19 states have (on average 209.8421052631579) internal successors, (3987), 19 states have internal predecessors, (3987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:15,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:15,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 276 [2022-11-21 17:16:15,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:16,539 INFO L130 PetriNetUnfolder]: 119/1030 cut-off events. [2022-11-21 17:16:16,540 INFO L131 PetriNetUnfolder]: For 155/183 co-relation queries the response was YES. [2022-11-21 17:16:16,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 1030 events. 119/1030 cut-off events. For 155/183 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5652 event pairs, 48 based on Foata normal form. 24/1011 useless extension candidates. Maximal degree in co-relation 1495. Up to 128 conditions per place. [2022-11-21 17:16:16,549 INFO L137 encePairwiseOnDemand]: 262/276 looper letters, 46 selfloop transitions, 12 changer transitions 13/240 dead transitions. [2022-11-21 17:16:16,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 240 transitions, 697 flow [2022-11-21 17:16:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 17:16:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-21 17:16:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2751 transitions. [2022-11-21 17:16:16,558 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7667224080267558 [2022-11-21 17:16:16,558 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2751 transitions. [2022-11-21 17:16:16,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2751 transitions. [2022-11-21 17:16:16,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:16,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2751 transitions. [2022-11-21 17:16:16,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 211.6153846153846) internal successors, (2751), 13 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:16,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 276.0) internal successors, (3864), 14 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:16,576 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 276.0) internal successors, (3864), 14 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:16,577 INFO L175 Difference]: Start difference. First operand has 221 places, 209 transitions, 473 flow. Second operand 13 states and 2751 transitions. [2022-11-21 17:16:16,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 240 transitions, 697 flow [2022-11-21 17:16:16,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 240 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:16:16,584 INFO L231 Difference]: Finished difference. Result has 237 places, 213 transitions, 534 flow [2022-11-21 17:16:16,584 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=213} [2022-11-21 17:16:16,585 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -18 predicate places. [2022-11-21 17:16:16,585 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 213 transitions, 534 flow [2022-11-21 17:16:16,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 209.8421052631579) internal successors, (3987), 19 states have internal predecessors, (3987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:16,587 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:16,588 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:16:16,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:16:16,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 17:16:16,800 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:16,801 INFO L85 PathProgramCache]: Analyzing trace with hash 380357526, now seen corresponding path program 2 times [2022-11-21 17:16:16,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:16,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424020029] [2022-11-21 17:16:16,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:16,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 17:16:17,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:17,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424020029] [2022-11-21 17:16:17,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424020029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:17,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:17,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:16:17,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792714536] [2022-11-21 17:16:17,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:17,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:16:17,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:17,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:16:17,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:16:17,644 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-11-21 17:16:17,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 213 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 198.16666666666666) internal successors, (1189), 6 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:17,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:17,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-11-21 17:16:17,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:19,112 INFO L130 PetriNetUnfolder]: 2179/4775 cut-off events. [2022-11-21 17:16:19,113 INFO L131 PetriNetUnfolder]: For 2594/2602 co-relation queries the response was YES. [2022-11-21 17:16:19,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10312 conditions, 4775 events. 2179/4775 cut-off events. For 2594/2602 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 38666 event pairs, 1692 based on Foata normal form. 0/4536 useless extension candidates. Maximal degree in co-relation 10244. Up to 3230 conditions per place. [2022-11-21 17:16:19,164 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 87 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-11-21 17:16:19,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 256 transitions, 834 flow [2022-11-21 17:16:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:16:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-21 17:16:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1248 transitions. [2022-11-21 17:16:19,168 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7536231884057971 [2022-11-21 17:16:19,168 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1248 transitions. [2022-11-21 17:16:19,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1248 transitions. [2022-11-21 17:16:19,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:19,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1248 transitions. [2022-11-21 17:16:19,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:19,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:19,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:19,176 INFO L175 Difference]: Start difference. First operand has 237 places, 213 transitions, 534 flow. Second operand 6 states and 1248 transitions. [2022-11-21 17:16:19,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 256 transitions, 834 flow [2022-11-21 17:16:19,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 256 transitions, 805 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-11-21 17:16:19,184 INFO L231 Difference]: Finished difference. Result has 233 places, 212 transitions, 519 flow [2022-11-21 17:16:19,184 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=233, PETRI_TRANSITIONS=212} [2022-11-21 17:16:19,185 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -22 predicate places. [2022-11-21 17:16:19,185 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 212 transitions, 519 flow [2022-11-21 17:16:19,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.16666666666666) internal successors, (1189), 6 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:19,186 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:16:19,186 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:16:19,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 17:16:19,187 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-21 17:16:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:19,188 INFO L85 PathProgramCache]: Analyzing trace with hash -515209570, now seen corresponding path program 1 times [2022-11-21 17:16:19,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:19,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119458519] [2022-11-21 17:16:19,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:19,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 17:16:19,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:19,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119458519] [2022-11-21 17:16:19,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119458519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:19,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:19,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:16:19,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719616412] [2022-11-21 17:16:19,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:19,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:16:19,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:19,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:16:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:16:19,313 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-21 17:16:19,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 212 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:19,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:16:19,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-21 17:16:19,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:16:19,574 INFO L130 PetriNetUnfolder]: 145/910 cut-off events. [2022-11-21 17:16:19,575 INFO L131 PetriNetUnfolder]: For 251/275 co-relation queries the response was YES. [2022-11-21 17:16:19,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 910 events. 145/910 cut-off events. For 251/275 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4879 event pairs, 69 based on Foata normal form. 1/874 useless extension candidates. Maximal degree in co-relation 1402. Up to 211 conditions per place. [2022-11-21 17:16:19,581 INFO L137 encePairwiseOnDemand]: 274/276 looper letters, 0 selfloop transitions, 0 changer transitions 211/211 dead transitions. [2022-11-21 17:16:19,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 211 transitions, 549 flow [2022-11-21 17:16:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:16:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:16:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2022-11-21 17:16:19,584 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-11-21 17:16:19,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 702 transitions. [2022-11-21 17:16:19,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 702 transitions. [2022-11-21 17:16:19,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:16:19,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 702 transitions. [2022-11-21 17:16:19,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:19,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:19,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:19,589 INFO L175 Difference]: Start difference. First operand has 233 places, 212 transitions, 519 flow. Second operand 3 states and 702 transitions. [2022-11-21 17:16:19,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 211 transitions, 549 flow [2022-11-21 17:16:19,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 211 transitions, 542 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 17:16:19,593 INFO L231 Difference]: Finished difference. Result has 230 places, 0 transitions, 0 flow [2022-11-21 17:16:19,595 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=230, PETRI_TRANSITIONS=0} [2022-11-21 17:16:19,595 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -25 predicate places. [2022-11-21 17:16:19,596 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 0 transitions, 0 flow [2022-11-21 17:16:19,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:16:19,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (79 of 80 remaining) [2022-11-21 17:16:19,599 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (78 of 80 remaining) [2022-11-21 17:16:19,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (77 of 80 remaining) [2022-11-21 17:16:19,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 80 remaining) [2022-11-21 17:16:19,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (75 of 80 remaining) [2022-11-21 17:16:19,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 80 remaining) [2022-11-21 17:16:19,600 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 80 remaining) [2022-11-21 17:16:19,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (72 of 80 remaining) [2022-11-21 17:16:19,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (71 of 80 remaining) [2022-11-21 17:16:19,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 80 remaining) [2022-11-21 17:16:19,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (69 of 80 remaining) [2022-11-21 17:16:19,601 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (68 of 80 remaining) [2022-11-21 17:16:19,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (67 of 80 remaining) [2022-11-21 17:16:19,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (66 of 80 remaining) [2022-11-21 17:16:19,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 80 remaining) [2022-11-21 17:16:19,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (64 of 80 remaining) [2022-11-21 17:16:19,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (63 of 80 remaining) [2022-11-21 17:16:19,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 80 remaining) [2022-11-21 17:16:19,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (61 of 80 remaining) [2022-11-21 17:16:19,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 80 remaining) [2022-11-21 17:16:19,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (59 of 80 remaining) [2022-11-21 17:16:19,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (58 of 80 remaining) [2022-11-21 17:16:19,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (57 of 80 remaining) [2022-11-21 17:16:19,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (56 of 80 remaining) [2022-11-21 17:16:19,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (55 of 80 remaining) [2022-11-21 17:16:19,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (54 of 80 remaining) [2022-11-21 17:16:19,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (53 of 80 remaining) [2022-11-21 17:16:19,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (52 of 80 remaining) [2022-11-21 17:16:19,606 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (51 of 80 remaining) [2022-11-21 17:16:19,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (50 of 80 remaining) [2022-11-21 17:16:19,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (49 of 80 remaining) [2022-11-21 17:16:19,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (48 of 80 remaining) [2022-11-21 17:16:19,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (47 of 80 remaining) [2022-11-21 17:16:19,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 80 remaining) [2022-11-21 17:16:19,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (45 of 80 remaining) [2022-11-21 17:16:19,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 80 remaining) [2022-11-21 17:16:19,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 80 remaining) [2022-11-21 17:16:19,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (42 of 80 remaining) [2022-11-21 17:16:19,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (41 of 80 remaining) [2022-11-21 17:16:19,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (40 of 80 remaining) [2022-11-21 17:16:19,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 80 remaining) [2022-11-21 17:16:19,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (38 of 80 remaining) [2022-11-21 17:16:19,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 80 remaining) [2022-11-21 17:16:19,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 80 remaining) [2022-11-21 17:16:19,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (35 of 80 remaining) [2022-11-21 17:16:19,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2022-11-21 17:16:19,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2022-11-21 17:16:19,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 80 remaining) [2022-11-21 17:16:19,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 80 remaining) [2022-11-21 17:16:19,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 80 remaining) [2022-11-21 17:16:19,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 80 remaining) [2022-11-21 17:16:19,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 80 remaining) [2022-11-21 17:16:19,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (27 of 80 remaining) [2022-11-21 17:16:19,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 80 remaining) [2022-11-21 17:16:19,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 80 remaining) [2022-11-21 17:16:19,611 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 80 remaining) [2022-11-21 17:16:19,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (23 of 80 remaining) [2022-11-21 17:16:19,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 80 remaining) [2022-11-21 17:16:19,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 80 remaining) [2022-11-21 17:16:19,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 80 remaining) [2022-11-21 17:16:19,612 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 80 remaining) [2022-11-21 17:16:19,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 80 remaining) [2022-11-21 17:16:19,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 80 remaining) [2022-11-21 17:16:19,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (16 of 80 remaining) [2022-11-21 17:16:19,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 80 remaining) [2022-11-21 17:16:19,613 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (14 of 80 remaining) [2022-11-21 17:16:19,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (13 of 80 remaining) [2022-11-21 17:16:19,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 80 remaining) [2022-11-21 17:16:19,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 80 remaining) [2022-11-21 17:16:19,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 80 remaining) [2022-11-21 17:16:19,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 80 remaining) [2022-11-21 17:16:19,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 80 remaining) [2022-11-21 17:16:19,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 80 remaining) [2022-11-21 17:16:19,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 80 remaining) [2022-11-21 17:16:19,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 80 remaining) [2022-11-21 17:16:19,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 80 remaining) [2022-11-21 17:16:19,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 80 remaining) [2022-11-21 17:16:19,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 80 remaining) [2022-11-21 17:16:19,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 80 remaining) [2022-11-21 17:16:19,616 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 80 remaining) [2022-11-21 17:16:19,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 17:16:19,617 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:16:19,624 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 17:16:19,625 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:16:19,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:16:19 BasicIcfg [2022-11-21 17:16:19,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:16:19,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:16:19,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:16:19,635 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:16:19,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:15:54" (3/4) ... [2022-11-21 17:16:19,642 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 17:16:19,649 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-21 17:16:19,649 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-21 17:16:19,649 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-21 17:16:19,658 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-21 17:16:19,658 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-21 17:16:19,658 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 17:16:19,659 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 17:16:19,733 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 17:16:19,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:16:19,734 INFO L158 Benchmark]: Toolchain (without parser) took 27035.95ms. Allocated memory was 146.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 117.9MB in the beginning and 765.0MB in the end (delta: -647.1MB). Peak memory consumption was 491.7MB. Max. memory is 16.1GB. [2022-11-21 17:16:19,734 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 81.9MB in the end (delta: 69.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:16:19,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.78ms. Allocated memory is still 146.8MB. Free memory was 117.3MB in the beginning and 104.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 17:16:19,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.35ms. Allocated memory is still 146.8MB. Free memory was 104.7MB in the beginning and 102.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:16:19,736 INFO L158 Benchmark]: Boogie Preprocessor took 68.78ms. Allocated memory is still 146.8MB. Free memory was 102.0MB in the beginning and 99.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:16:19,736 INFO L158 Benchmark]: RCFGBuilder took 1520.24ms. Allocated memory is still 146.8MB. Free memory was 99.3MB in the beginning and 94.5MB in the end (delta: 4.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-21 17:16:19,737 INFO L158 Benchmark]: TraceAbstraction took 24825.12ms. Allocated memory was 146.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 93.7MB in the beginning and 769.2MB in the end (delta: -675.5MB). Peak memory consumption was 464.1MB. Max. memory is 16.1GB. [2022-11-21 17:16:19,738 INFO L158 Benchmark]: Witness Printer took 98.36ms. Allocated memory is still 1.3GB. Free memory was 769.2MB in the beginning and 765.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 17:16:19,742 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 81.9MB in the end (delta: 69.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.78ms. Allocated memory is still 146.8MB. Free memory was 117.3MB in the beginning and 104.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.35ms. Allocated memory is still 146.8MB. Free memory was 104.7MB in the beginning and 102.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.78ms. Allocated memory is still 146.8MB. Free memory was 102.0MB in the beginning and 99.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1520.24ms. Allocated memory is still 146.8MB. Free memory was 99.3MB in the beginning and 94.5MB in the end (delta: 4.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24825.12ms. Allocated memory was 146.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 93.7MB in the beginning and 769.2MB in the end (delta: -675.5MB). Peak memory consumption was 464.1MB. Max. memory is 16.1GB. * Witness Printer took 98.36ms. Allocated memory is still 1.3GB. Free memory was 769.2MB in the beginning and 765.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 360 locations, 80 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.6s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 497 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 mSDsluCounter, 349 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2095 IncrementalHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 276 mSDtfsCounter, 2095 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=534occurred in iteration=18, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 2139 NumberOfCodeBlocks, 2139 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 4419 SizeOfPredicates, 6 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 34/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-21 17:16:19,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c0b0991-c20a-41e2-b6dc-5f906d3aac6a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE